Feature term subsumption using constraint programming with basic variable symmetry

  • Authors:
  • Santiago Ontañón;Pedro Meseguer

  • Affiliations:
  • Computer Science Department, Drexel University, Philadelphia, PA;IIIA-CSIC, Universitat Autònoma de Barcelona, Bellaterra, Spain

  • Venue:
  • CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Feature Terms are a generalization of first-order terms which have been recently received increased attention for their usefulness in structured machine learning applications. One of the main obstacles for their wide usage is that their basic operation, subsumption, has a very high computational cost. Constraint Programming is a very suitable technique to implement that operation, in some cases providing orders of magnitude speed-ups with respect to the standard subsumption approach. In addition, exploiting a basic variable symmetry ---that often appears in Feature Terms databases--- causes substantial additional savings. We provide experimental results of the benefits of this approach.