Filters








292,389 Hits in 5.1 sec

PROBABILISTIC MATCHSIMILARITY MEASURE FOR DOCUMENT CLUSTERING

Selvi K, Suresh R.M
2015 International Journal on Information Sciences and Computing  
This method works well for Web tasks such as query/keyword matching and search query suggestion that rely heavily on the quality of similarity measures between short text segments.  ...  We show that the learned measures are efficient at a wide range of scales and achieve better results than existing similarity measures.  ...  We first review existing methods for measuring similarity of short text segments.  ... 
doi:10.18000/ijisac.50156 fatcat:xrqca6esajdh7lijxa3ihdwnfi

A web-based kernel function for measuring the similarity of short text snippets

Mehran Sahami, Timothy D. Heilman
2006 Proceedings of the 15th international conference on World Wide Web - WWW '06  
Determining the similarity of short text snippets, such as search queries, works poorly with traditional document similarity measures (e.g., cosine), since there are often few, if any, terms in common  ...  We address this problem by introducing a novel method for measuring the similarity between short text snippets (even those without any overlapping terms) by leveraging web search results to provide greater  ...  Acknowledgments We thank Amit Singhal for many invaluable discussions related to this research.  ... 
doi:10.1145/1135777.1135834 dblp:conf/www/SahamiH06 fatcat:kjjcmumwcrgxnf77rfrcbpskhe

Effective ranking with arbitrary passages

Marcin Kaszkiel, Justin Zobel
2001 Journal of the American Society for Information Science and Technology  
We show that ranking with these arbitrary passages gives substantial improvements in retrieval effectiveness over traditional document ranking schemes, particularly for queries on collections of long documents  ...  difficulties of comparing documents of different length, and enables identification of short blocks of relevant material amongst otherwise irrelevant text.  ...  For short queries, the pivoted-cosine measure improves over the cosine measure by 61% in average precision.  ... 
doi:10.1002/1532-2890(2000)9999:9999<::aid-asi1075>3.3.co;2-r fatcat:khqoiydhhvabndyhxm6t7odqbi

Effective ranking with arbitrary passages

Marcin Kaszkiel, Justin Zobel
2001 Journal of the American Society for Information Science and Technology  
We show that ranking with these arbitrary passages gives substantial improvements in retrieval effectiveness over traditional document ranking schemes, particularly for queries on collections of long documents  ...  difficulties of comparing documents of different length, and enables identification of short blocks of relevant material among otherwise irrelevant text.  ...  For short queries, the pivoted-cosine measure improves over the cosine measure by 61% in average precision.  ... 
doi:10.1002/1532-2890(2000)9999:9999<::aid-asi1075>3.0.co;2-# fatcat:o6qu5isg5fbyfhosefngb7uwxy

Learning user interests for a session-based personalized search

Mariam Daoud, Lynda Tamine-Lechani, Mohand Boughanem
2008 Proceedings of the second international symposium on Information interaction in context - IIiX '08  
Finally, the search personalization is achieved by re-ranking the search results for a given query using the short term user interest.  ...  For this purpose, we tackle the problem of session boundary recognition using context-sensitive similarity measures that are able to gauge the changes in the user interest topics with regard to reference  ...  context are very related to each other. • Using our modified WebJaccard similarity measure We modify the traditional Jaccard measure [5] for the purpose of measuring topical similarity degree using  ... 
doi:10.1145/1414694.1414708 dblp:conf/iiix/DaoudTB08 fatcat:s55bm3dmhvbltngnxz7pxvjzxq

Probabilistic Query Expansion method using recommended past user queries

Btihal El Ghali, Abderrahim El Qadi, Mohamed Ouadou, Driss Aboutajdine
2012 Second International Conference on the Innovative Computing Technology (INTECH 2012)  
the recommended queries used, for short and long queries.  ...  Our experiments shows also, that for short queries we need to use just the best recommended query in the process of expansion to have a very high value of the Interpolated Average Precision (IAP), but  ...  Similarity measure: The Cosine Similarity The objective of the measuring of similarities between the queries, represented as a document vectors, is to search for queries that have many common relevant  ... 
doi:10.1109/intech.2012.6457806 fatcat:x6fuflrdbbdqlpp5usbmbcjb6e

Back to our roots for retrieving very short passages

Nada Naji, Jacques Savoy
2013 Proceedings of the American Society for Information Science and Technology  
We found that retrieving very short documents whose lengths are quite similar via short queries given that no external enrichment resources are available, the classical tf-idf model performs as satisfactorily  ...  This article tackles the task of retrieving very short documents via even shorter queries.  ...  Eva Wiedenkeller (University of Neuchatel, Switzerland) for their valuable support.  ... 
doi:10.1002/meet.14505001035 fatcat:cwtrwmwffnhsldppd23lhjhjom

An Efficient Method for Biomedical Word Sense Disambiguation Based on Web-Kernel Similarity

