利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

7 条记录 (耗时 0.027 秒)

    UNIVERSAL CONCEPT GRAPH FOR A SOCIAL NETWORKING SERVICE
    1.
    发明申请
    UNIVERSAL CONCEPT GRAPH FOR A SOCIAL NETWORKING SERVICE 审中-公开

    公开(公告)号：US20170242909A1

    公开(公告)日：2017-08-24

    申请号：US15052359

    申请日：2016-02-24

    申请人： Linkedln Corporation

    发明人： Krishnaram Kenthapadi ,  Fedor Vladimirovich Borisyuk ,  Parul Jain

    IPC分类号： G06F17/30 ,  G06Q50/00 ,  G06F3/0484 ,  H04L29/08

    CPC分类号： G06F16/287 ,  G06F16/9558 ,  G06Q50/01 ,  H04L67/306

    摘要： A machine may be configured to generate a universal concept graph. For example, the machine generates an internal set of concept phrases based on an internal dataset including content from internal documents associated with a social networking service (SNS). The machine generates an external set of concept phrases based on an external dataset including content from external documents that are external to the SNS. The machine generates a set of nodes for a universal concept graph based on performing a union operation of the internal set of concept phrases and the external set of concept phrases. Each node corresponds to a particular concept phrase. The machine generates a set of edges among a plurality of nodes of the set of nodes based on one or more relationship indicators for pairs of nodes. The machine generates the universal concept graph based on the set of nodes and the set of edges.

    ACCURACY OF MEMBER PROFILE RETRIEVAL USING A UNIVERSAL CONCEPT GRAPH
    2.
    发明申请
    ACCURACY OF MEMBER PROFILE RETRIEVAL USING A UNIVERSAL CONCEPT GRAPH 审中-公开

    公开(公告)号：US20190066054A1

    公开(公告)日：2019-02-28

    申请号：US15685628

    申请日：2017-08-24

    申请人： Linkedln Corporation

    发明人： Krishnaram Kenthapadi ,  Fedor Vladimirovich Borisyuk ,  Parul Jain

    IPC分类号： G06Q10/10 ,  G06Q10/06 ,  G06F17/30 ,  G06Q50/00

    摘要： A machine may be configured to identify top members of a social networking service (SNS) for a job based on a universal concept graph. For example, the machine accesses a first record that identifies a universal concept graph. The machine accesses a second record that identifies a first induced concept graph associated with a job description. The machine identifies a numerical value that represents a desired number of member profiles. The machine generates, for a member profile, a similarity value based on the first induced concept graph, and a second induced concept graph associated with the member profile. The similarity value represents a degree of similarity between the job description and the member profile. The machine causes a presentation of identifiers of member profiles in a user interface of a client device based on the numerical value and the similarity values associated with the identifiers of the member profiles.

    OPTIMAL COURSE SELECTION
    3.
    发明申请
    OPTIMAL COURSE SELECTION 审中-公开
    优选课程选择

    公开(公告)号：US20170032324A1

    公开(公告)日：2017-02-02

    申请号：US14814405

    申请日：2015-07-30

    申请人： Linkedln Corporation

    发明人： Aman Grover ,  Siyu You ,  Krishnaram Kenthapadi ,  Parul Jain ,  Fedor Vladimirovich Borisyuk ,  Christopher Matthew Degiere ,  Songtao Guo

    IPC分类号： G06Q10/10 ,  G06Q50/00 ,  G06Q50/20

    CPC分类号： G06Q10/1053 ,  G06Q50/01 ,  G06Q50/2057

    摘要： 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.

    摘要翻译： 在一个示例性实施例中，提供了一种获得关于社交网络服务和作业打开的成员的信息的方法。 然后，获得关于成员可以使用的多个课程的信息，包括成本，时间和向量的信息，对于在成员的成员简档中识别的多个技能中的每一个，包括采用相应的 课程。 然后，使用子集选择算法来选择从多个课程中选择的课程的最佳组合，其基于最小化成本和时间，同时最大化成员从获取所选课程成功地获得工作开始的可能性的累积增加。

    UNIT TEST GENERATION
    4.
    发明申请
    UNIT TEST GENERATION 审中-公开
    单元测试生成

    公开(公告)号：US20150370687A1

    公开(公告)日：2015-12-24

    申请号：US14309239

    申请日：2014-06-19

    申请人： Linkedln Corporation

    发明人： David Stein ,  Parul Jain ,  Lokesh P. Bajaj

    IPC分类号： G06F11/36 ,  H04L29/06 ,  H04L29/08

    CPC分类号： G06F11/3664 ,  G06F11/3684

    摘要： A machine may be configured to generate a unit test based on production data. For example, the machine displays, in an interactive user interface, one or more input-output pairs obtained based on a production log file generated by a production system. Each input-output pair may include an input to a first unit of code executable on the production system and an output that corresponds to the input and that is generated as a result of executing the first unit of code on the production system using the input. The machine may detect a selection of an input-output pair from the one or more input-output pairs displayed in the interactive user interface. The input-output pair may include a particular input and a particular output that corresponds to the particular input. The machine may generate a unit test for testing a second unit of code based on the selected input-output pair.

    摘要翻译： 机器可以被配置为基于生产数据生成单元测试。 例如，机器在交互式用户界面中显示基于生产系统生成的生产日志文件获得的一个或多个输入 - 输出对。 每个输入 - 输出对可以包括对在生产系统上可执行的代码的第一单元的输入和对应于输入的输出，并且作为使用输入在生产系统上执行代码的第一单元而生成的输出。 该机器可以从显示在交互式用户界面中的一个或多个输入 - 输出对中检测输入 - 输出对的选择。 输入 - 输出对可以包括特定输入和对应于特定输入的特定输出。 该机器可以基于所选择的输入 - 输出对来生成用于测试第二代码单元的单元测试。