CATEGORY CONSTRAINED QUERIES
A user may submit a search query to a search engine. The search engine may process the search query and generate a set of results. Each of the items searched by the search engine may have been pre-assigned to a category in a category tree. Previous interactions by other users with the items after si...
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 | Salaka Vamsi Krishna Kumar Prathyusha Senthil |
| description | A user may submit a search query to a search engine. The search engine may process the search query and generate a set of results. Each of the items searched by the search engine may have been pre-assigned to a category in a category tree. Previous interactions by other users with the items after similar queries may have been recorded. The search engine may identify categories based on the distribution of the interacted-with results among the categories. The category tree may be analyzed at different levels, based on the entropy observed at each level. A level with low entropy may be chosen, and categories at that level used to constrain the query. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2018046713A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2018046713A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2018046713A13</originalsourceid><addsrcrecordid>eNrjZJBxdgxxdfcPilRw9vcLDgly9PRzdVEIDHUN8nQN5mFgTUvMKU7lhdLcDMpuriHOHrqpBfnxqcUFicmpeakl8aHBRgaGFgYmZuaGxo6GxsSpAgAJwCHt</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>CATEGORY CONSTRAINED QUERIES</title><source>esp@cenet</source><creator>Salaka Vamsi Krishna ; Kumar Prathyusha Senthil</creator><creatorcontrib>Salaka Vamsi Krishna ; Kumar Prathyusha Senthil</creatorcontrib><description>A user may submit a search query to a search engine. The search engine may process the search query and generate a set of results. Each of the items searched by the search engine may have been pre-assigned to a category in a category tree. Previous interactions by other users with the items after similar queries may have been recorded. The search engine may identify categories based on the distribution of the interacted-with results among the categories. The category tree may be analyzed at different levels, based on the entropy observed at each level. A level with low entropy may be chosen, and categories at that level used to constrain the query.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><creationdate>2018</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=20180215&DB=EPODOC&CC=US&NR=2018046713A1$$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&date=20180215&DB=EPODOC&CC=US&NR=2018046713A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Salaka Vamsi Krishna</creatorcontrib><creatorcontrib>Kumar Prathyusha Senthil</creatorcontrib><title>CATEGORY CONSTRAINED QUERIES</title><description>A user may submit a search query to a search engine. The search engine may process the search query and generate a set of results. Each of the items searched by the search engine may have been pre-assigned to a category in a category tree. Previous interactions by other users with the items after similar queries may have been recorded. The search engine may identify categories based on the distribution of the interacted-with results among the categories. The category tree may be analyzed at different levels, based on the entropy observed at each level. A level with low entropy may be chosen, and categories at that level used to constrain the query.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2018</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZJBxdgxxdfcPilRw9vcLDgly9PRzdVEIDHUN8nQN5mFgTUvMKU7lhdLcDMpuriHOHrqpBfnxqcUFicmpeakl8aHBRgaGFgYmZuaGxo6GxsSpAgAJwCHt</recordid><startdate>20180215</startdate><enddate>20180215</enddate><creator>Salaka Vamsi Krishna</creator><creator>Kumar Prathyusha Senthil</creator><scope>EVB</scope></search><sort><creationdate>20180215</creationdate><title>CATEGORY CONSTRAINED QUERIES</title><author>Salaka Vamsi Krishna ; Kumar Prathyusha Senthil</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2018046713A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2018</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><toplevel>online_resources</toplevel><creatorcontrib>Salaka Vamsi Krishna</creatorcontrib><creatorcontrib>Kumar Prathyusha Senthil</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Salaka Vamsi Krishna</au><au>Kumar Prathyusha Senthil</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>CATEGORY CONSTRAINED QUERIES</title><date>2018-02-15</date><risdate>2018</risdate><abstract>A user may submit a search query to a search engine. The search engine may process the search query and generate a set of results. Each of the items searched by the search engine may have been pre-assigned to a category in a category tree. Previous interactions by other users with the items after similar queries may have been recorded. The search engine may identify categories based on the distribution of the interacted-with results among the categories. The category tree may be analyzed at different levels, based on the entropy observed at each level. A level with low entropy may be chosen, and categories at that level used to constrain the query.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2018046713A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ELECTRIC DIGITAL DATA PROCESSING PHYSICS SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR |
| title | CATEGORY CONSTRAINED QUERIES |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T22%3A43%3A13IST&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=Salaka%20Vamsi%20Krishna&rft.date=2018-02-15&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2018046713A1%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 |