Filters








15,140 Hits in 3.5 sec

Quantify query ambiguity using ODP metadata

Guang Qiu, Kangmiao Liu, Jiajun Bu, Chun Chen, Zhiming Kang
2007 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '07  
We introduce clarity score to quantify the lack of ambiguity with respect to data sets constructed from the TREC collections and the rank correlation test results demonstrate a strong positive association  ...  In this poster, we propose such a measure using query topics based on the topic structure selected from the Open Directory Project (ODP) taxonomy.  ...  The number of topics in intersecting set is taken as the dominant factor in quantifying query ambiguity.  ... 
doi:10.1145/1277741.1277864 dblp:conf/sigir/QiuLBCK07 fatcat:ftesnzwhdrflxl4wzg6zf4wbku

The Impact of Temporal Intent Variability on Diversity Evaluation [chapter]

Ke Zhou, Stewart Whiting, Joemon M. Jose, Mounia Lalmas
2013 Lecture Notes in Computer Science  
To cope with the uncertainty involved with ambiguous or underspecified queries, search engines often diversify results to return documents that cover multiple interpretations, e.g. the car brand, animal  ...  Firstly, to support our hypothesis we analyse temporal subtopic popularity changes for ambiguous queries through historic Wikipedia article viewing statistics.  ...  Finally, we quantify all the topics by d(q, T ) as defined above and analyse the distribution of temporal intent variability.  ... 
doi:10.1007/978-3-642-36973-5_93 fatcat:uwn23yl3cvddpez2tysebopsam

Identifying ambiguous queries in web search

Ruihua Song, Zhenxiao Luo, Ji-Rong Wen, Yong Yu, Hsiao-Wuen Hon
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
However, few studies have investigated the questions of "how many queries are ambiguous?" and "how can we automatically identify an ambiguous query?" This paper deals with these issues.  ...  First, we construct the taxonomy of query ambiguity, and ask human annotators to manually classify queries based upon it.  ...  Many terms related to this concept, such as "ambiguous query," "semi-ambiguous query," "clear query," "general term," "broad topic," and "diffuse topic."  ... 
doi:10.1145/1242572.1242749 dblp:conf/www/SongLWYH07 fatcat:pkxdnxo775gdto77uocs2aiyzu

Estimating query performance using class predictions

Kevyn Collins-Thompson, Paul N. Bennett
2009 Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval - SIGIR '09  
We investigate using topic prediction data, as a summary of document content, to compute measures of search result quality.  ...  In an empirical study we compare the performance of class-based statistics to their languagemodel counterparts for predicting two measures: query difficulty and expansion risk.  ...  A variety of other work has examined query classification and use of class labels. Recently [8] quantified query ambiguity using ODP metadata for individual query terms.  ... 
doi:10.1145/1571941.1572071 dblp:conf/sigir/Collins-ThompsonB09 fatcat:65a27ndzafgklmitrcdisqzrzq

Examining Personalization Heuristics by Topical Analysis of Query Log

Wei Song, Ying Liu, Lizhen Liu, Hanshi Wang
2016 International Journal of Innovative Computing, Information and Control  
We examine the heuristics on query ambiguity, query intent, user preferences and their interactions. We find that only a few queries with multiple user intents are inherently ambiguous.  ...  We introduce new metrics to measure user preferences and preference distribution. These metrics show that searchers do have their preferences and focus on only a few interested topics.  ...  For a distinct query, we aggregate its topics from all its occurrences in query log. That is to get the topic distribution among all users who had submitted this query.  ... 
doi:10.24507/ijicic.12.05.1745 fatcat:hglrd62qjngotbjee7ykskj4q4

A BOVW Based Query Generative Model [chapter]

Reede Ren, John Collomosse, Joemon Jose
2011 Lecture Notes in Computer Science  
word to a query topic; the relevance is justified by considering concept distributions on visual words as well as on local features.  ...  Local features are directly projected onto latent content topics to create effective visual queries; visual word distributions are learnt around local features to estimate the contribution of a visual  ...  The optimised number of query topics is learnt by maximising the entropy of latent topic distribution.  ... 
doi:10.1007/978-3-642-17832-0_12 fatcat:e745ybc72jdrbndon2y7iqo5c4

On the mathematical relationship between expected n-call@k and the relevance vs. diversity trade-off

Kar Wai Lim, Scott Sanner, Shengbo Guo
2012 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '12  
, a set-based objective that is 1 if at least n documents in a set of k are relevant, otherwise 0) encourages more result set diversification for smaller n, but this statement has never been formally quantified  ...  -Need a model for this -In particular, one that models query and document ambiguity (via latent topics) • Since we hypothesize that topic ambiguity underlies the need for diversity Latent subtopic  ...  -Should really tune λ for MMR based on query ambiguity • There seems to be a trend relating λ and n: Topic marginalization leads to probability product kernel Sim 1 (·, ·): this is any kernel that L 1  ... 
doi:10.1145/2348283.2348497 dblp:conf/sigir/LimSG12 fatcat:3ify37yvnncc5o6ye6cnlbcodq

Relevance Feedback and Personalization: A Language Modeling Perspective

