research-article

Constraint programming for itemset mining

Authors:

Siegfried NijssenAuthors Info & Claims

KDD '08: Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining

Pages 204 - 212

https://doi.org/10.1145/1401890.1401919

Published: 24 August 2008 Publication History

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

[1]

R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307--328. AAAI Press, 1996.

Digital Library

[2]

K. R. Apt and M. Wallace. Constraint Logic Programming using Eclipse. Cambridge University Press, New York, NY, USA, 2007.

Digital Library

[3]

F. Bonchi and C. Lucchese. On closed constrained frequent pattern mining. In ICDM, pages 35--42. IEEE Computer Society, 2004.

Digital Library

[4]

F. Bonchi and C. Lucchese. Extending the state-of-the-art of constraint-based pattern discovery. Data Knowl. Eng., 60(2):377--399, 2007.

Digital Library

[5]

C. Bucila, J. Gehrke, D. Kifer, and W. M. White. Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Min. Knowl. Discov., 7(3):241--272, 2003.

Digital Library

[6]

D. Burdick, M. Calimlim, J. Flannick, J. Gehrke, and T. Yiu. Mafia: A maximal frequent itemset algorithm. IEEE Trans. Knowl. Data Eng., 17(11):1490--1504, 2005.

Digital Library

[7]

J. Cheng, Y. Ke, and W. Ng. δ-tolerance closed frequent itemsets. In ICDM '06: Proceedings of the Sixth International Conference on Data Mining, pages 139--148, 2006.

Digital Library

[8]

G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In KDD, pages 43--52, 1999.

Digital Library

[9]

E. Frank and I. H. Witten. Using a permutation test for attribute selection in decision trees. In Proc. 15th International Conf. on Machine Learning, pages 152--160, 1998.

Digital Library

