Computer Science – Learning
Scientific paper
2011-07-18
Computer Science
Learning
12 pages
Scientific paper
Discovering pattern sets or global patterns is an attractive issue from the pattern mining community in order to provide useful information. By combining local patterns satisfying a joint meaning, this approach produces patterns of higher level and thus more useful for the data analyst than the usual local patterns, while reducing the number of patterns. In parallel, recent works investigating relationships between data mining and constraint programming (CP) show that the CP paradigm is a nice framework to model and mine such patterns in a declarative and generic way. We present a constraint-based language which enables us to define queries addressing patterns sets and global patterns. The usefulness of such a declarative approach is highlighted by several examples coming from the clustering based on associations. This language has been implemented in the CP framework.
Boizumault Patrice
Crémilleux Bruno
Khiari Mehdi
Loudni Samir
Métivier Jean-Philippe
No associations
LandOfFree
Discovering Knowledge using a Constraint-based Language does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Discovering Knowledge using a Constraint-based Language, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Discovering Knowledge using a Constraint-based Language will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-271410