A generic approach for modeling and mining n-ary patterns

Authors:
Mehdi Khiari;Patrice Boizumault;Bruno Crémilleux
Affiliations:
GREYC, CNRS, UMR, Université de Caen Basse-Normandie, Caen Cedex, France;GREYC, CNRS, UMR, Université de Caen Basse-Normandie, Caen Cedex, France;GREYC, CNRS, UMR, Université de Caen Basse-Normandie, Caen Cedex, France
Venue:
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Year:
2011

Citing 5
Cited 0

Exploratory mining and pruning optimizations of constrained associations rules

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Constraint programming for itemset mining

Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
A constraint-based querying system for exploratory pattern discovery

Information Systems
Constraint programming for mining n-ary patterns

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Pattern teams

PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to model and mine patterns combining several local patterns (n-ary patterns). First, the user expresses his/her query under constraints involving n-ary patterns. Second, a constraint solver generates the correct and complete set of solutions. This approach enables to model in a flexible way sets of constraints combining several local patterns and it leads to discover patterns of higher level. Experiments show the feasibility and the interest of our approach.