SYSTEM AND METHOD FOR MATCHING A PROFILE TO A SPARSELY DEFINED REQUEST
First Claim
Patent Images
1. A method for matching a task request to a profile of a first community, where the profiles complete interactions of a task request through the first community comprising:
- vectorizing at least one field of a task request and at least one field of an operator profile for a plurality of task requests and operator profiles of the first community;
receiving a request to match a task request with a first profile of the first community;
for each inspected task request from the plurality of task requests of the first community, calculating at least one profile vector similarity score of the first profile compared to the profiles that completed the inspected task;
for each inspected task request from the plurality of task requests of the first community, calculating at least one task vector similarity score of the inspected task compared with a set of tasks with completed interactions by the first profile;
calculating a composite score for each inspected task request from the plurality of task requests of the first community, wherein calculating the composite score of a task request comprises applying a weighting heuristic to at least one task vector similarity score and at least one profile vector similarity score;
selecting at least one matched task request according to the composite scores of the plurality of task requests; and
outputting the at least one matched task request of the first profile.
1 Assignment
0 Petitions
Accused Products
Abstract
A method and system that can include providing a request matching service within a community, receiving a request to match a task request with a first profile of the community, calculating a set of multi-layered composite similarity scores, selecting at least one matched task request according to composite scores, and outputting at least one matched task request of the first profile.
-
Citations
20 Claims
-
1. A method for matching a task request to a profile of a first community, where the profiles complete interactions of a task request through the first community comprising:
-
vectorizing at least one field of a task request and at least one field of an operator profile for a plurality of task requests and operator profiles of the first community; receiving a request to match a task request with a first profile of the first community; for each inspected task request from the plurality of task requests of the first community, calculating at least one profile vector similarity score of the first profile compared to the profiles that completed the inspected task; for each inspected task request from the plurality of task requests of the first community, calculating at least one task vector similarity score of the inspected task compared with a set of tasks with completed interactions by the first profile; calculating a composite score for each inspected task request from the plurality of task requests of the first community, wherein calculating the composite score of a task request comprises applying a weighting heuristic to at least one task vector similarity score and at least one profile vector similarity score; selecting at least one matched task request according to the composite scores of the plurality of task requests; and outputting the at least one matched task request of the first profile. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A method comprising:
-
obtaining a plurality of tasks submitted to a first community; obtaining a plurality of profiles submitted to the first community; vectorizing at least one field of obtained tasks and at least one field of obtained profiles; providing an interface through which a profile can complete interactions with a task and recording a mapping between a task and a profile when profile completes an interaction with a task; receiving a request to match at least one task to a first profile of the plurality of profiles; generating a set of sub-scores for each inspected task of the plurality of tasks, for at least one sub-score of the set of sub-scores calculating a profile similarity score of a first vector of the first profile to first vectors of profiles that are mapped to the inspected task; for at least one sub-score of the set of sub-scores, calculating a task similarity score for the similarity between the inspected task to each task mapped to the first profile. for at least one sub-score of the set of sub-scores, calculating similarity score for each inspected task compared to the first profile; for each inspected task, calculating a composite score from the set of sub-scores of a corresponding inspected task, wherein calculating the composite score comprises applying a weighting heuristic to at least one task similarity score and at least one profile similarity score; selecting at least one matched task request according to the composite scores of the plurality of tasks; and outputting the at least one matched task request of the first profile. - View Dependent Claims (18, 19, 20)
-
Specification