Frequent Pattern Discovery with Constraint Logic Programming
Nittaya Kerdprasop, Kittisak Kerdprasop · 2011
Abstract—Constraint logic programming is a declarative programming style combining the features of logic programming and constraint propagation to solve combinatorial and optimization problems such as resource allocation, scheduling, and routing. We consider the problem of mining frequent patterns within a setting of constraint logic programming approach. Frequent patterns are patterns such as sets of features or items in transactions that appear frequently. Such patterns can reveal associations, correlations, and many other interesting relationships hidden in a dataset. Constraints can play an important role in improving the performance of mining algorithms. The problem of constraint-based pattern mining can be formulated as the discovery of all patterns in a given dataset that satisfy the specified constraints. We present implementation of problem modeling and solving with respect to pattern mining in knowledge discovery in databases.