Constraint-Based mining of fault-tolerant patterns from boolean data

  • Authors:
  • Jérémy Besson;Ruggero G. Pensa;Céline Robardet;Jean-François Boulicaut

  • Affiliations:
  • INSA Lyon, LIRIS CNRS UMR 5205, Villeurbanne, France;INSA Lyon, LIRIS CNRS UMR 5205, Villeurbanne, France;INSA Lyon, PRISMA, Villeurbanne, France;INSA Lyon, LIRIS CNRS UMR 5205, Villeurbanne, France

  • Venue:
  • KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Thanks to an important research effort during the last few years, inductive queries on local patterns (e.g., set patterns) and their associated complete solvers have been proved extremely useful to support knowledge discovery. The more we use such queries on real-life data, e.g., biological data, the more we are convinced that inductive queries should return fault-tolerant patterns. This is obviously the case when considering formal concept discovery from noisy datasets. Therefore, we study various extensions of this kind of bi-set towards fault-tolerance. We compare three declarative specifications of fault-tolerant bi-sets by means of a constraint-based mining approach. Our framework enables a better understanding of the needed trade-off between extraction feasibility, completeness, relevance, and ease of interpretation of these fault-tolerant patterns. An original empirical evaluation on both synthetic and real-life medical data is given. It enables a comparison of the various proposals and it motivates further directions of research.