Composite match autocompletion (COMMA): A semantic result-oriented autocompletion technique for e-marketplaces

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.

[1]  Alia Amin,et al.  Organizing Suggestions in Autocompletion Interfaces , 2009, ECIR.

[2]  Hao Wu,et al.  Suggesting Topic-Based Query Terms as You Type , 2010, 2010 12th International Asia-Pacific Web Conference.

[3]  Eero Hyvönen,et al.  Semantic Yellow Page Service Discovery: The Veturi Portal , 2005 .

[4]  T. Saaty,et al.  Why the magic number seven plus or minus two , 2003 .

[5]  Enhong Chen,et al.  Context-aware query suggestion by mining click-through and session data , 2008, KDD.

[6]  Ron Kohavi,et al.  Responsible editor: R. Bayardo. , 2022 .

[7]  Ziv Bar-Yossef,et al.  Context-sensitive query auto-completion , 2011, WWW.

[8]  Ingmar Weber,et al.  Output-sensitive autocompletion search , 2006, Information Retrieval.

[9]  Peter Mika,et al.  Ad-hoc object retrieval in the web of data , 2010, WWW '10.

[10]  Guoliang Li,et al.  Efficient interactive fuzzy keyword search , 2009, WWW '09.

[11]  Eero Hyvönen,et al.  Combining Context Navigation with Semantic Autocompletion to Solve Problems in Concept Selection , 2008, SeMMA.

[12]  Sreenivas Gollapudi,et al.  Diversifying search results , 2009, WSDM '09.

[13]  Gerard Salton,et al.  Term-Weighting Approaches in Automatic Text Retrieval , 1988, Inf. Process. Manag..

[14]  Stephen E. Robertson,et al.  Simple BM25 extension to multiple weighted fields , 2004, CIKM '04.

[15]  Stephen E. Robertson,et al.  A probabilistic model of information retrieval: development and comparative experiments - Part 1 , 2000, Inf. Process. Manag..

[16]  Hideo Joho,et al.  Hierarchical presentation of expansion terms , 2002, SAC '02.

[17]  Roi Blanco,et al.  Effective and Efficient Entity Search in RDF Data , 2011, SEMWEB.

[18]  Surajit Chaudhuri,et al.  Extending autocompletion to tolerate errors , 2009, SIGMOD Conference.

[19]  Robert B. Miller,et al.  Response time in man-computer conversational transactions , 1899, AFIPS Fall Joint Computing Conference.

[20]  Thanh Tran,et al.  The first joint international workshop on entity-oriented and semantic search (JIWES) , 2012, SIGF.

[21]  Brian P. Bailey,et al.  The Effects of Interruptions on Task Performance, Annoyance, and Anxiety in the User Interface , 2001, INTERACT.

[22]  Krisztian Balog,et al.  On the Modeling of Entities for Ad-Hoc Entity Search in the Web of Data , 2012, ECIR.

[23]  Jaana Kekäläinen,et al.  Cumulated gain-based evaluation of IR techniques , 2002, TOIS.

[24]  Jaap Kamps,et al.  Fifth workshop on exploiting semantic annotations in information retrieval: ESAIR''12) , 2012, CIKM '12.

[25]  Gonzalo Navarro,et al.  Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences , 2002 .

[26]  Zhiguo Gong,et al.  Web Query Expansion by WordNet , 2005, DEXA.