Efficient discovery of interesting patterns based on strong closedness

Statistical Analysis and Data Mining

Volumn 2, Issue 5-6, 2009, Pages 346-360

  Boley, Mario ^a   Horváth, Tamás ^a,b   Wrobel, Stefan ^a,b  

^a FRAUNHOFER IAIS   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Closure operators; Concept lattice pruning; Constrained based pattern mining; Formal concept analysis; Frequent itemset mining; Interestingness notions; Polynomial delay listing algorithms

Indexed keywords

DATA MINING;

CLOSURE OPERATORS; CONCEPT LATTICE PRUNING; CONCEPT LATTICES; CONSTRAINED-BASED PATTERN MINING; FORMAL CONCEPTS ANALYSIS; FREQUENT ITEMSET MINING; INTERESTINGNESS; INTERESTINGNESS NOTION; LISTING ALGORITHMS; PATTERN MINING; POLYNOMIAL DELAY LISTING ALGORITHM; POLYNOMIAL DELAYS;

FORMAL CONCEPT ANALYSIS;

EID: 77950229328     PISSN: 19321872     EISSN: 19321864     Source Type: Journal    
DOI: 10.1002/sam.10057     Document Type: Article

References (22)

1. H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Mining Knowl Discovery 1(3) (1997), 241-258.
2. B. Ganter and R. Wille, Formal Concept Analysis: Mathematical Foundations, Berlin, Springer-Verlag, 1999.
3. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, Trawling the web for emerging cyber-communities, Comput Netw 31(11-16) (1999), 1481-1493.
4. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Efficient mining of association rules using closed itemset lattices, Inform Syst 24(1) (1999), 25-46.
5. M. Boley and H. Grosskreutz, Non-redundant subgroup discovery using a closure system, Lecture Notes In Artificial Intelligence, Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases, vol. 5781, Bled, Slovenia, 2009, 179-194.
6. T. Uno, T. Asai, Y. Uchida, and H. Arimura, An efficient algorithm for enumerating closed patterns in transaction databases, Lect Notes Comput Sc 3245, (2004), 16-31.
7. G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, and L. Lakhal, Computing iceberg concept lattices with t, Data Knowl Eng 42(2) (2002), 189-222.
8. B. Ganter and K. Reuter, Finding all closed sets: a general approach, Order 8(3) (1991), 283-280.
9. A. Gély, A generic algorithm for generating closed sets of a binary relation. Proceedings of 3rd International Conference on Formal Concept Analysis (ICFCA), vol. 3403, Lecture Notes in Computer Science, Lecture Notes in Computer Science, Springer, 2005, 223-234.
10. J. Wang, J. Han, and J. Pei, Closet+: searching for the best strategies for mining frequent closed itemsets, in KDD, L. Getoor, E. Senator, P. Domingos, and C. Faloutsos (eds) ACM, 2003, 236-245.
11. M.J. Zaki and C.-J. Hsiao, Charm: an efficient algorithm for closed itemset mining, in SDM, R. L. Grossman, J. Han, V. Kumar, H. Mannila, and R. Motwani (eds) SIAM, 2002.
12. J. Besson, C. Robardet, J.-F. Boulicaut, and S. Rome, Constraint-based concept mining and its application to microarray data analysis, Intell Data Anal 9(1) (2005), 59-82.
13. L. Cerf, J. Besson, C. Robardet, and J.-F. Boulicaut, Data peeler: Contraint-based closed pattern mining in n-ary relations, SDM, SIAM, 2008, 37-48.
14. K. Geurts, G. Wets, T. Brijs, and K. Vanhoof, Profiling high frequency accident locations using association rules. Proceedings of the 82nd Annual Transportation Research Board, Washington, D.C. January 12-16, 2003, 18.
15. B. Goethals and M. J. Zaki, Advances in frequent itemset mining implementations: report on fimi'03, SIGKDD Explor 6(1) (2004), 109-117.
16. A. Asuncion and D. J. Newman, UCI Machine Learning repository, 2007.
17. J. Breese, D. Heckerman, and C. Kadie, Empirical analysis of predictive algorithms for collaborative filtering. Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, Madison, WI, 1998.
18. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets, Using association rules for product assortment decisions: A case study, International Conference on Knowledge Discovery and Data Mining. In Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, San Diego, California, USA, 1999, 254-260.
19. J. Cheng, Y. Ke, and W. Ng, δ-tolerance closed frequent itemsets, Proceedings of the 6th IEEE International Conference on Data Mining (ICDM), IEEE Computer Society, 2006, 139-148.
20. J.-F. Boulicaut, A. Bykowski, and C. Rigotti, Free-sets: a condensed representation of boolean data for the approximation of frequency queries, Data Mining Knowl Discovery 7(1) (2003), 5-22.
21. D. Xin, J. Han, X. Yan, and H. Cheng, Mining compressed frequent-pattern sets, VLDB '05: Proceedings of the 31st International Conference on Very Large Data Bases, VLDB Endowment, 2005, 709-720.
22. C. Yang, U. Fayyad, and P. S. Bradley, Efficient discovery of error-tolerant frequent itemsets in high dimensions, KDD '01: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, ACM, 2001, 194-203