Dynamic facet ordering for faceted product search engines (Extended Abstract)

Damir Vandic, Steven S. Aanen, Flavius Frasincar, Uzay Kaymak

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

Currently many webshops rely on a fixed list of product facets to help users find the products of interest. Such a solution suffers from two problems: (1) it is difficult to devise a fixed list of facets that would satisfy all user interests, and (2) the top facets could become obsolete when all product results have these facets. To address these two problems we propose a novel algorithm for dynamic ordering of the product facets based on the query results. This algorithm relies on measures such as specificity and dispersion for qualitative and quantitative facets, respectively, to rank the properties associated with these facets so that users are able to find the products of interest with a minimum number of drill-down steps. Using a large-scale simulation study and a user-based evaluation, we show that our algorithm outperforms the expert-based fixed facets approach, a greedy baseline, and a state-of-The-Art entropy-based solution. This paper is an extended abstract of our previous work [1].

Original languageEnglish
Title of host publicationProceedings - IEEE 34th International Conference on Data Engineering, ICDE 2018
PublisherInstitute of Electrical and Electronics Engineers
Pages1813-1814
Number of pages2
ISBN (Electronic)9781538655207
DOIs
Publication statusPublished - 25 Oct 2018
Event34th IEEE International Conference on Data Engineering, ICDE 2018 - Paris, France
Duration: 16 Apr 201819 Apr 2018

Conference

Conference34th IEEE International Conference on Data Engineering, ICDE 2018
CountryFrance
CityParis
Period16/04/1819/04/18

Keywords

  • Facet ordering
  • Product search
  • User interfaces

Fingerprint Dive into the research topics of 'Dynamic facet ordering for faceted product search engines (Extended Abstract)'. Together they form a unique fingerprint.

Cite this