Re-ranking search results based on lexical and ontological concepts

Re-ranking search results based on lexical and ontological concepts

Search result re-ranking is provided by employing a concept graph from a metabase. When a search query is received, a query context of the search query is analyzed to identify dominant concepts for the search query. The dominant concepts are expanded by identifying the dominant concepts within a con...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: VADLAMANI VISWANATH, NAJM TAREK, MIDGLEY JOHN, SRIVASTAVA ABHINAI, SURENDRAN ARUNGUNRAM CHANDRASEKARAN, SRIKANTH MUNIRATHNAM, ALI MAHBUBUL ALAM
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
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 VADLAMANI VISWANATH
NAJM TAREK
MIDGLEY JOHN
SRIVASTAVA ABHINAI
SURENDRAN ARUNGUNRAM CHANDRASEKARAN
SRIKANTH MUNIRATHNAM
ALI MAHBUBUL ALAM
description Search result re-ranking is provided by employing a concept graph from a metabase. When a search query is received, a query context of the search query is analyzed to identify dominant concepts for the search query. The dominant concepts are expanded by identifying the dominant concepts within a concept graph and identifying additional concepts having a strong relationship with the dominant concepts within the concept graph. A set of search results for the search query is analyzed to determine strength of relationship of each search result to the expanded concepts. The search results are re-ranked based on the strength of relationship of each search result to the expanded concepts and the strength of relationship of each expanded concept to the dominant concepts.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US9177057B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US9177057B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US9177057B23</originalsourceid><addsrcrecordid>eNrjZHAOStUtSszLzsxLVyhOTSxKzlAoSi0uzSkpVkhKLE5NUcjPU8hJrchMTsxRSMwDcUvyc_LTwfzk_Lzk1IKSYh4G1rTEnOJUXijNzaDg5hri7KGbWpAfn1pckJicmpdaEh8abGlobm5gau5kZEyEEgAV9TJF</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Re-ranking search results based on lexical and ontological concepts</title><source>esp@cenet</source><creator>VADLAMANI VISWANATH ; NAJM TAREK ; MIDGLEY JOHN ; SRIVASTAVA ABHINAI ; SURENDRAN ARUNGUNRAM CHANDRASEKARAN ; SRIKANTH MUNIRATHNAM ; ALI MAHBUBUL ALAM</creator><creatorcontrib>VADLAMANI VISWANATH ; NAJM TAREK ; MIDGLEY JOHN ; SRIVASTAVA ABHINAI ; SURENDRAN ARUNGUNRAM CHANDRASEKARAN ; SRIKANTH MUNIRATHNAM ; ALI MAHBUBUL ALAM</creatorcontrib><description>Search result re-ranking is provided by employing a concept graph from a metabase. When a search query is received, a query context of the search query is analyzed to identify dominant concepts for the search query. The dominant concepts are expanded by identifying the dominant concepts within a concept graph and identifying additional concepts having a strong relationship with the dominant concepts within the concept graph. A set of search results for the search query is analyzed to determine strength of relationship of each search result to the expanded concepts. The search results are re-ranked based on the strength of relationship of each search result to the expanded concepts and the strength of relationship of each expanded concept to the dominant concepts.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2015</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&amp;date=20151103&amp;DB=EPODOC&amp;CC=US&amp;NR=9177057B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25544,76293</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20151103&amp;DB=EPODOC&amp;CC=US&amp;NR=9177057B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>VADLAMANI VISWANATH</creatorcontrib><creatorcontrib>NAJM TAREK</creatorcontrib><creatorcontrib>MIDGLEY JOHN</creatorcontrib><creatorcontrib>SRIVASTAVA ABHINAI</creatorcontrib><creatorcontrib>SURENDRAN ARUNGUNRAM CHANDRASEKARAN</creatorcontrib><creatorcontrib>SRIKANTH MUNIRATHNAM</creatorcontrib><creatorcontrib>ALI MAHBUBUL ALAM</creatorcontrib><title>Re-ranking search results based on lexical and ontological concepts</title><description>Search result re-ranking is provided by employing a concept graph from a metabase. When a search query is received, a query context of the search query is analyzed to identify dominant concepts for the search query. The dominant concepts are expanded by identifying the dominant concepts within a concept graph and identifying additional concepts having a strong relationship with the dominant concepts within the concept graph. A set of search results for the search query is analyzed to determine strength of relationship of each search result to the expanded concepts. The search results are re-ranked based on the strength of relationship of each search result to the expanded concepts and the strength of relationship of each expanded concept to the dominant concepts.</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>2015</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHAOStUtSszLzsxLVyhOTSxKzlAoSi0uzSkpVkhKLE5NUcjPU8hJrchMTsxRSMwDcUvyc_LTwfzk_Lzk1IKSYh4G1rTEnOJUXijNzaDg5hri7KGbWpAfn1pckJicmpdaEh8abGlobm5gau5kZEyEEgAV9TJF</recordid><startdate>20151103</startdate><enddate>20151103</enddate><creator>VADLAMANI VISWANATH</creator><creator>NAJM TAREK</creator><creator>MIDGLEY JOHN</creator><creator>SRIVASTAVA ABHINAI</creator><creator>SURENDRAN ARUNGUNRAM CHANDRASEKARAN</creator><creator>SRIKANTH MUNIRATHNAM</creator><creator>ALI MAHBUBUL ALAM</creator><scope>EVB</scope></search><sort><creationdate>20151103</creationdate><title>Re-ranking search results based on lexical and ontological concepts</title><author>VADLAMANI VISWANATH ; NAJM TAREK ; MIDGLEY JOHN ; SRIVASTAVA ABHINAI ; SURENDRAN ARUNGUNRAM CHANDRASEKARAN ; SRIKANTH MUNIRATHNAM ; ALI MAHBUBUL ALAM</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US9177057B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2015</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>VADLAMANI VISWANATH</creatorcontrib><creatorcontrib>NAJM TAREK</creatorcontrib><creatorcontrib>MIDGLEY JOHN</creatorcontrib><creatorcontrib>SRIVASTAVA ABHINAI</creatorcontrib><creatorcontrib>SURENDRAN ARUNGUNRAM CHANDRASEKARAN</creatorcontrib><creatorcontrib>SRIKANTH MUNIRATHNAM</creatorcontrib><creatorcontrib>ALI MAHBUBUL ALAM</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>VADLAMANI VISWANATH</au><au>NAJM TAREK</au><au>MIDGLEY JOHN</au><au>SRIVASTAVA ABHINAI</au><au>SURENDRAN ARUNGUNRAM CHANDRASEKARAN</au><au>SRIKANTH MUNIRATHNAM</au><au>ALI MAHBUBUL ALAM</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Re-ranking search results based on lexical and ontological concepts</title><date>2015-11-03</date><risdate>2015</risdate><abstract>Search result re-ranking is provided by employing a concept graph from a metabase. When a search query is received, a query context of the search query is analyzed to identify dominant concepts for the search query. The dominant concepts are expanded by identifying the dominant concepts within a concept graph and identifying additional concepts having a strong relationship with the dominant concepts within the concept graph. A set of search results for the search query is analyzed to determine strength of relationship of each search result to the expanded concepts. The search results are re-ranked based on the strength of relationship of each search result to the expanded concepts and the strength of relationship of each expanded concept to the dominant concepts.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US9177057B2
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Re-ranking search results based on lexical and ontological concepts
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T18%3A15%3A36IST&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=VADLAMANI%20VISWANATH&rft.date=2015-11-03&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS9177057B2%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