Generating recommended search queries on online social networks
In one embodiment, a method includes accessing a social graph including a number of nodes and a number of edges connecting the nodes. Each of the edges between two of the nodes represent a single degree of separation between them. The nodes include a first node corresponding to a first user associat...
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Hua, Ming Vernal, Michael Fechete, Dan Ionut Chakradeo, Saurabh Prafulla Chen, Lu D Bhatt, Dharmesh A Himel, Alex Garg, Avichal Xiao, Xinpan Qin, Yang Huang, Yu |
| description | In one embodiment, a method includes accessing a social graph including a number of nodes and a number of edges connecting the nodes. Each of the edges between two of the nodes represent a single degree of separation between them. The nodes include a first node corresponding to a first user associated with an online social network and a number of second nodes that each correspond to a concept or a second user associated with the online social network. The method also includes generating a number of cards. Each card includes a suggested query referencing a query-domain associated with the online social network and zero or more query-filters for the query-domain. Each query-filter references one or more nodes of the number of nodes or one or more edges of the number of edges. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_AU2014367225BB2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>AU2014367225BB2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_AU2014367225BB23</originalsourceid><addsrcrecordid>eNrjZLB3T81LLUosycxLVyhKTc7PzU3NS0lNUShOTSxKzlAoLE0tykwtVsjPA6KczLxUheL85MzEHIW81JLy_KLsYh4G1rTEnOJUXijNzaDi5hri7KGbWpAfn1pckJgMNL8k3jHUyMDQxNjM3MjI1MnJyJhIZQDr3DK1</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Generating recommended search queries on online social networks</title><source>esp@cenet</source><creator>Hua, Ming ; Vernal, Michael ; Fechete, Dan Ionut ; Chakradeo, Saurabh Prafulla ; Chen, Lu D ; Bhatt, Dharmesh A ; Himel, Alex ; Garg, Avichal ; Xiao, Xinpan ; Qin, Yang ; Huang, Yu</creator><creatorcontrib>Hua, Ming ; Vernal, Michael ; Fechete, Dan Ionut ; Chakradeo, Saurabh Prafulla ; Chen, Lu D ; Bhatt, Dharmesh A ; Himel, Alex ; Garg, Avichal ; Xiao, Xinpan ; Qin, Yang ; Huang, Yu</creatorcontrib><description>In one embodiment, a method includes accessing a social graph including a number of nodes and a number of edges connecting the nodes. Each of the edges between two of the nodes represent a single degree of separation between them. The nodes include a first node corresponding to a first user associated with an online social network and a number of second nodes that each correspond to a concept or a second user associated with the online social network. The method also includes generating a number of cards. Each card includes a suggested query referencing a query-domain associated with the online social network and zero or more query-filters for the query-domain. Each query-filter references one or more nodes of the number of nodes or one or more edges of the number of edges.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2016</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20161208&DB=EPODOC&CC=AU&NR=2014367225B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20161208&DB=EPODOC&CC=AU&NR=2014367225B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Hua, Ming</creatorcontrib><creatorcontrib>Vernal, Michael</creatorcontrib><creatorcontrib>Fechete, Dan Ionut</creatorcontrib><creatorcontrib>Chakradeo, Saurabh Prafulla</creatorcontrib><creatorcontrib>Chen, Lu D</creatorcontrib><creatorcontrib>Bhatt, Dharmesh A</creatorcontrib><creatorcontrib>Himel, Alex</creatorcontrib><creatorcontrib>Garg, Avichal</creatorcontrib><creatorcontrib>Xiao, Xinpan</creatorcontrib><creatorcontrib>Qin, Yang</creatorcontrib><creatorcontrib>Huang, Yu</creatorcontrib><title>Generating recommended search queries on online social networks</title><description>In one embodiment, a method includes accessing a social graph including a number of nodes and a number of edges connecting the nodes. Each of the edges between two of the nodes represent a single degree of separation between them. The nodes include a first node corresponding to a first user associated with an online social network and a number of second nodes that each correspond to a concept or a second user associated with the online social network. The method also includes generating a number of cards. Each card includes a suggested query referencing a query-domain associated with the online social network and zero or more query-filters for the query-domain. Each query-filter references one or more nodes of the number of nodes or one or more edges of the number of edges.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2016</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLB3T81LLUosycxLVyhKTc7PzU3NS0lNUShOTSxKzlAoLE0tykwtVsjPA6KczLxUheL85MzEHIW81JLy_KLsYh4G1rTEnOJUXijNzaDi5hri7KGbWpAfn1pckJgMNL8k3jHUyMDQxNjM3MjI1MnJyJhIZQDr3DK1</recordid><startdate>20161208</startdate><enddate>20161208</enddate><creator>Hua, Ming</creator><creator>Vernal, Michael</creator><creator>Fechete, Dan Ionut</creator><creator>Chakradeo, Saurabh Prafulla</creator><creator>Chen, Lu D</creator><creator>Bhatt, Dharmesh A</creator><creator>Himel, Alex</creator><creator>Garg, Avichal</creator><creator>Xiao, Xinpan</creator><creator>Qin, Yang</creator><creator>Huang, Yu</creator><scope>EVB</scope></search><sort><creationdate>20161208</creationdate><title>Generating recommended search queries on online social networks</title><author>Hua, Ming ; Vernal, Michael ; Fechete, Dan Ionut ; Chakradeo, Saurabh Prafulla ; Chen, Lu D ; Bhatt, Dharmesh A ; Himel, Alex ; Garg, Avichal ; Xiao, Xinpan ; Qin, Yang ; Huang, Yu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_AU2014367225BB23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2016</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Hua, Ming</creatorcontrib><creatorcontrib>Vernal, Michael</creatorcontrib><creatorcontrib>Fechete, Dan Ionut</creatorcontrib><creatorcontrib>Chakradeo, Saurabh Prafulla</creatorcontrib><creatorcontrib>Chen, Lu D</creatorcontrib><creatorcontrib>Bhatt, Dharmesh A</creatorcontrib><creatorcontrib>Himel, Alex</creatorcontrib><creatorcontrib>Garg, Avichal</creatorcontrib><creatorcontrib>Xiao, Xinpan</creatorcontrib><creatorcontrib>Qin, Yang</creatorcontrib><creatorcontrib>Huang, Yu</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hua, Ming</au><au>Vernal, Michael</au><au>Fechete, Dan Ionut</au><au>Chakradeo, Saurabh Prafulla</au><au>Chen, Lu D</au><au>Bhatt, Dharmesh A</au><au>Himel, Alex</au><au>Garg, Avichal</au><au>Xiao, Xinpan</au><au>Qin, Yang</au><au>Huang, Yu</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Generating recommended search queries on online social networks</title><date>2016-12-08</date><risdate>2016</risdate><abstract>In one embodiment, a method includes accessing a social graph including a number of nodes and a number of edges connecting the nodes. Each of the edges between two of the nodes represent a single degree of separation between them. The nodes include a first node corresponding to a first user associated with an online social network and a number of second nodes that each correspond to a concept or a second user associated with the online social network. The method also includes generating a number of cards. Each card includes a suggested query referencing a query-domain associated with the online social network and zero or more query-filters for the query-domain. Each query-filter references one or more nodes of the number of nodes or one or more edges of the number of edges.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_AU2014367225BB2 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | Generating recommended search queries on online social networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T01%3A48%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Hua,%20Ming&rft.date=2016-12-08&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EAU2014367225BB2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |