INFERRING TOPICS FROM SOCIAL NETWORKING SYSTEM COMMUNICATIONS

• US 20120331063A1
• Filed: 06/24/2011
• Published: 12/27/2012
• Est. Priority Date: 06/24/2011
• Status: Active Grant

• Current Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Original Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Inventors: Rajaram, Giridhar
• Granted Patent: US 9,779,385 B2
• Time in Patent Office: Days
• US Class Current: 709/206
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: G06Q 50/01 Social networking

Abstract

A social networking system determines the meaning of an anchor term used in a communication received from a communicating user. Candidate nodes are identified in the dictionary based on the anchor term, where each candidate node represents a possible meaning of the anchor term. The context of the anchor term is determined, and a score is determined for each candidate node based on the determined context. A candidate node is selected that most likely represents the meaning of the anchor term based on the determined candidate node scores. The context of the anchor term may be a social context derived from users connected to the communicating user that use the anchor term in communications. A communicating user may be prompted to identify the meaning of the anchor term explicitly based on the use of the term in communications from other users connected to the communicating user.

Claims

1. A computer-implemented method for determining a topic of a communication term in a social networking system, the method comprising:

receiving a dictionary comprising a set of nodes, wherein each node represents a topic;

receiving a communication from a communicating user;

identifying an anchor term in the communication;

identifying candidate nodes based on the anchor term, wherein candidate nodes comprise dictionary nodes representing subjects related to the anchor term;

determining a context of the anchor term in the communication;

determining a score for each of one or more of the candidate nodes based on the determined context; and

selecting a candidate node to represent the meaning of the anchor term based on the determined scores.

2. The computer-implemented method of claim 1, wherein receiving a dictionary comprises:

retrieving a database of articles, wherein one or more pairs of articles are linked;

creating a node for each of one or more of the articles, the node comprising the topic of the article; and

for each pair of nodes corresponding to linked articles, connecting the pair of nodes with an edge.

3. The computer-implemented method of claim 2, wherein the database of articles comprises a web-based database, wherein each article is represented by a web page within the web-based database, and wherein two articles are linked if the web page representing one of the articles contains a URL link to the other article.

4. The computer-implemented method of claim 2, wherein each node additionally comprises synonyms and alternative grammatical representations of the topic of the article.

5. The computer-implemented method of claim 1, wherein receiving a dictionary comprises updating a previously existing dictionary.

6. The computer-implemented method of claim 1, wherein the received communication comprises a status update.

7. The computer-implemented method of claim 6, wherein the status update is posted to the communicating user'"'"'s social networking system profile.

8. The computer-implemented method of claim 1, wherein the received communication comprises one of:

an email, an instant message, and a text/SMS message.

9. The computer-implemented method of claim 1, wherein the received communication comprises a comment on a content item.

10. The computer-implemented method of claim 1, wherein the communication is received via a social networking system user interface.

11. The computer-implemented method of claim 1, wherein identifying an anchor term in the communication comprises:

parsing the communication into one or more terms, wherein each term comprises a set of alpha-numeric characters; and

selecting one of the one or more parsed terms for use as the anchor term.

12. The computer-implemented method of claim 11, wherein articles, interjections, conjunctions and prepositions are removed from the communication prior to parsing the communication into one or more terms.

13. The computer-implemented method of claim 12, wherein adverbs and pronouns are removed from the communication prior to parsing the communication into one or more terms.

14. The computer-implemented method of claim 11, wherein each parsed term comprises a noun.

15. The computer-implemented method of claim 11, wherein selecting one of the one or more parsed terms for use as the anchor term comprises selecting the least ambiguous parsed term.

16. The computer-implemented method of claim 11, wherein selecting one of the one or more parsed terms for use as the anchor term comprises selecting the most ambiguous parsed term.

17. The computer-implemented method of claim 1, wherein identifying candidate nodes based on the anchor term comprises performing a keyword search of the dictionary for candidate nodes including anchor term text.

18. The computer-implemented method of claim 1, wherein determining the context of the anchor term in the communication comprises determining terms in the communication other than the anchor term.

19. The computer-implemented method of claim 18, wherein the context of the anchor term comprises a verb modifying the anchor term.

20. The computer-implemented method of claim 18, wherein the context of the anchor term comprises a noun related to the anchor term.

21. The computer-implemented method of claim 1, wherein determining the context of the anchor term in the communication comprises determining the global context of the anchor term in communications containing the anchor term by users of the social networking system.

22. The computer-implemented method of claim 1, wherein determining the context of the anchor term in the communication comprises determining the social context of the anchor term in communications containing the anchor term by users of the social networking system connected to the communicating user.

23. The computer-implemented method of claim 1, wherein determining the context of the anchor term in the communication comprises determining user information related to the communicating user.

24. The computer-implemented method of claim 23, wherein user information related to the communicating user comprises interests of the communicating user.

25. The computer-implemented method of claim 1, wherein determining a score for a candidate node based on the determined context comprises:

determining an initial score for the candidate node;

identifying a dictionary node related to the determined context;

increasing the initial score for the candidate node in response to a determination that the identified dictionary node is related to the candidate node.

26. The computer-implemented method of claim 1, wherein selecting a candidate node based on the determined scores comprises selecting the candidate node with the highest score.

27. The computer-implemented method of claim 1, further comprising:

determining one or more candidate nodes unlikely to represent the meaning of the anchor term; and

eliminating the determined one or more candidate nodes from consideration.

28. The computer-implemented method of claim 27, further comprising:

creating a category tree comprising a hierarchical organization of dictionary nodes, wherein each category tree node has no more than one parent node and any number of child nodes, wherein each node represents a subset of the topic represented by the node'"'"'s parent node, and wherein each node is connected by an edge to the node'"'"'s parent node and to each of the node'"'"'s child nodes.

29. The computer-implemented method of claim 28, wherein determining one or more candidate nodes unlikely to represent the meaning of the anchor term comprises:

for each candidate node;

identifying a term in the communication other than the anchor term;

determining a first category tree node associated with the identified term;

determining a second category tree node associated with the candidate node; and

determining a measure of relatedness between the first category tree node and the second category tree node; and

determining one or more candidate nodes unlikely to represent the meaning of the anchor term based on the determined measures of relatedness.

30. The computer-implemented method of claim 29, wherein the determined measure of relatedness between the first category tree node and the second category tree node comprises the minimum number of edges between the first category tree node and the second category tree node in the category tree.

31. The computer-implemented method of claim 27, wherein determining one or more candidate nodes unlikely to represent the meaning of the anchor term comprises determining all candidate nodes that fail to meet a pre-determined threshold of relatedness to the anchor term.

32. The computer-implemented method of claim 27, wherein determining one or more candidate nodes unlikely to represent the meaning of the anchor term comprises determining a pre-determined number of candidate nodes that are unlikely to represent the meaning of the anchor term.

33. The computer-implemented method of claim 27, wherein eliminating the determined one or more candidate nodes from consideration comprises removing the determined one or more candidate nodes from the set of candidate nodes prior to determining a score for each of one or more of the candidate nodes.