Patent Document ID: 9146986
Application ID: 13828792

Base Claim:
1. A method comprising: retrieving contextually relevant data for a plurality of concepts within an entity graph of the social network system; retrieving socially relevant data for a user's node within a social graph of the social network system including (a) socially relevant data of the user's node describing relationships to friend nodes of the user's node within the social graph and (b) one or more linked concept nodes within the entity graph expressly related to the user's node within the social graph or to the friends nodes of the users nodes or both, by (i) retrieving a list of entity objects representing the plurality of concepts within the entity graph of the social network system, (ii) filtering the retrieved list of entity objects by eliminating any entity object representing a linked concept expressly related to the user's node within the social graph, (iii) referencing a plurality of sub-concepts of the remaining entity objects within the filtered list of entity objects by accessing linked entity objects within the entity graph representing the plurality of sub-concepts, the linked entity objects expressly related to the entity objects, and (iv) querying the remaining entity objects within the filtered list of entity objects and the plurality of sub-concepts of the remaining entity objects for metadata of the respective entity objects, wherein the contextually relevant data is the metadata, and the plurality of concepts within the entity graph are not linked to the user's node within the social graph; identifying intersects between the plurality of concepts within the entity graph and the social relevant data for the user's node within the social graph; selecting one of the plurality of concepts within the entity graph based on the intersects identified; and displaying the one of the plurality of concepts within the entity graph at a user interface associated with the user's node.

---

Claim 10:
10. The method of claim 1 , wherein selecting one of the plurality of concepts within the entity graph based on the intersects identified, comprises: creating a common dataset from: (a) the entity objects representing the plurality of concepts which are not expressly linked to the user's node, (b) friend objects representing the friend nodes of the user's node and expressly linked to the user's node, and (c) linked entity objects representing the one or more linked concept nodes expressly related to a user's object representing the user's node; scoring the entries in the common dataset by applying a TF-IDF (Term Frequency-Inverse Document Frequency) utility to the common dataset, wherein the TF-IDF utility returns a score for each entry of the common dataset, wherein the scores increase proportionally for entries according to frequency of the entry in the common dataset offset by the frequency of the entry in the common dataset; and selecting the one of the plurality of concepts associated with the entry having the highest score.