FastXplain: conflict detection for constraint-based recommendation problems

  • Authors:
  • Monika Schubert;Alexander Felfernig;Monika Mandl

  • Affiliations:
  • Applied Software Engineering, IST, Graz University of Technology, Graz, Austria;Applied Software Engineering, IST, Graz University of Technology, Graz, Austria;Applied Software Engineering, IST, Graz University of Technology, Graz, Austria

  • Venue:
  • IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Constraint-based recommender systems support users in the identification of interesting items from large and potentially complex assortments. Within the scope of such a preference construction process, users are repeatedly defining and revising their requirements. As a consequence situations occur where none of the items completely fulfills the set of requirements and the question has to be answered which is the minimal set of requirements that has to be changed in order to be able to find a recommendation. The identification of such minimal sets relies heavily on the identification of minimal conflict sets. Existing conflict detection algorithms are not exploiting the basic structural properties of constraint-based recommendation problems. In this paper we introduce the FastXplain conflict detection algorithm which shows a significantly better performance compared to existing conflict detection algorithms. In order to demonstrate the applicability of our algorithm we report the results of a corresponding performance evaluation.