Revisiting numerical pattern mining with formal concept analysis

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 1342-1347

  Kaytoue, Mehdi ^a   Kuznetsov, Sergei O ^b   Napoli, Amedeo ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

^b NATIONAL RESEARCH UNIVERSITY HIGHER SCHOOL OF ECONOMICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED PATTERN; EQUIVALENT CLASS; NUMERICAL ATTRIBUTES; NUMERICAL DATA; PATTERN MINING; REAL-WORLD; SCALING PROCEDURES;

ARTIFICIAL INTELLIGENCE; EQUIVALENCE CLASSES; INFORMATION ANALYSIS;

FORMAL CONCEPT ANALYSIS;

EID: 84864074733     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-227     Document Type: Conference Paper

References (13)

1. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. SIGKDD Expl., 2(2):66-75, 2000.
2. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, and K. Makino. An intersection inequality for discrete distributions and related generation problems. In International Colloquium on Automata, Languages and Programming (ICALP), LNCS (2749), pages 543-555. Springer, 2003.
3. T. Calders and B. Goethals. Depth-first non-derivable itemset mining. In SIAM International Conference on Data Mining, 2005.
4. B. Ganter and S. O. Kuznetsov. Pattern structures and their projections. In 9th Int. Conf. on Conceptual Structures (ICCS), LNCS (2120), pages 129-142. Springer, 2001.
5. B. Ganter and R. Wille. Formal Concept Analysis. Springer, 1999.
6. M. Kaytoue, S. O. Kuznetsov, and A. Napoli. Pattern mining in numerical data: extracting closed patterns and their generators. Research Report RR-7416, INRIA, 2010.
7. M. Kaytoue, S. O. Kuznetsov, A. Napoli, and S. Duplessis. Mining gene expression data with pattern structures in formal concept analysis. Inf. Sci., 181(10):1989-2001, 2011.
8. S. O. Kuznetsov and S. A. Obiedkov. Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell., 14(2-3):189-216, 2002.
9. J. Li, H. Li, L. Wong, J. Pei, and G. Dong. Minimum description length principle: Generators are preferable to closed patterns. In Innovative Applications of Artificial Intelligence Conference. AAAI Press, 2006.
10. G. Liu, J. Li, L. Wong, and W. Hsu. Positive borders or negative borders: How to make lossless generator based representations concise. In SIAM Int. Conf. on Data Mining, 2006.
11. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In ACM SIGMOD Int. Conf. onManagement of Data, pages 1-12. ACM, 1996. (Pubitemid 126440751)
12. G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, and L. Lakhal. Computing iceberg concept lattices with titanic. Data Knowl. Eng., 42(2), 2002.
13. T. Uno, M. Kiyomi, and H. Arimura. Lcm ver. 2: Efficient mining algorithms for frequent/ closed/maximal itemsets. In IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2004.