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 ; fre |
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 | FECHETE, DAN IONUT HUANG, YU CHAKRADEO, SAURABH PRAFULLA XIAO, XINPAN BHATT, DHARMESH A HUA, MING HIMEL, ALEX VERNAL, MICHAEL QIN, YANG CHEN, LU D GARG, AVICHAL |
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_CA2932053C</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CA2932053C</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CA2932053C3</originalsourceid><addsrcrecordid>eNrjZLB3d_VzDXIM8fRzVwhydfb39XX1c3F1UQh2dQxy9lAIDHUN8nQNVvD3AyIfTz9XhWB_Z09HHwU_15Bw_yDvYB4G1rTEnOJUXijNzSDv5hri7KGbWpAfn1pckJicmpdaEu_saGRpbGRgauxsTFgFAObeKZE</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>FECHETE, DAN IONUT ; HUANG, YU ; CHAKRADEO, SAURABH PRAFULLA ; XIAO, XINPAN ; BHATT, DHARMESH A ; HUA, MING ; HIMEL, ALEX ; VERNAL, MICHAEL ; QIN, YANG ; CHEN, LU D ; GARG, AVICHAL</creator><creatorcontrib>FECHETE, DAN IONUT ; HUANG, YU ; CHAKRADEO, SAURABH PRAFULLA ; XIAO, XINPAN ; BHATT, DHARMESH A ; HUA, MING ; HIMEL, ALEX ; VERNAL, MICHAEL ; QIN, YANG ; CHEN, LU D ; GARG, AVICHAL</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 ; fre</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2017</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=20170307&DB=EPODOC&CC=CA&NR=2932053C$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,777,882,25545,76296</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20170307&DB=EPODOC&CC=CA&NR=2932053C$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>FECHETE, DAN IONUT</creatorcontrib><creatorcontrib>HUANG, YU</creatorcontrib><creatorcontrib>CHAKRADEO, SAURABH PRAFULLA</creatorcontrib><creatorcontrib>XIAO, XINPAN</creatorcontrib><creatorcontrib>BHATT, DHARMESH A</creatorcontrib><creatorcontrib>HUA, MING</creatorcontrib><creatorcontrib>HIMEL, ALEX</creatorcontrib><creatorcontrib>VERNAL, MICHAEL</creatorcontrib><creatorcontrib>QIN, YANG</creatorcontrib><creatorcontrib>CHEN, LU D</creatorcontrib><creatorcontrib>GARG, AVICHAL</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>2017</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLB3d_VzDXIM8fRzVwhydfb39XX1c3F1UQh2dQxy9lAIDHUN8nQNVvD3AyIfTz9XhWB_Z09HHwU_15Bw_yDvYB4G1rTEnOJUXijNzSDv5hri7KGbWpAfn1pckJicmpdaEu_saGRpbGRgauxsTFgFAObeKZE</recordid><startdate>20170307</startdate><enddate>20170307</enddate><creator>FECHETE, DAN IONUT</creator><creator>HUANG, YU</creator><creator>CHAKRADEO, SAURABH PRAFULLA</creator><creator>XIAO, XINPAN</creator><creator>BHATT, DHARMESH A</creator><creator>HUA, MING</creator><creator>HIMEL, ALEX</creator><creator>VERNAL, MICHAEL</creator><creator>QIN, YANG</creator><creator>CHEN, LU D</creator><creator>GARG, AVICHAL</creator><scope>EVB</scope></search><sort><creationdate>20170307</creationdate><title>GENERATING RECOMMENDED SEARCH QUERIES ON ONLINE SOCIAL NETWORKS</title><author>FECHETE, DAN IONUT ; HUANG, YU ; CHAKRADEO, SAURABH PRAFULLA ; XIAO, XINPAN ; BHATT, DHARMESH A ; HUA, MING ; HIMEL, ALEX ; VERNAL, MICHAEL ; QIN, YANG ; CHEN, LU D ; GARG, AVICHAL</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CA2932053C3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; fre</language><creationdate>2017</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>FECHETE, DAN IONUT</creatorcontrib><creatorcontrib>HUANG, YU</creatorcontrib><creatorcontrib>CHAKRADEO, SAURABH PRAFULLA</creatorcontrib><creatorcontrib>XIAO, XINPAN</creatorcontrib><creatorcontrib>BHATT, DHARMESH A</creatorcontrib><creatorcontrib>HUA, MING</creatorcontrib><creatorcontrib>HIMEL, ALEX</creatorcontrib><creatorcontrib>VERNAL, MICHAEL</creatorcontrib><creatorcontrib>QIN, YANG</creatorcontrib><creatorcontrib>CHEN, LU D</creatorcontrib><creatorcontrib>GARG, AVICHAL</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>FECHETE, DAN IONUT</au><au>HUANG, YU</au><au>CHAKRADEO, SAURABH PRAFULLA</au><au>XIAO, XINPAN</au><au>BHATT, DHARMESH A</au><au>HUA, MING</au><au>HIMEL, ALEX</au><au>VERNAL, MICHAEL</au><au>QIN, YANG</au><au>CHEN, LU D</au><au>GARG, AVICHAL</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>GENERATING RECOMMENDED SEARCH QUERIES ON ONLINE SOCIAL NETWORKS</title><date>2017-03-07</date><risdate>2017</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 ; fre |
recordid | cdi_epo_espacenet_CA2932053C |
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-20T09%3A17%3A20IST&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=FECHETE,%20DAN%20IONUT&rft.date=2017-03-07&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECA2932053C%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 |