Algorithm for mining closed frequent itemsets based on apposition assembly of iceberg concept lattices

Jisuanji Yanjiu yu Fazhan/Computer Research and Development

Volumn 44, Issue 7, 2007, Pages 1184-1190

  Wang, Liming ^a   Zhang, Zhuo ^a  

^a ZHENGZHOU UNIVERSITY   (China)

Author keywords

Closed frequent itemset; Distributed data mining; Formal concept analysis; Iceberg concept lattice; Merge

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; UNSUPERVISED LEARNING;

APRIORI ALGORITHM; CLOSED FREQUENT ITEMSET; DISTRIBUTED DATA MINING; FORMAL CONCEPT ANALYSIS; ICEBERG CONCEPT LATTICE; ICEGALAMERA;

DATA MINING;

EID: 34548625844     PISSN: 10001239     EISSN: None     Source Type: Journal    
DOI: 10.1360/crad20070713     Document Type: Article

References (14)

1. B Ganter, R Wille. Formal Concept Analysis: Mathematical Foundations[M]. Berlin: Springer-Verlag, 1999.
2. G Stumme, R Taouil, Y Bastide, et al. Computing iceberg concept lattices with titanic[J]. Journal on Knowledge and Data Engineering, 2002, 42(2): 189-222.
3. G Stumme. Efficient data mining based on formal concept analysis[G]. In: Proc of the Database and Expert Systems Applications, Lecture Notes in Computer Science 2453. Berlin: Springer-Verlag, 2002. 534-546.
4. Pang-Ning Tan, Michael Steinbach, Vipin Kumar. Introduction to Data Mining[M]. Beijing: Post and Telecom Press, 2006.
5. Jiawei Han, Micheline Kamber. Data Mining Concepts and Techniques[M]. San Francisco: Morgan Kaufmann, 2000.
6. Wang Liming, Zhao Hui. Algorithm of mining global maximum frequent itemsets based on FP-tree[J]. Journal of Computer Research and Development, 2007, 44(3): 445-451 (in Chinese).
7. Petko Valtchev, Rokia Missaoui, Pierre Lebrun. A partion-based approach towards constructing Galois (concept) lattices[J]. Discrete Mathematics, 2002, 256(3): 801-829.
8. P Valtchev, R Missaoui. Building concept (Galois) lattices from parts: Generalizing the incremental methods[G]. In: H Delugach, G Stumme, eds. Proc of the ICCS'01, Lecture Notes in Computer Science 2120. Berlin: Springer-Verlag, 2001. 290-303.
9. R Godin, R Missaoui, H Alaoui. Incremental concept formation algorithms based on Galois (concept) lattices[J]. Computational Intelligence, 1995, 11(2): 246-267.
10. M H Rouane, K Nehme, P Valtchev, et al. On-line maintenance of iceberg concept lattices[C]. In: Contributions to the 12th ICCS. Huntsville(AL): Shaker-Verlag, 2004.
11. Kamal Nehme, Petko Valtchev, Mohamed Rouane Hacene, et al. On computing the minimal generator family for concept lattices and icebergs[G]. In: Proc of the 3rd Int'l Conf on Formal Concept Analysis, LNCS 3403. Berlin: Springer-Verlag, 2005. 192-207.
12. P Valtchev, R Missaoui, R Godin, et al. Generating frequent itemsets incrementally: Two novel approaches based on Galois lattice theory[J]. Journal of Experimental and Theoretical Artificial Intelligence, 2002, 14(2-3): 115-142.
13. Li Yun, Liu Zongtian, et al. Research on the distributed treatment of concept lattices[J]. Mini-Micro Systems, 2005, 26(3): 448-451 (in Chinese).
14. Li Yun, Liu Zongtian, et al. Horizonal union algorithm of multiple concept lattices[J]. Acta Electronica Sinica, 2004, 32(11): 1849-1854 (in Chinese).