Results 301 to 310 of about 274,007 (336)
Some of the next articles are maybe not open access.
Query taxonomy generation for web search
Proceedings of the 15th ACM international conference on Information and knowledge management - CIKM '06, 2006We propose an approach that organizes the search-result clusters into a hierarchical structure, called a query taxonomy, from the user's perspective. The proposed approach is based on an unsupervised classification method, which uses the dynamic Web as the training corpus.
Pu-Jeng Cheng +3 more
openaire +2 more sources
2004
In the terminology of Logic programming, current search engines answer Σ1 queries (formulas of the form \(\exists\overline{x}\varphi(\overline{x})\) where \(\varphi(\overline{x})\) is a boolean combination of attributes). Such a query is determined by a particular sequence of keywords input by a user.
openaire +2 more sources
In the terminology of Logic programming, current search engines answer Σ1 queries (formulas of the form \(\exists\overline{x}\varphi(\overline{x})\) where \(\varphi(\overline{x})\) is a boolean combination of attributes). Such a query is determined by a particular sequence of keywords input by a user.
openaire +2 more sources
Topic-oriented query expansion for web search [PDF]
Proceedings of the 15th international conference on World Wide Web, 2006 The contribution of this paper includes three folders: (1) To introduce a topic-oriented query expansion model based on the Information Bottleneck theory that classify terms into distinct topical clusters in order to find out candidate terms for the query expansion.
Shao-Chi Wang, Yuzuru Tanaka
openaire +1 more source
Query Suggestion by Query Search: A New Approach to User Support in Web Search
2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, 2009This paper introduces and analyzes a new approach to query suggestion. After the user issues a query q_0, for every document retrieved in a certain rank range [Theta_1,Theta_2], a query search procedure constructs queries that rank the document high enough for the user to see it.
Shen Jiang +2 more
openaire +2 more sources
A Query Substitution-Search Result Refinement Approach for Long Query Web Searches
2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, 2009Long queries are widely used in current Web applications, such as literature searches, news searches, etc. However, since long queries are frequently expressed as natural language texts but not keywords, the current keywords-based search engines, like GOOGLE, perform worse with long queries than with short ones. This paper proposes a query substitution
Yan-Qing Zhang, Yan Chen
openaire +2 more sources
Entity Linking for Web Search Queries
2015We consider the problem of linking web search queries to entities from a knowledge base such as Wikipedia. Such linking enables converting a user’s web search session to a footprint in the knowledge base that could be used to enrich the user profile.
Padmanabhan, Deepak +3 more
openaire +3 more sources
Adaptive query routing in peer web search
Special interest tracks and posters of the 14th international conference on World Wide Web - WWW '05, 2005An unstructured peer network application was proposed to address the query forwarding problem of distributed search engines and scalability limitations of centralized search engines. Here we present novel techniques to improve local adaptive routing, showing they perform significantly better than a simple learning scheme driven by query response ...
Le-Shin Wu +2 more
openaire +2 more sources
Query sampling for ranking learning in web search
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, 2009Learning to rank has become a popular approach to build a ranking model for Web search recently. Based on our observation, the constitution of the training set will greatly influence the performance of the learned ranking model. Meanwhile, the number of queries in Web search is nearly infinite and the human labeling cost is expensive, hence a subset of
Linjun Yang +3 more
openaire +2 more sources
Predicting query reformulation during web searching
CHI '09 Extended Abstracts on Human Factors in Computing Systems, 2009his paper reports results from a study in which we automatically classified the query reformulation patterns for 964,780 Web searching sessions (composed of 1,523,072 queries) in order to predict what the next query reformulation would be. We employed an n-gram modeling approach to describe the probability of searchers transitioning from one query ...
Jansen, Bernard +2 more
openaire +3 more sources
Query Difficulty Prediction for Web Image Search
IEEE Transactions on Multimedia, 2012Image search plays an important role in our daily life. Given a query, the image search engine is to retrieve images related to it. However, different queries have different search difficulty levels. For some queries, they are easy to be retrieved (the search engine can return very good search results).
Xinmei Tian, Linjun Yang, Yijuan Lu
openaire +1 more source