49,466 Hits in 4.2 sec

Personalizing web search results by reading level

Kevyn Collins-Thompson, Paul N. Bennett, Ryen W. White, Sebastian de la Chica, David Sontag
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
We evaluate our methods on a large volume of Web query traffic and provide a largescale log analysis that highlights the importance of finding results at an appropriate reading level for the user.  ...  We describe models and algorithms to address the three key problems in improving relevance for search using reading difficulty: estimating user proficiency, estimating result difficulty, and re-ranking  ...  Acknowledgements We thank Dan Liebling and Misha Bilenko for technical assistance, and Sue Dumais, Jaime Teevan, and the anonymous reviewers for their valuable suggestions.  ... 
doi:10.1145/2063576.2063639 dblp:conf/cikm/Collins-ThompsonBWCS11 fatcat:53muhv53pzftdous2ybea4i7ty

Predicting query difficulty on the web by learning visual clues

Eric C. Jensen, Steven M. Beitzel, David Grossman, Ophir Frieder, Abdur Chowdhury
2005 Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '05  
We describe a method for predicting query difficulty in a precision-oriented web search task.  ...  Our approach uses visual features from retrieved surrogate document representations (titles, snippets, etc.) to predict retrieval effectiveness for a query.  ...  CONCLUSION We have developed a method for predicting query difficulty for the high-precision task of web search by using visual features from surrogate document representations in search results.  ... 
doi:10.1145/1076034.1076155 dblp:conf/sigir/JensenBGFC05 fatcat:ck6jsgos4bf6jfkbycjv5kvi4u

Survey on Methodologies Used for Web Image Search

Dipalee N.Gaikwad, Sandeep U. Kadam
2014 International Journal of Computer Applications  
This paper focuses on the methods introduced by different authors for development in the area of web image search.  ...  Also some methods are depend on the visual similarities between the images. To improve the result of web image search, strategies like keyword expansion, active re-ranking is also used.  ...  This proposed method automatically predict the query difficulty for any query through machine learning approach.  ... 
doi:10.5120/18853-0416 fatcat:yf6qqpdadbf6rbozqfhyyk4k4e

Enhanced Natural Language Interface for Web-Based Information Retrieval

Tian Bai, Yan Ge, Shuyu Guo, Zhenting Zhang, Leiguang Gong
2020 IEEE Access  
We also represent and use the database values in the prediction model to identify and match table and column names for automatic synthesize a correct SQL statement from a query expressed in a NL sentence  ...  To overcome or at least to alleviate such limitation in web information services, we propose in this article an improved neural model based on an existing framework IRNet for NL query of databases, in  ...  from the Spider data set that match the difficulty of the web query to test our model performance.  ... 
doi:10.1109/access.2020.3048164 fatcat:pn6slvlmezgnlnqqpouto2yohe

Juru at TREC 2005: Query Prediction in the Terabyte and the Robust Tracks

Elad Yom-Tov, David Carmel, Adam Darlow, Dan Pelleg, Shai Errera-Yaakov, Shai Fine
2005 Text Retrieval Conference  
In the Robust track we trained a predictor over one collection (TREC-8) for predicting query difficulty over another collection (AQUAINT).  ...  In the Terabyte track, we investigated how query prediction can be used to improve federation of search results extracted from several indices.  ...  For that, we trained two predictors using TREC-8 collection and topics, one for description based queries and one for title based queries, and used those predictors to predict the queries difficulty as  ... 
dblp:conf/trec/Yom-TovCDPEF05 fatcat:2fupol7eazhxtmddoevezvagia

Enhancing Keyword Query Results Over Database for Improving User Satisfaction

Priya Pujari, Roshani Ade
2016 International Journal of Managing Public Sector Information and Communication Technologies  
So by considering both the prediction of hard queries and imputation over the database, we can get better keyword search results.  ...  Here we estimate prediction of query performance to find out effectiveness of a search performed in response to query and features of such hard queries is studied by taking into account contents of the  ...  ACKNOWLEDGEMENTS The authors would like to thank all the members for their expert guidance and all others who directly or indirectly helped and made numerous suggestions which improved the quality of this  ... 
doi:10.5121/ijmpict.2016.7203 fatcat:emnut3yvcvhurpwqorvy3qeywe

Query Difficulty Prediction for Web Image Search

Xinmei Tian, Yijuan Lu, Linjun Yang
2012 IEEE transactions on multimedia  
Query difficulty prediction (QDP) is an attempt to predict the quality of the search result for a query over a given collection.  ...  However, little effort has been conducted on the image query difficulty prediction problem for image search.  ...  In this paper, we target at query difficulty prediction for the Web image search task.  ... 
doi:10.1109/tmm.2011.2177647 fatcat:yn2npkuzwze7lkxocp4vou6dmu

Query Difficulty Prediction for Contextual Image Retrieval [chapter]

