Results 321 to 330 of about 474,618 (366)
Some of the next articles are maybe not open access.
Exploiting query reformulations for web search result diversification
The Web Conference, 2010When a Web user's underlying information need is not clearly specified from the initial query, an effective approach is to diversify the results retrieved for this query.
Rodrygo L. T. Santos +2 more
semanticscholar +1 more source
Query aspects approach to web search
Web Intelligence, 2016This paper introduces an aspect based model for analysing search queries, where queries are represented as aspects or concepts instead of “bag of words” or strings. A search query may consist of multiple aspects, while some aspects are covered well in the search results and some others are underrepresented.
Daniel Crabtree +2 more
openaire +2 more sources
Towards Web Search by Sentence Queries: Asking the Web for Query Substitutions
2011In this paper, we propose a method to search the Web for sentence substitutions for a given sentence query. Our method uses only lexico-syntactic patterns dynamically generated from the input sentence query to collect sentence substitutions from the Web on demand.
Yusuke Yamamoto, Katsumi Tanaka
openaire +2 more sources
Facet discovery for structured web search: a query-log mining approach
ACM SIGMOD Conference, 2011In recent years, there has been a strong trend of incorporating results from structured data sources into keyword-based web search systems such as Bing or Amazon.
Jeffrey Pound +2 more
semanticscholar +1 more source
Identification of ambiguous queries in web search
Information Processing & Management, 2009It is widely believed that many queries submitted to search engines are inherently ambiguous (e.g., java and apple). However, few studies have tried to classify queries based on ambiguity and to answer ''what the proportion of ambiguous queries is''. This paper deals with these issues.
Zhenxiao Luo +4 more
openaire +2 more sources
Batch query processing for web search engines
Web Search and Data Mining, 2011Large web search engines are now processing billions of queries per day. Most of these queries are interactive in nature, requiring a response in fractions of a second.
Shuai Ding +3 more
semanticscholar +1 more source
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
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