# US 2019/0066054 A1 · Accuracy of member profile retrieval using a universal concept graph

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0066054 A1
- Document ID: US20190066054A1
- Status: Published application
- Kind: A1
- Application number: 15/685,628
- Filed: 2017-08-24
- Published: 2019-02-28
- Earliest claimed: 2017-08-24
- Assignees: Linkedln Corporation
- Applicants: Linkedln Corporation
- Inventors: Krishnaram Kenthapadi; Fedor Vladimirovich Borisyuk; Parul Jain
- Web page: https://patentgrep.com/patent/US20190066054A1

## CPC

- G06Q 10/1053: Employment or hiring
- G06F 16/435: Filtering based on additional data, e.g. user or group profiles
- G06Q 10/063112: {Skill-based matching of a person or a group to a task}
- G06Q 10/42: Determination of affinities or common interests between users
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

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.

## Claims

### Claim 1

A method comprising:
accessing a first record of a database, the first record identifying a universal concept graph, the universal concept graph including a first set of nodes and a first set of edges, the first set of nodes corresponding to concept phrases included in one or more documents associated with a social networking service (SNS), the first set of edges connecting a plurality of nodes of the universal concept graph;
accessing a second record of the database, the second record identifying a first induced concept graph associated with a job description, the first induced concept graph including a second set of nodes that represent one or more concept phrases derived from the job description, and a second set of edges that connect a plurality of nodes of the second set of nodes;
identifying a numerical value that represents a desired number of member profiles associated with members of the SNS;
for a member profile of one or more member profiles, generating a similarity value based on the first induced concept graph associated with the job description, and a second induced concept graph associated with the member profile, the similarity value representing a degree of similarity between the job description and the member profile, the generating being performed using one or more hardware processors; and
causing a presentation of one or more identifiers of the one or more member profiles in a user interface of a client device based on the numerical value and based on similarity values associated with the one or more identifiers of the one or more member profiles.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
accessing a candidate set of member profiles that match the job description, the candidate set of member profiles being greater than or equal to the numerical value that represents the desired number of member profiles,
wherein the member profile is included in the candidate set of member profiles.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
generating a candidate set of member profiles that match the job description, the generating of the candidate set of member profiles being based on data included in one or more fields of the job description and an index of one or more member profiles associated with the SNS.

### Claim 4 (depends on 3)

The method of claim 3, wherein the generating of the candidate set of member profiles is further based on a schema that defines a ranking of member profiles using keyword location in member profiles.

### Claim 5 (depends on 3)

The method of claim 3, wherein the generating of the candidate set of member profiles is further based on weight values associated with the one or more member profiles, the weight values being determined based on a number of keywords matched in the job description and a particular member profile.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
for the member profile, generating the second induced concept graph associated with the member profile based on an analysis of the member profile and the universal concept graph, the second induced graph including a third set of nodes that represent one or more concept phrases derived from the member profile, and a third set of edges that connect a plurality of nodes of the second induced graph.

### Claim 7 (depends on 1)

The method of claim 1, wherein the generating, for the member profile, of the similarity score includes:
identifying the degree of similarity between the job description and the member profile based on applying one or more graph analysis algorithms to the first induced concept graph and the second induced concept graph.

### Claim 8 (depends on 7)

The method of claim 7, wherein the identifying of the degree of similarity between the job description and the member profile is further based on applying one or more weighting algorithms to the at least one of the first induced concept graph or the second induced concept graph.

### Claim 9 (depends on 7)

The method of claim 7, wherein the one or more graph analysis algorithms includes a random walk algorithm.

### Claim 10 (depends on 9)

The method of claim 9, wherein each of the nodes included in the second induced concept graph is tagged with a location, in the member profile, of the concept corresponding to a particular node in the second induced concept graph, and
wherein the random walk algorithm is performed until a node tagged as appearing in a skill field is identified in the member profile.

### Claim 11 (depends on 1)

