Processing social search results
Techniques are described herein for processing social search results. Such social search results may be included in a relatively higher-ranked (e.g., a highest-ranked) subset of a user's search results and/or selected from a relatively lower-ranked subset of the user's search results in re...
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 | HOAD TIMOTHY C SARAF YATHARTH AHARI SANAZ VIJAYWARGI DEEPAK |
| description | Techniques are described herein for processing social search results. Such social search results may be included in a relatively higher-ranked (e.g., a highest-ranked) subset of a user's search results and/or selected from a relatively lower-ranked subset of the user's search results in response to a determination that the relatively higher-ranked subset includes social search result(s). In one example, the social search results (or a subset thereof) may be annotated to include publicly available rich metadata. Such metadata may be extracted from user profiles on social networking domains from which the social search results are received. In another example, the social search results (or a subset thereof) may be clustered such that they are consecutively ranked. In yet another example, the social search results (or a subset thereof) may be configured to be displayed in a designated arrangement (e.g., in a grid having multiple columns). |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US9311411B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US9311411B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US9311411B23</originalsourceid><addsrcrecordid>eNrjZFAIKMpPTi0uzsxLVyjOT85MzFEoTk0sSs5QKEotLs0pKeZhYE1LzClO5YXS3AwKbq4hzh66qQX58anFBYnJqXmpJfGhwZbGhoYmhoZORsZEKAEALNAlQQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Processing social search results</title><source>esp@cenet</source><creator>HOAD TIMOTHY C ; SARAF YATHARTH ; AHARI SANAZ ; VIJAYWARGI DEEPAK</creator><creatorcontrib>HOAD TIMOTHY C ; SARAF YATHARTH ; AHARI SANAZ ; VIJAYWARGI DEEPAK</creatorcontrib><description>Techniques are described herein for processing social search results. Such social search results may be included in a relatively higher-ranked (e.g., a highest-ranked) subset of a user's search results and/or selected from a relatively lower-ranked subset of the user's search results in response to a determination that the relatively higher-ranked subset includes social search result(s). In one example, the social search results (or a subset thereof) may be annotated to include publicly available rich metadata. Such metadata may be extracted from user profiles on social networking domains from which the social search results are received. In another example, the social search results (or a subset thereof) may be clustered such that they are consecutively ranked. In yet another example, the social search results (or a subset thereof) may be configured to be displayed in a designated arrangement (e.g., in a grid having multiple columns).</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=20160412&DB=EPODOC&CC=US&NR=9311411B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76290</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20160412&DB=EPODOC&CC=US&NR=9311411B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>HOAD TIMOTHY C</creatorcontrib><creatorcontrib>SARAF YATHARTH</creatorcontrib><creatorcontrib>AHARI SANAZ</creatorcontrib><creatorcontrib>VIJAYWARGI DEEPAK</creatorcontrib><title>Processing social search results</title><description>Techniques are described herein for processing social search results. Such social search results may be included in a relatively higher-ranked (e.g., a highest-ranked) subset of a user's search results and/or selected from a relatively lower-ranked subset of the user's search results in response to a determination that the relatively higher-ranked subset includes social search result(s). In one example, the social search results (or a subset thereof) may be annotated to include publicly available rich metadata. Such metadata may be extracted from user profiles on social networking domains from which the social search results are received. In another example, the social search results (or a subset thereof) may be clustered such that they are consecutively ranked. In yet another example, the social search results (or a subset thereof) may be configured to be displayed in a designated arrangement (e.g., in a grid having multiple columns).</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>eNrjZFAIKMpPTi0uzsxLVyjOT85MzFEoTk0sSs5QKEotLs0pKeZhYE1LzClO5YXS3AwKbq4hzh66qQX58anFBYnJqXmpJfGhwZbGhoYmhoZORsZEKAEALNAlQQ</recordid><startdate>20160412</startdate><enddate>20160412</enddate><creator>HOAD TIMOTHY C</creator><creator>SARAF YATHARTH</creator><creator>AHARI SANAZ</creator><creator>VIJAYWARGI DEEPAK</creator><scope>EVB</scope></search><sort><creationdate>20160412</creationdate><title>Processing social search results</title><author>HOAD TIMOTHY C ; SARAF YATHARTH ; AHARI SANAZ ; VIJAYWARGI DEEPAK</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US9311411B23</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>HOAD TIMOTHY C</creatorcontrib><creatorcontrib>SARAF YATHARTH</creatorcontrib><creatorcontrib>AHARI SANAZ</creatorcontrib><creatorcontrib>VIJAYWARGI DEEPAK</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>HOAD TIMOTHY C</au><au>SARAF YATHARTH</au><au>AHARI SANAZ</au><au>VIJAYWARGI DEEPAK</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Processing social search results</title><date>2016-04-12</date><risdate>2016</risdate><abstract>Techniques are described herein for processing social search results. Such social search results may be included in a relatively higher-ranked (e.g., a highest-ranked) subset of a user's search results and/or selected from a relatively lower-ranked subset of the user's search results in response to a determination that the relatively higher-ranked subset includes social search result(s). In one example, the social search results (or a subset thereof) may be annotated to include publicly available rich metadata. Such metadata may be extracted from user profiles on social networking domains from which the social search results are received. In another example, the social search results (or a subset thereof) may be clustered such that they are consecutively ranked. In yet another example, the social search results (or a subset thereof) may be configured to be displayed in a designated arrangement (e.g., in a grid having multiple columns).</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US9311411B2 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | Processing social search results |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T00%3A58%3A12IST&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=HOAD%20TIMOTHY%20C&rft.date=2016-04-12&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS9311411B2%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 |