Identifying relevant messages in a conversation graph
US-9449050-B1 · Sep 20, 2016 · US
US10409873B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10409873-B2 |
| Application number | US-201414554190-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 26, 2014 |
| Priority date | Nov 26, 2014 |
| Publication date | Sep 10, 2019 |
| Grant date | Sep 10, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
In one embodiment, a method includes receiving, from a client device of a first user of an online social network, a search query associated with a first topic. The method also includes identifying one or more key-authors associated with the first topic. The method further includes retrieving multiple objects of the online social network matching the search query, where one or more of the retrieved objects are associated with the first topic and are authored by at least one of the identified key-authors. The method also includes generating multiple search-results modules, each search-result module including references to one or more of the retrieved objects. At least one of the search-results modules is a key-authors-module that includes references to one or more of the retrieved objects associated with the first topic that are authored by at least one of the identified key-authors.
Opening claim text (preview).
What is claimed is: 1. A method comprising, by one or more computing devices of an online social network: receiving, from a client device of a first user of the online social network, a search query comprising one or more n-grams, wherein the search query is associated with a first topic, wherein the first topic is an identifier corresponding to a particular event or subject matter and is determined from a topic database of the online social network comprising an index of a plurality of pre-identified topics; identifying one or more key-authors associated with the first topic, each key-author being a second user of the online social network that has been determined to be relevant to the first topic from a key-author database comprising an index of a plurality of pre-identified key-authors corresponding to the plurality of pre-identified topics; retrieving a plurality of objects of the online social network matching the one or more n-grams of the search query, wherein one or more of the retrieved objects are associated with the first topic and are authored by at least one of the identified key-authors; generating a plurality of search-results modules, each search-result module comprising references to a plurality of the retrieved objects matching the one or more n-grams of the search query, wherein at least one of the search-results modules is a key-authors-module comprising references to the plurality of the retrieved objects matching the one or more n-grams of the search query associated with the first topic, each of the retrieved objects matching the one or more n-grams of the search query referenced in the key-authors-module being authored by at least one of the identified key-authors that has been determined to be relevant to the first topic; and sending, to the client device of the first user for display, a search-results page responsive to the search query, the search-results page comprising a plurality of search-results modules, wherein at least one of the search-results modules is the key-authors-module comprising references to the plurality of the retrieved objects authored by one or more of the identified key-authors. 2. The method of claim 1 , wherein the identified key-authors comprise one or more subject-authors, each subject-author being referenced in one or more of the retrieved objects associated with the first topic. 3. The method of claim 1 , wherein the identified key-authors comprise one or more expert-authors, each expert-author being an author of greater than a threshold number of objects associated with the first topic. 4. The method of claim 1 , wherein the identified key-authors comprise one or more journalists, each journalist being an author of a plurality of objects associated with the first topic. 5. The method of claim 1 , wherein the identified key-authors comprise one or more derivative-expert-authors, each derivative-expert-author being an author of one or more objects associated with the first topic, wherein the objects authored by the derivative-expert-authors have received greater than a threshold number of comments from one or more expert-authors. 6. The method of claim 1 , wherein the identified key-authors comprise one or more eyewitness-authors, each eyewitness-author being associated with a timeframe and a location that are also associated with the first topic. 7. The method of claim 1 , further comprising accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, and each node corresponding to an object associated with the online social network. 8. The method of claim 7 , wherein the identified key-authors comprise one or more indirect-subject-authors, each indirect-subject-author being within a threshold degree of separation of a subject-author within the social graph. 9. The method of claim 1 , wherein identifying the one or more key-authors associated with the first topic comprises: crawling a third-party system to identify one or more objects associated with the first topic; and extracting one or more candidate key-author names from one or more of the identified objects. 10. The method of claim 9 , further comprising comparing the one or more candidate key-author names with names of users of the online social network. 11. The method of claim 9 , further comprising comparing the one or more candidate key-author names with information from an online index. 12. The method of claim 1 , wherein identifying the one or more key-authors associated with the first topic comprises: identifying objects in the online social network associated with the first topic; and extracting one or more candidate key-author names from one or more of the identified objects. 13. The method of claim 1 , further comprising determining an author-score for each of the identified key-authors, the author-score for each identified key-author based at least in part on a relevance of the key-author to the first topic. 14. The method of claim 13 , wherein each of the at least one of the identified key-authors has an author-score greater than a threshold author-score. 15. The method of claim 1 , wherein the key-authors-module comprises references to one or more posts, comments, articles, photos, videos, events, applications, or web pages authored by one or more of the identified key-authors. 16. The method of claim 1 , further comprising determining an object score for each of the retrieved objects associated with the first topic and authored by at least one of the identified key-authors, the object score being based at least in part on a relevance of the retrieved object to the search query. 17. The method of claim 16 , wherein each reference in the key-authors-module corresponds to a retrieved object having an object score greater than a threshold object score. 18. The method of claim 16 , wherein the references in the key-authors-module are ordered according to the object scores for the respective retrieved objects. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to: receive, from a client device of a first user of the online social network, a search query comprising one or more n-grams, wherein the search query is associated with a first topic, wherein the first topic is an identifier corresponding to a particular event or subject matter and is determined from a topic database of the online social network comprising an index of a plurality of pre-identified topics; identify one or more key-authors associated with the first topic, each key-author being a second user of the online social network that has been determined to be relevant to the first topic from a key-author database comprising an index of a plurality of pre-identified key-authors corresponding to the plurality of pre-identified topics; retrieve a plurality of objects of the online social network matching the one or more n-grams of the search query, wherein one or more of the retrieved objects are associated with the first topic and are authored by at least one of the identified key-authors; generate a plurality of search-results modules, each search-result module comprising references to a plurality of the retrieved objects matching the one or more n-grams of the search query, wherein at least one of the search-results modules is a key-authors-module comprising references to the plurality of the retrieved objects matching the one or more n-grams of the search
Business processes related to social networking or social networking services · CPC title
Search customisation based on user profiles and personalisation · CPC title
Physics · mapped topic
Search customisation based on social or collaborative filtering · CPC title
Determination of affinities or common interests between users · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.