Multi-class correlated pattern mining

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3933 LNCS, Issue , 2006, Pages 165-187

  Nijssen, Siegfried ^a   Kok, Joost N ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CORRELATION THEORY; DATA MINING; DATABASE SYSTEMS; THEOREM PROVING;

CORRELATION CONSTRAINT; MINIMUM FREQUENCY CONSTRAINTS; PATTERN MINING; SUPPORT THRESHOLDS;

PATTERN RECOGNITION;

EID: 33745796166     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11733492_10     Document Type: Conference Paper

References (12)

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, 1996.
2. S. D. Bay and M. J. Pazzani. Detecting change in categorical data: Mining contrast sets. In Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining (KDD), pages 302-306. ACM Press, 1999.
3. S. D. Bay and M. J. Pazzani. Detecting group differences: Mining contrast sets. In Data Mining and Knowledge Discovery, volume 5, pages 213-246. Kluwer Academic Publishers, 2001.
4. F. Bodon. Surprising results of trie-based FIM algorithms. In Proceedings of the Workshop on Frequent Itemset Mining Implementations (FIMI), volume 90 of CEUR Workshop Proceedings, 2004.
5. C.L. Blake D.J. Newman, S. Hettich and C.J. Merz. UCI repository of machine learning databases, 1998.
6. J. Fürnkranz and P. Flach. ROC 'n' rule learning - towards a better understanding of covering algorithms. In Machine Learning, volume 58, pages 39-77, 2005.
7. 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.
8. B. Kavšek, N. Lavrač, and V. Jovanoski. APRIORI-SD: Adapting association rule learning to subgroup discovery. In Proceedings of the Fifth International Symposium on Intelligent Data Analysis, volume 2810 of Lecture Notes in Computer Science, pages 230-241. Springer-Verlag, 2003.
9. B. Liu, Y. Ma, and C.-K.Wong. Improving an exhaustive search based rule learner. In Proceedings of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), volume 1910 of Lecture Notes in Artificial Intelligence, pages 504-509, 2000.
10. S. Morishita and J. Sese. Traversing itemset lattices with statistical metric pruning. In Proceedings of the Nineteenth ACM SIGACT-SIGMOD-SIGART Symposium on Database Systems (PODS), pages 226-236, 2000.
11. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proceedings of the Third International Conference on Knowledge Di scovery and Data Mining (KDD), pages 283-286, 1997.
12. A. Zimmermann and L. De Raedt. Cluster-grouping: From subgroup discovery to clustering. In Proceedings of the 15th European Conference on Machine Learning (ECML), volume 3201 of Lecture Notes in Computer Science, pages 575-577, 2004.