Mohammed Rais, Mohammed Bekkali, Abdelmonaime Lachkar
2021 International Journal of Healthcare Information Systems and Informatics  
in a given Window of Context using semantic similarity and relatedness measures.  ...  This measure uses the large volume of documents returned by PubMed Search engine to determine the greater context for a biomedical short text through a new term weighting scheme based on Rough Set Theory  ...  The produced search query logs have become a great resource for measuring the similarity between short texts.  ... 
doi:10.4018/ijhisi.20211001.oa9 fatcat:f4rviuttfnhsrn4jw3q4jc3tme

Text classification using document-document semantic similarity

Indrajit Mukherjee, Prabhat Kumar Mahanti, Vandana Bhattacharya, Samudra Banerjee
2013 International Journal of Web Science  
The objective of this paper is to classify the query by using Query-Query Semantic Similarity algorithm (QQSSA).  ...  This can used for the domain specific categorization of different queries and hence can achieve better information retrieval.  ...  [6]es et al. propose a measure of query similarity and use it to build methods for query expansion[6].  ... 
doi:10.1504/ijws.2013.056572 fatcat:km27qxx2pzcjfcrp4pgt55s3nu

Query clustering using content words and user feedback

Ji-Rong Wen, Jian-Yun Nie, Hong-Jiang Zhang
2001 Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '01  
Due to the short length of queries, the traditional approaches based on keywords are not suitable for query clustering.  ...  Query clustering is crucial for automatically discovering frequently asked queries (FAQs) or most popular topics on a question-answering search engine.  ...  It requires a proper estimation of similarity between queries. Given the short length of queries, this similarity cannot be accurately estimated through an analysis of their content words alone.  ... 
doi:10.1145/383952.384083 dblp:conf/sigir/WenZN01 fatcat:ltxwmswq7bcvnak32riiatuhp4

Modeling the impact of short- and long-term behavior on search personalization

Paul N. Bennett, Ryen W. White, Wei Chu, Susan T. Dumais, Peter Bailey, Fedor Borisyuk, Xiaoyuan Cui
2012 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '12  
One aspect of user behavior that provides especially strong signals for delivering better relevance is an individual's history of queries and clicked documents.  ...  Our findings have implications for the design of search systems that leverage user behavior to personalize the search experience.  ...  We would also like to thank Filip Radlinski for discussions around the implications for session-based personalization.  ... 
doi:10.1145/2348283.2348312 dblp:conf/sigir/BennettWCDBBC12 fatcat:gmqw57y5bbburkh7bukjslqbr4

WUST System at NTCIR-12 Short Text Conversation Task

Maofu Liu, Yifan Guo, Yang Wu, Limin Wang, Han Ren
2016 NTCIR Conference on Evaluation of Information Access Technologies  
The core of the system is to calculate the similarity between the responses and the given query q.  ...  Our system constructs the model to find the appropriate comments for the query derived from the given post.  ...  measuring query-posts and query-comments similarities.  ... 
dblp:conf/ntcir/LiuGWWR16 fatcat:arlnwyywqrempo42enyplqljty

Query expansion by mining user logs

Hang Cui, Ji-Rong Wen, Jian-Yun Nie, Wei-Ying Ma
2003 IEEE Transactions on Knowledge and Data Engineering  
Queries to search engines on the Web are usually short. They do not provide sufficient information for an effective selection of relevant documents.  ...  In this study, we propose a new method for query expansion based on user interactions recorded in user logs.  ...  Globally, with query expansion, the performances for short and long queries are similar.  ... 
doi:10.1109/tkde.2003.1209002 fatcat:7t4bi3lljjbczaqbyy3pgsixqi

Nders at the NTCIR-12 STC Task: Ranking Response Messages with Mixed Similarity for Short Text Conversation

Ge Xu, Guifang Lu
2016 NTCIR Conference on Evaluation of Information Access Technologies  
Given a repository of post-comment pairs, for any query, we define three types of similarity and merged them according to empirical weights.  ...  We consider the similarity between a query and a post/comment.  ...  We use the TF-IDF 1 vector space model for measuring the query-post similarity [5] , so the query and the post are all translated into vectors with same length, namely q and p.  ... 
dblp:conf/ntcir/XuL16 fatcat:a7wr7g2zujdtbdpswtwoftdgjm

WUST System at NTCIR-13 Short Text Conversation Task

Maofu Liu, Yifan Guo, Yan Yu, Han Ren
2017 NTCIR Conference on Evaluation of Information Access Technologies  
The core of the system is to calculate the similarity between the responses and the given query q.  ...  Our system constructs the model to search the appropriate comments for the query derived from the given post.  ...  One reason is that our model uses the simple VSM rather than semantic similarity for measuring query-posts and query-comments similarities.  ... 
dblp:conf/ntcir/LiuGYR17 fatcat:bxjajqr5znffhnidopxwjjqaey
« Previous Showing results 1 — 15 out of 292,389 results