The method of claim 1, wherein the generating of the similarity value is further based on a random walk algorithm and one or more weight values associated with one or more nodes of the first induced concept graph associated with the job description.

### Claim 12 (depends on 11)

The method of claim 11, wherein the one or more weight values are binary.

### Claim 13 (depends on 11)

The method of claim 11, wherein a weight value of a node corresponding to a concept phrase in the job description is determined based on a location of the concept phrase in the job description.

### Claim 14 (depends on 1)

The method of claim 1, further comprising:
generating a ranking of the one or more identifiers of the one or more member profiles based on similarity values associated with the one or more identifiers of the one or more member profiles,
wherein the causing of the presentation is further based on the ranking of the one or more identifiers of the one or more member profiles.

### Claim 15

A system comprising:
one or more hardware processors; and
a machine-readable medium for storing instructions that, when executed by the one or more hardware processors, cause the system to perform operations comprising:
accessing a first record of a database, the first record identifying a universal concept graph, the universal concept graph including a first set of nodes and a first set of edges, the first set of nodes corresponding to concept phrases included in one or more documents associated with a social networking service (SNS), the first set of edges connecting a plurality of nodes of the universal concept graph;
accessing a second record of the database, the second record identifying a first induced concept graph associated with a job description, the first induced concept graph including a second set of nodes that represent one or more concept phrases derived from the job description, and a second set of edges that connect a plurality of nodes of the second set of nodes;
identifying a numerical value that represents a desired number of member profiles associated with members of the SNS;
for a member profile of one or more member profiles, generating a similarity value based on the first induced concept graph associated with the job description, and a second induced concept graph associated with the member profile, the similarity value representing a degree of similarity between the job description and the member profile; and
causing a presentation of one or more identifiers of the one or more member profiles in a user interface of a client device based on the numerical value and based on similarity values associated with the one or more identifiers of the one or more member profiles.

### Claim 16 (depends on 15)

The system of claim 15, wherein the generating, for the member profile, of the similarity score includes:
identifying the degree of similarity between the job description and the member profile based on applying one or more graph analysis algorithms to the first induced concept graph and the second induced concept graph.

### Claim 17 (depends on 16)

The system of claim 16, wherein the identifying of the degree of similarity between the job description and the member profile is further based on applying one or more weighting algorithms to the at least one of the first induced concept graph or the second induced concept graph.

### Claim 18 (depends on 16)

The system of claim 16, wherein the one or more graph analysis algorithms includes a random walk algorithm.

### Claim 19 (depends on 18)

The system of claim 18, wherein each of the nodes included in the second induced concept graph is tagged with a location, in the member profile, of the concept corresponding to a particular node in the second induced concept graph, and
wherein the random walk algorithm is performed until a node tagged as appearing in a skill field is identified in the member profile.

### Claim 20

A non-transitory machine-readable storage medium comprising instructions that, when executed by one or more processors of a machine, cause the machine to perform operations comprising:
accessing a first record of a database, the first record identifying a universal concept graph, the universal concept graph including a first set of nodes and a first set of edges, the first set of nodes corresponding to concept phrases included in one or more documents associated with a social networking service (SNS), the first set of edges connecting a plurality of nodes of the universal concept graph;
accessing a second record of the database, the second record identifying a first induced concept graph associated with a job description, the first induced concept graph including a second set of nodes that represent one or more concept phrases derived from the job description, and a second set of edges that connect a plurality of nodes of the second set of nodes;
identifying a numerical value that represents a desired number of member profiles associated with members of the SNS;
for a member profile of one or more member profiles, generating a similarity value based on the first induced concept graph associated with the job description, and a second induced concept graph associated with the member profile, the similarity value representing a degree of similarity between the job description and the member profile; and
causing a presentation of one or more identifiers of the one or more member profiles in a user interface of a client device based on the numerical value and based on similarity values associated with the one or more identifiers of the one or more member profiles.