W. Bruce Croft, Stephen Cronen-Townsend, Victor Lavrenko
2001 DELOS Workshops / Conferences  
The user models provide context for queries and other interactions with the information system.  ...  In this paper, we discuss how language models can be used to represent context and support context-based techniques such as relevance feedback and query disambiguation.  ...  The paper is also related to research done in collaboration with Professor John Lafferty at Carnegie Mellon University.  ... 
dblp:conf/delos/CroftCL01 fatcat:emqjuta2dfggfnfe432262g2dm

Aggregated Search Result Diversification [chapter]

Rodrygo L. T. Santos, Craig Macdonald, Iadh Ounis
2011 Lecture Notes in Computer Science  
However, ambiguity can manifest differently in different search verticals, with ambiguous queries spanning, e.g., multiple place names, content genres, or time periods.  ...  Search result diversification has been effectively employed to tackle query ambiguity, particularly in the context of web search.  ...  The agreement of a pair of verticals with respect to a query quantifies the similarity of the distribution of information needs underlying this query across the two verticals.  ... 
doi:10.1007/978-3-642-23318-0_23 fatcat:r7fs7pzcenexfis6zk4fpeybqu

Predicting Query Performance via Classification [chapter]

Kevyn Collins-Thompson, Paul N. Bennett
2010 Lecture Notes in Computer Science  
We investigate using topic prediction data, as a summary of document content, to compute measures of search result quality.  ...  Unlike existing quality measures such as query clarity that require the entire content of the top-ranked results, class-based statistics can be computed efficiently online, because class information is  ...  Recently [16] quantified query ambiguity using ODP metadata for individual query terms, and [18] examined the category spread of top-ranked documents to identify ambiguous queries.  ... 
doi:10.1007/978-3-642-12275-0_15 fatcat:fmupa3v3bng6hf47xftbmuvraa

Topic Level Disambiguation for Weak Queries

Hui Zhang, Kiduk Yang, Elin Jacob
2013 Journal of Information Science Theory and Practice  
IR systems return poor search results when users formulate their information needs into incomplete or ambiguous queries (i.e., weak queries).  ...  The results not only confirm the effectiveness of the proposed topic detection and topic-based retrieval approaches but also demonstrate that query disambiguation does not improve IR as expected.  ...  queries with and without resolving topic ambiguity (i.e., H1).  ... 
doi:10.1633/jistap.2013.1.3.3 fatcat:yu77pl66jndx3ifyu57spzj7wy

Predicting query performance

Steve Cronen-Townsend, Yun Zhou, W. Bruce Croft
2002 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '02  
We suggest that clarity scores measure the ambiguity of a query with respect to a collection of documents and show that they correlate positively with average precision in a variety of TREC test sets.  ...  We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model.  ...  ACKNOWLEDGEMENTS We thank Victor Lavrenko for advice on estimation of query models and probability densities.  ... 
doi:10.1145/564376.564429 dblp:conf/sigir/Cronen-TownsendZC02 fatcat:uj7gwwxjn5gqteeyb25jcdfx54

Predicting query performance

Steve Cronen-Townsend, Yun Zhou, W. Bruce Croft
2002 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '02  
We suggest that clarity scores measure the ambiguity of a query with respect to a collection of documents and show that they correlate positively with average precision in a variety of TREC test sets.  ...  We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model.  ...  ACKNOWLEDGEMENTS We thank Victor Lavrenko for advice on estimation of query models and probability densities.  ... 
doi:10.1145/564426.564429 fatcat:m5mkex2anfg6fp6cb4amcypwiu

A hierarchical monothetic document clustering algorithm for summarization and browsing search results

Krishna Kummamuru, Rohit Lotlikar, Shourya Roy, Karan Singal, Raghu Krishnapuram
2004 Proceedings of the 13th conference on World Wide Web - WWW '04  
In this paper, we propose a new hierarchical monothetic clustering algorithm to build a topic hierarchy for a collection of search results retrieved in response to a query.  ...  We use several objective measures such as coverage and reach time for an empirical comparison of the proposed algorithm with two other monothetic clustering algorithms to demonstrate its superiority.  ...  This gave us 5 responses to each query, with a total of 25 responses for ambiguous queries and 25 responses for popular queries.  ... 
doi:10.1145/988672.988762 dblp:conf/www/KummamuruLRSK04 fatcat:xls5ebxfrjdzndpyyv7lk76cpm

Click patterns

Huizhong Duan, Emre Kiciman, ChengXiang Zhai
2012 Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12  
We show that calculating query ambiguity as the entropy over the distribution of click patterns provides a measure of ambiguity with improved discriminative power, consistency and temporal stability as  ...  We further demonstrate the usefulness of click patterns by integrating them into a measure of query ambiguity and into a query recommendation task.  ...  They found that through topical categorization, the three types of queries are to a certain extent distinguishable according to the topical distribution.  ... 
doi:10.1145/2396761.2398400 dblp:conf/cikm/DuanKZ12 fatcat:xcrwcn7ebzhi5fzbt7v7quh6a4
« Previous Showing results 1 — 15 out of 15,140 results