[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.

Digital Library

[11]

J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 1--12, 2000.

Digital Library

[12]

J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent item sets with convertible constraints. In Proceedings of the IEEE International Conference on Data Engineering (ICDE), pages 433--442, 2001.

Digital Library

[13]

F. Rossi, P. van Beek, and T. Walsh. Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., 2006.

Digital Library

[14]

C. Schulte and P. J. Stuckey. Efficient constraint propagation engines. Transactions on Programming Languages and Systems, 2008. To appear.

Digital Library

[15]

T. Uno, M. Kiyomi, and H. Arimura. Lcm ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining. In OSDM '05: Proceedings of the 1st international workshop on open source data mining, pages 77--86, 2005.

Digital Library

[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.

Digital Library

Cited By

Baaj IBouraoui ZCornuéjols ADenœux TDestercke SDubois DLesot MMarques-Silva JMengin JPrade HSchockaert SSerrurier MStrauss OVrain C(2024)Synergies Between Machine Learning and Reasoning - An Introduction by the Kay R. Amel groupInternational Journal of Approximate Reasoning10.1016/j.ijar.2024.109206(109206)Online publication date: Apr-2024
https://doi.org/10.1016/j.ijar.2024.109206
Dao TVrain C(2024)A review on declarative approaches for constrained clusteringInternational Journal of Approximate Reasoning10.1016/j.ijar.2024.109135(109135)Online publication date: Mar-2024
https://doi.org/10.1016/j.ijar.2024.109135
Jabbour SRaddaoui BSais LElkind E(2023)A symbolic approach to computing disjunctive association rules from dataProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/237(2133-2141)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/237
Show More Cited By

Index Terms

Constraint programming for itemset mining
1. Information systems
  1. Information systems applications
    1. Data mining
2. Theory of computation
  1. Logic
    1. Constraint and logic programming

Recommendations

Correlated itemset mining in ROC space: a constraint programming approach
KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining

Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting correlation measures in ROC space and formulating correlated itemset mining as ...
Itemset mining: A constraint programming perspective

The field of data mining has become accustomed to specifying constraints on patterns of interest. A large number of systems and techniques has been developed for solving such constraint-based mining problems, especially for mining itemsets. The approach ...
Explanations for Itemset Mining by Constraint Programming: A Case Study Using ChEMBL Data
Advances in Intelligent Data Analysis XXI
Abstract
In sensitive applications, such as drug development, offering experts an explanation for why data mining operations arrive at certain results adds a very valuable facet. In this work we benefit from modelling the task as a Constraint Satisfaction ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

KDD '08: Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining

August 2008

1116 pages

ISBN:9781605581934

DOI:10.1145/1401890

General Chair:
Ying Li
Microsoft adCenter Labs
,
Program Chairs:
Bing Liu
University of Illinois at Chicago
,
Sunita Sarawagi
Indian Institute of Technology, Bombay

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 August 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

KDD08

Sponsor:

KDD08: The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

August 24 - 27, 2008

Nevada, Las Vegas, USA

Acceptance Rates

KDD '08 Paper Acceptance Rate 118 of 593 submissions, 20%;

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Upcoming Conference

KDD '24

Sponsor:
sigkdd
sigkdd

The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining

August 25 - 29, 2024

Barcelona , Spain

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

89
Total Citations
View Citations
704
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)0

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

Baaj IBouraoui ZCornuéjols ADenœux TDestercke SDubois DLesot MMarques-Silva JMengin JPrade HSchockaert SSerrurier MStrauss OVrain C(2024)Synergies Between Machine Learning and Reasoning - An Introduction by the Kay R. Amel groupInternational Journal of Approximate Reasoning10.1016/j.ijar.2024.109206(109206)Online publication date: Apr-2024
https://doi.org/10.1016/j.ijar.2024.109206
Dao TVrain C(2024)A review on declarative approaches for constrained clusteringInternational Journal of Approximate Reasoning10.1016/j.ijar.2024.109135(109135)Online publication date: Mar-2024
https://doi.org/10.1016/j.ijar.2024.109135
Jabbour SRaddaoui BSais LElkind E(2023)A symbolic approach to computing disjunctive association rules from dataProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/237(2133-2141)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/237
Koptelov MZimmermann ABoizumault PBureau RLamotte J(2023)Explanations for Itemset Mining by Constraint Programming: A Case Study Using ChEMBL DataAdvances in Intelligent Data Analysis XXI10.1007/978-3-031-30047-9_17(208-221)Online publication date: 1-Apr-2023
https://doi.org/10.1007/978-3-031-30047-9_17
Alòs JAnsótegui CTorres E(2022)Interpretable decision trees through MaxSATArtificial Intelligence Review10.1007/s10462-022-10377-056:8(8303-8323)Online publication date: 27-Dec-2022
https://dl.acm.org/doi/10.1007/s10462-022-10377-0
Le Van Tvan Leeuwen MNijssen SFierro AMarchal KDe Raedt L(2022)Ranked TilingMachine Learning and Knowledge Discovery in Databases10.1007/978-3-662-44851-9_7(98-113)Online publication date: 10-Mar-2022
https://dl.acm.org/doi/10.1007/978-3-662-44851-9_7
Belaid MLazaar N(2021)Constraint Programming for Itemset Mining with Multiple Minimum Supports2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)10.1109/ICTAI52525.2021.00095(598-603)Online publication date: Nov-2021
https://doi.org/10.1109/ICTAI52525.2021.00095
Hidouri AJabbour SRaddaoui BBen Yaghlane B(2021)Mining Closed High Utility Itemsets based on Propositional SatisfiabilityData & Knowledge Engineering10.1016/j.datak.2021.101927136:COnline publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1016/j.datak.2021.101927
Nekkache IJabbour SSais LKamel N(2021)Towards a Compact SAT-Based Encoding of Itemset Mining TasksIntegration of Constraint Programming, Artificial Intelligence, and Operations Research10.1007/978-3-030-78230-6_11(163-178)Online publication date: 17-Jun-2021
https://doi.org/10.1007/978-3-030-78230-6_11
Hien ALoudni SAribi NLebbah YLaghzaoui MOuali AZimmermann A(2021)A Relaxation-Based Approach for Mining Diverse Closed PatternsMachine Learning and Knowledge Discovery in Databases10.1007/978-3-030-67658-2_3(36-54)Online publication date: 25-Feb-2021
https://doi.org/10.1007/978-3-030-67658-2_3
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents