Numerical Facet Range Partition: Evaluation Metric and Methods

  title={Numerical Facet Range Partition: Evaluation Metric and Methods},
  author={Xueqing Liu and ChengXiang Zhai and Wei Han and Onur G{\"u}ng{\"o}r},
  journal={Proceedings of the 26th International Conference on World Wide Web Companion},
Faceted navigation is a very useful component in today's search engines. It is especially useful when user has an exploratory information need or prefer certain attribute values than others. Existing work has tried to optimize faceted systems in many aspects, but little work has been done on optimizing numerical facet ranges (e.g., price ranges of product). In this paper, we introduce for the first time the research problem on numerical facet range partition and formally frame it as an… 

Figures and Tables from this paper

Comprehensive Review and Future Research Directions on Dynamic Faceted Search
This paper extensively reviews related research articles published in IEEE Xplore, Web of Science, and the ACM digital library to provide a detailed analysis of the faceted search’s fundamental attributes, as well as to demonstrate the motivation from the usage, concerns, challenges, and recommendations to enhance the use of the facets approach among web search service providers.
Knowledge Discovery from Thai Research Articles by Solr-Based Faceted Search
This paper presents the practical system design and implementation of a knowledge discovery tool in terms of faceted search based on the Apache Solr search platform and focused on Thai research articles for use by Thai scholars.
TELKOMNIKA Telecommunication Computing Electronics and Control
This paper presented several key elements of existing search engine systems, the best of their major features were explored, and guidelines that will help to improve the usability of faceted exploratory search have been suggested and offers a further understanding of the fundamental characteristics of the faceted search.
Past Work 1 . 1 Suggesting Explanations for Security Decision Making
Decision making is a slow judgment process that involves complicated mental models and user efforts in researching, exploration, learning new knowledge, and comparison, and users may find it challenging to make decisions without further assistance from the system.


Approximately optimal facet selection
This work forms facet selection as an optimization problem aiming to maximize the rank promotion of certain documents, and proposes an approximation algorithm for selecting an approximately optimal set of facets per query.
Minimum-effort driven dynamic faceted search in structured databases
This paper proposes minimum-effort driven navigational techniques for enterprise database systems based on the faceted search paradigm that dynamically suggest facets for drilling down into the database such that the cost of navigation is minimized.
FACeTOR: cost-driven exploration of faceted query results
The user study at Amazon Mechanical Turk shows that FACeTOR reduces the user navigation time compared to the cutting edge commercial and academic faceted search algorithms, and the validity of the cost model is confirmed.
Facet selection algorithms for web product search
This paper proposes several algorithms for facet selection, which are evaluated against the state-of-the-art algorithms from the literature, and shows that the Probabilistic Entropy algorithm significantly outperforms the other considered algorithms.
Personalized interactive faceted search
The use of collaborative filtering and personalization to customize the search interface to each user's behavior is proposed and several faceted search algorithms are proposed and evaluated using the novel evaluation methodology.
Faceted exploration of image search results
The system processes semi-structured information sources to extract objects and facets, e.g. the relationships between two objects, and ranks the facets based on a statistical analysis of image search query logs, and the tagging behaviour of users annotating photos in Flickr.
Rank-biased precision for measurement of retrieval effectiveness
A new effectiveness metric, rank-biased precision, is introduced that is derived from a simple model of user behavior, is robust if answer rankings are extended to greater depths, and allows accurate quantification of experimental uncertainty, even when only partial relevance judgments are available.
Learning to Rank by Optimizing NDCG Measure
This work proposes a probabilistic framework that addresses the challenge of evaluating ranking algorithms using the expectation of NDCG over all the possible permutations of documents, and proposes an algorithm that outperforms state-of-the-art ranking algorithms on several benchmark data sets.
Cumulated gain-based evaluation of IR techniques
This article proposes several novel measures that compute the cumulative gain the user obtains by examining the retrieval result up to a given ranked position, and test results indicate that the proposed measures credit IR methods for their ability to retrieve highly relevant documents and allow testing of statistical significance of effectiveness differences.
Optimal Histograms with Quality Guarantees
Algorithms for computing optimal bucket boundaries in time proportional to the square of the number of distinct data values, for a broad class of optimality metrics and an enhancement to traditional histograms that allows us to provide quality guarantees on individual selectivity estimates are presented.