Conference Paper

Suggesting Topic-Based Query Terms as You Type.

DOI: 10.1109/APWeb.2010.13 Conference: Advances in Web Technologies and Applications, Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010, Busan, Korea, 6-8 April 2010
Source: DBLP

ABSTRACT Query term suggestion that interactively expands the queries is an indispensable technique to help users formulate high-quality queries and has attracted much attention in the community of web search. Existing methods usually suggest terms based on statistics in documents as well as query logs and external dictionaries, and they neglect the fact that the topic information is very crucial because it helps retrieve topically relevant documents. To give users gratification, we propose a novel term suggestion method: as the user types in queries letter by letter, we suggest the terms that are topically coherent with the query and could retrieve relevant documents instantly. For effectively suggesting highly relevant terms, we propose a generative model by incorporating the topical coherence of terms. The model learns the topics from the underlying documents based on Latent Dirichlet Allocation (LDA). For achieving the goal of instant query suggestion, we use a trie structure to index and access terms. We devise an efficient top-k algorithm to suggest terms as users type in queries. Experimental results show that our approach not only improves the effectiveness of term suggestion, but also achieves better efficiency and scalability.

1 Follower
 · 
161 Views
 · 
0 Downloads
  • Source
    • "For price comparison engines like PriceGabber 5 (in the U.S.), ShoppyDoo 6 (in Italy), or other e-marketplace aggregators, providing an autocompletion feature as-a-service to small/medium client e-marketplaces, often characterised by a poor retrieval features, represents an interesting business op- portunity. An autocompletion interface can perform two types of autocompletion operations: it can complete the query that the user is expressing by proposing a set of queries that are most relevant and reasonable to the query fragment already typed by the user; this type of autocompletion can be called queryoriented [5] [9] [11] [12]. The autocompletion interface can instead preview the results of the query fragment that is being typed by the user; this type of autocompletion can be called result-oriented [6] [10] [15] [21] [32]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Autocompletion systems support users in the formulation of queries in different situations, from development environments to the web. In this paper we describe Composite Match Autocompletion COMMA, a lightweight approach to the introduction of semantics in the realization of a semi-structured data autocompletion matching algorithm. The approach is formally described, then it is applied and evaluated with specific reference to the e-commerce context. The semantic extension to the matching algorithm exploits available information about product categories and distinguishing features of products to enhance the elaboration of exploratory queries. COMMA supports a seamless management of both targeted/precise queries and exploratory/vague ones, combining different filtering and scoring techniques. The algorithm is evaluated with respect both to effectiveness and efficiency in a real-world scenario: the achieved improvement is significant and it is not associated to a sensible increase of computational costs.
    Web Intelligence and Agent Systems 01/2014; 12(1):35-49.
  • Source
    • "Interactive Query Expansion (IQE) addresses the problem of retrieving those terms that, when added to the already expressed query, can lead to high precision and recall results if submitted to a search engine. The suggested terms can be retrieved adopting probabilistic models [5], exploiting semantic relations such as synonymy, hyponymy or hypernymy [4], or considering the behaviour of a user submitting multiple queries [2]. A more recent approach uses query logs to evaluate the similarity between query contexts [3]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Autocompletion systems support users in the formulation of queries in different computer systems, from development environments to the web. In this paper we describe Composite Match Autocompletion (COMMA), a lightweight approach to the introduction of semantics in the realization of a semi-structured data auto completion matching algorithm. The approach is formally described, then it is applied and evaluated with specific reference to the e-commerce context. The semantic extension to the matching algorithm exploits available information about product categories and distinguishing features of products to enhance the elaboration of exploratory queries. COMMA supports a seamless management of both targeted/precise queries and exploratory/vague ones, combining different filtering and scoring techniques. The algorithm is evaluated with respect both to effectiveness and efficiency in a real-world scenario: the achieved improvement is significant and not associated to a sensible increase of computational costs.
    Web Intelligence and Intelligent Agent Technology (WI-IAT), 2012 IEEE/WIC/ACM International Conferences on; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Keyword-based Web search is a widely used approach for locating information on the Web. However, Web users usually suffer from the difficulties of organizing and formulating appropriate input queries due to the lack of sufficient domain knowledge, which greatly affects the search performance. An effective tool to meet the information needs of a search engine user is to suggest Web queries that are topically related to their initial inquiry. Accurately computing query-to-query similarity scores is a key to improve the quality of these suggestions. Because of the short lengths of queries, traditional pseudo-relevance or implicit-relevance based approaches expand the expression of the queries for the similarity computation. They explicitly use a search engine as a complementary source and directly extract additional features (such as terms or URLs) from the top-listed or clicked search results. In this paper, we propose a novel approach by utilizing the hidden topic as an expandable feature. This has two steps. In the offline model-learning step, a hidden topic model is trained, and for each candidate query, its posterior distribution over the hidden topic space is determined to re-express the query instead of the lexical expression. In the online query suggestion step, after inferring the topic distribution for an input query in a similar way, we then calculate the similarity between candidate queries and the input query in terms of their corresponding topic distributions; and produce a suggestion list of candidate queries based on the similarity scores. Our experimental results on two real data sets show that the hidden topic based suggestion is much more efficient than the traditional term or URL based approach, and is effective in finding topically related queries for suggestion.
    World Wide Web 05/2013; 16(3). DOI:10.1007/s11280-011-0151-3 · 1.62 Impact Factor
Show more