Paper Info
Title
Constraint programming for mining n-ary patterns
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.
Year
DOI
Venue
2010
10.1007/978-3-642-15396-9_44
CP
Keywords
Field
DocType
higher level,constraint solver,local pattern,constraint programming,mining n-ary pattern,n-ary pattern
Constraint satisfaction,Mathematical optimization,Constraint (mathematics),Computer science,Constraint programming,Constraint satisfaction problem,Constraint logic programming
Conference
Volume
ISSN
ISBN
6308
0302-9743
3-642-15395-X
Citations 
PageRank 
References 
29
0.98
17
Authors
3
Name
Order
Citations
PageRank
Mehdi Khiari1564.45
Patrice Boizumault229431.56
Bruno Crémilleux337334.98