| 发明名称 |
OPTIMAL COURSE SELECTION |
| 摘要 |
In an example embodiment, a method is provided where information regarding a member of a social networking service and a job opening are obtained. Then information about a plurality of courses available for the member to take is obtained, the information including cost, time, and a vector including, for each of a plurality of skills identified in a member profile of the member, an effect of taking the corresponding course. A subset selection algorithm is then used to select an optimal combination of courses selected from the plurality of courses, based on minimizing cost and time while maximizing cumulative increase in odds of the member successfully obtaining the job opening from taking the selected courses. |
| 申请公布号 |
US2017032324(A1) |
申请公布日期 |
2017.02.02 |
| 申请号 |
US201514814405 |
申请日期 |
2015.07.30 |
| 申请人 |
Linkedln Corporation |
发明人 |
Grover Aman;You Siyu;Kenthapadi Krishnaram;Jain Parul;Borisyuk Fedor Vladimirovich;Degiere Christopher Matthew;Guo Songtao |
| 分类号 |
G06Q10/10;G06Q50/00;G06Q50/20 |
主分类号 |
G06Q10/10 |
| 代理机构 |
|
代理人 |
|
| 主权项 |
1. A computer-implemented method comprising:
obtaining information regarding a member of a social networking service and a job opening; obtaining information about a plurality of courses available for the member to take, the information including cost, time, and a vector including, for each of a plurality of skills identified in a member profile of the member, an effect of taking the corresponding course; and using a subset selection algorithm to select an optimal combination of courses selected from the plurality of courses, based on minimizing cost and time while maximizing cumulative increase in odds of the member successfully obtaining the job opening from taking the selected courses. |
| 地址 |
Mountain View CA US |
