Reduction-based approaches towards constructing galois (concept) lattices

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

Volumn 4062 LNAI, Issue , 2006, Pages 107-113

  Jin, Jingyu ^a,b   Qin, Keyun ^a   Pei, Zheng ^c  

^a SOUTHWEST JIAOTONG UNIVERSITY   (China)

^b CHONGQING TECHNOLOGY AND BUSINESS UNIVERSITY   (China)

^c XIHUA UNIVERSITY   (China)

Author keywords

Attribute reduction; CL Axiom; Galois (concept) lattices

Indexed keywords

ALGORITHMS; DATA REDUCTION; KNOWLEDGE ACQUISITION; PROBLEM SOLVING; ROUGH SET THEORY;

ATTRIBUTE REDUCTION; CL-AXIOM; FORMAL CONCEPT; GALOIS (CONCEPT) LATTICES;

ARTIFICIAL INTELLIGENCE;

EID: 33746722676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11795131_16     Document Type: Conference Paper

References (13)

1. Birkhoff, B. (Ed.): Lattice Theory. American Mathematical Society Colloquium Publ., Providence, RI (1973)
2. Wille, R.: Restructuring the lattice theory: an approach based on hierarchies of concepts. In: Rival, I., Ed., Ordered Sets. Reidel, Dordrecht, Boston (1982) 445-470
3. Wille, R.: Lattices in data analysis: how to draw them with a computer. In: Wille, R., et al., Eds., Algorithms and order. Kluwer Acad. Publ., Dordrecht (1989) 33-58
4. Wille, R.: Concepe lattices and conceptual knowledge systems. Comput. Math. Apll. 23(6-9) (1992) 493-515
5. Zhang, W. X., Wei, L., Qi, J. J.: Attribute Reduction in Concept Lattice Based on Discernibility Matrix. In: Proceedings of the Tenth International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Canada (2005) 157-165
6. th International Conference on Rough Sets and Current Trends in Computing, Uppsala, Sweden (2004) 59-68
7. Ganter, B. (Ed.): Two basic algorithms in concept analysis. Technische Hochschule, Darmstadt (1984)
8. Ganter, B., Wille, R. (Eds.): Formal Concept Analysis. Mathematical Foundations. Springer, Berlin (1999)
9. Norris, E. M.: An algorithm for computing the maximal rectangles in a binary relation. Rev. Roumaine Math. Pures Appl. 23(2) (1978) 243-250
10. Bordat, J. P.: Calcul pratique du treillis de Galois d'une correspondance. Mat. Sci. Hum. 96 (1986) 31-47
11. Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence. 11(2) (1995) 246-267
12. Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Inform. Process. Lett. 71 (1999) 199-204
13. Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards constructing Galois (concept) lattices. Discrete Mathematics. 256 (2002) 801-829