ACM Home Page
Please provide us with feedback. Feedback
Constraint programming for itemset mining
Full text PdfPdf (499 KB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Las Vegas, Nevada, USA
SESSION: Research papers table of contents
Pages 204-212  
Year of Publication: 2008
ISBN:978-1-60558-193-4
Authors
Luc De Raedt  Katholieke Universiteit Leuven, Leuven, Belgium
Tias Guns  Katholieke Universiteit Leuven, Leuven, Belgium
Siegfried Nijssen  Katholieke Universiteit Leuven, Leuven, Belgium
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 198,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1401890.1401919
What is a DOI?

ABSTRACT

The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in constraint programming environments. The resulting framework is surprisingly flexible and allows us to combine a wide range of mining constraints in different ways. We implement this approach in off-the-shelf constraint programming systems and evaluate it empirically. The results show that the approach is not only very expressive, but also works well on complex benchmark problems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
 
6
 
7
8
 
9
 
10
B. Goethals and M. J. Zaki. Advances in frequent itemset mining implementations: report on FIMI'03. In SIGKDD Explorations Newsletter, volume 6, pages 109--117, 2004.
11
 
12
 
13
 
14
C. Schulte and P. J. Stuckey. Efficient constraint propagation engines. Transactions on Programming Languages and Systems, 2008. To appear.
15
 
16
M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In KDD, pages 283--286, 1997.


Collaborative Colleagues:
Luc De Raedt: colleagues
Tias Guns: colleagues
Siegfried Nijssen: colleagues