Listing closed sets of strongly accessible set systems with applications to data mining

Theoretical Computer Science

Volumn 411, Issue 3, 2010, Pages 691-700

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

^a FRAUNHOFER IAIS   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Algorithms; Closure operator; Data mining; Listing

Indexed keywords

CLOSED PATTERN; CLOSED SET; CLOSURE OPERATOR; CLOSURE OPERATORS; CONFLUENCE PROPERTY; DATA MINING PROBLEMS; DATA SETS; DIVIDE-AND-CONQUER ALGORITHM; GREEDOIDS; INDEPENDENCE SYSTEM; PARTIAL FUNCTIONS; POWER SET; SET SYSTEM; TIME AND SPACE;

ALGORITHMS; SET THEORY;

MATHEMATICAL OPERATORS;

EID: 72149113845     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.10.024     Document Type: Article

References (13)

1. Ganter B., and Reuter K. Finding all closed sets : A general approach. Order 8 (1991) 283-290
2. Ganter B., and Wille R. Formal Concept Analysis: Mathematical Foundations (1999), Springer Verlag
3. Gély A. A generic algorithm for generating closed sets of a binary relation. Proceedings of ICFCA (2005), Springer 223-234
4. Pasquier N., Bastide Y., Taouil R., and Lakhal L. Efficient mining of association rules using closed itemset lattices. Inf. Syst. 24 1 (1999) 25-46
5. Uno T., Asai T., Uchida Y., and Arimura H. An efficient algorithm for enumerating closed patterns in transaction databases. Proceedings of Discovery Science (2004), Springer 16-31
6. Johnson D.S., Papadimitriou C.H., and Yannakakis M. On generating all maximal independent sets. Inf. Process. Lett. 27 3 (1988) 119-123
7. Nakano S.-I., and Uno T. Constant time generation of trees with specified diameter. In: Hromkovic J., Nagl M., and Westfechtel B. (Eds). WG. Lecture Notes in Computer Science vol. 3353 (2004), Springer 33-45
8. Boley M., Horváth T., Poigné A., and Wrobel S. Efficient closed pattern mining in strongly accessible set systems (extended abstract). Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2007 (2007), Springer 382-389
9. Arimura H., and Uno T. Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems. Proceedings of the SIAM International Conference on Data Mining, SDM 2009 (2009), SIAM 1087-1098
10. Lawler E.L., Lenstra J.K., and Kan A.H.G.R. Generating all maximal independent sets: Np-hardness and polynomial-time algorithms. SIAM J. Comput. 9 3 (1980) 558-565
11. Bridge D., and Ferguson A. Diverse product recommendations using an expressive language for case retrieval. Adv. Case-Based Reason. (2002) 291-298
12. Korte B., and Lovász L. Relations between subclasses of greedoids. Math. Meth. Oper. Res. 29 7 (1985) 249-267
13. Nanni M., Kuijpers B., Körner C., May M., and Pedreschi D. Spatiotemporal data mining. Mobility, Data Mining and Privacy - Geographic Knowledge Discovery (2008)