Xing Xing, Yi Zhang, Mei Han
2010 Lecture Notes in Computer Science  
This paper explores how to predict query difficulty for contextual image retrieval. We reformulate the problem as the task of predicting how difficult to represent a query as images.  ...  We propose to use machine learning algorithms to learn the query difficulty prediction models based on the characteristics of the query words as well as the query context.  ...  Although we study the query difficulty prediction for contextual image search, we expect the proposed context based features are useful for query difficulty prediction of other contextual search engines  ... 
doi:10.1007/978-3-642-12275-0_52 fatcat:6ywu3g67mveaxoozqaw22g7g3e

Comparing google's readability of search results to the flesch readability formulae: A preliminary analysis on children's search queries

Dania Bilal
2013 Proceedings of the American Society for Information Science and Technology  
The Flesch formulae predicted that a high number of results Google retrieved on the queries were Fairly Difficult, Difficult, or Very Confusing to children in middle grades.  ...  Three hundred retrieved results (links, snippets, and corresponding Web page texts) were analyzed for readability.  ...  Research, developed a comprehensibility classifier to predict Web text difficulty and improve relevance ranking of search results.  ... 
doi:10.1002/meet.14505001094 fatcat:r4cpqn2aqbfrbklltv4y32xvpu

SIGIR workshop report

David Carmel, Elad Yom-Tov, Ian Soboroff
2005 SIGIR Forum  
Acknowledgments We would like to thank Doug Oard, the SIGIR workshops chair, for his support and his helpful advice, to the PC members of the workshop for their helpful reviews, and especially to the workshop  ...  participants for making this workshop a success.  ...  Prediction difficulty of longer queries can return better results, but it seems less consistent. During his talk, he also discussed using the web to expand poorly-performing queries.  ... 
doi:10.1145/1113343.1113349 fatcat:olv2wc75anbldkgc2jjnokir24

Struggling or exploring?

Ahmed Hassan, Ryen W. White, Susan T. Dumais, Yi-Min Wang
2014 Proceedings of the 7th ACM international conference on Web search and data mining - WSDM '14  
The difficulty of this challenge is amplified since many of the characteristics of exploration (e.g., multiple queries, long duration) are also observed in sessions where people are struggling.  ...  Finally, we show that by considering the struggling/exploring prediction we can more accurately predict search satisfaction.  ...  Task Difficulty One explanation for why users struggle is the difficulty of the task being attempted.  ... 
doi:10.1145/2556195.2556221 dblp:conf/wsdm/HassanWDW14 fatcat:r5aq3jift5h73k2eynjav2c7u4

TREC 2005 Robust Track Experiments Using PIRCS

Kui-Lam Kwok, Laszlo Grunfeld, Norbert Dinstl, Peter Deng
2005 Text Retrieval Conference  
For the improvement of query performance, our procedure of defining alternate queries via web-assistance and later combining their retrieval lists with the original one continue to deliver above average  ...  Topic difficulty is thus a relative concept: the same query may be weak for collection TREC2004 but reasonable or even strong for collection ACQUAINT.  ... 
dblp:conf/trec/KwokGDD05 fatcat:j7f7yl66nzenrae7pq2dm2zh4e

Characterizing web content, user interests, and search behavior by reading level and topic

Jin Young Kim, Kevyn Collins-Thompson, Paul N. Bennett, Susan T. Dumais
2012 Proceedings of the fifth ACM international conference on Web search and data mining - WSDM '12  
To help improve our modeling and understanding of this diversity, we apply automatic text classifiers, based on reading difficulty and topic prediction, to estimate a novel type of profile for important  ...  entities in Web searchusers, websites, and queries.  ...  Acknowledgments We thank Ryen White for providing and assisting with the expertise URL dataset.  ... 
doi:10.1145/2124295.2124323 dblp:conf/wsdm/KimCBD12 fatcat:bzp4wlh5mrhjhp3lv6gjf6zb2y

Automatic web query classification using labeled and unlabeled training data

Steven M. Beitzel, Eric C. Jensen, Ophir Frieder, David Grossman, David D. Lewis, Abdur Chowdhury, Aleksandr Kolcz
2005 Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '05  
Accurate topical categorization of user queries allows for increased effectiveness, efficiency, and revenue potential in general-purpose web search systems.  ...  We examine the performance of each approach on a real web query stream and show that our combined method accurately classifies 46% of queries, outperforming the recall of the best single approach by nearly  ...  In the case of large-scale web search, this task is particularly challenging due to the sheer size and dynamic nature of the web's content, users, and query traffic, as well as the difficulty of accurately  ... 
doi:10.1145/1076034.1076138 dblp:conf/sigir/BeitzelJFGLCK05 fatcat:2mrw3evqondy7pmoop7dnkq2tu

Query-Adaptive Fusion for Multimodal Search

L. Kennedy, Shih-Fu Chang, A. Natsev
2008 Proceedings of the IEEE  
for each individual query experienced by the system.  ...  We observe that the state of the art in query-adaptive retrieval frameworks for video collections is highly dependent upon the definition of classes of queries, which are groups of queries that share similar  ...  Methods to predict the search method performance directly, via query difficulty prediction frameworks, have great promise for bridging some of these difficulties.  ... 
doi:10.1109/jproc.2008.916345 fatcat:izn34ieavjf3vmul55kjqq4bnu
« Previous Showing results 1 — 15 out of 49,466 results