Suggesting Tags on Online Social Networks
US-2017177589-A1 · Jun 22, 2017 · US
US10102295B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10102295-B2 |
| Application number | US-201715642166-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 5, 2017 |
| Priority date | Dec 19, 2014 |
| Publication date | Oct 16, 2018 |
| Grant date | Oct 16, 2018 |
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 a first query inputted by a first user at a first client system, the first query including one or more n-grams; identifying ideograms, each ideogram being associated with one or more tags, each identified ideogram being associated with at least one tag matching at least one of the n-grams of the received first query; calculating, for each identified ideogram, a use-probability for the ideogram given the received first query, wherein the use-probability is based at least in part on a frequency of use associated with the ideogram; and sending, to the first client system, instructions for presenting a first set of ideograms comprising one or more of the identified ideograms, the first set being determined based on the calculated use-probabilities associated with the ideograms.
Opening claim text (preview).
What is claimed is: 1. A method comprising, by one or more computing devices: receiving, from a first client system of a first user, a first query inputted by the first user at the first client system, the first query comprising one or more n-grams; identifying one or more ideograms, each ideogram being associated with one or more tags, each identified ideogram being associated with at least one tag matching at least one of the n-grams of the received first query; calculating, for each identified ideogram, a use-probability for the ideogram given the received first query, wherein the use-probability is based at least in part on a frequency of use associated with the ideogram; sending, to the first client system, instructions for presenting a first set of ideograms comprising one or more of the identified ideograms, the first set being determined based on the calculated use-probabilities associated with the ideograms; receiving a second query from a second client system of a second user, the second query inputted by the second user at the second client system, the second query comprising one or more n-grams; and identifying one or more ideograms, each identified ideogram associated with at least one tag matching at least one of the n-grams of the received second query. 2. The method of claim 1 , wherein at least one of the n-grams corresponds to an emoticon. 3. The method of claim 1 , wherein the first user is a user of an online social network and wherein frequency of use is determined for a plurality of users of the online social network. 4. The method of claim 1 , wherein the frequency of use is determined for the first user. 5. The method of claim 1 , wherein s denotes an ideogram, q denotes the first query, and the use-probability, P(s|q), is computed as: P ( s | q ) = P ( q | s ) · P ( s ) P ( q ) = P ( q | s ) · P ( s ) wherein [ 1 ] P ( q | s ) = number of times s was sent for q number of times s was sent for any
Search customisation based on user profiles and personalisation · CPC title
Search customisation based on social or collaborative filtering · CPC title
Physics · mapped topic
Physics · mapped topic
using probabilistic model · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.