Introduction concept lattice-based theory, methods and tools for knowledge discovery in databases: applications

Applied Artificial Intelligence

Volumn 17, Issue 3, 2003, Pages 177-180

  Nguifo, Engelbert Mephu ^a   Duquenne, Vincent ^b   Liquie’re, Michel ^c  

^a UNIVERSITÉ D'ARTOIS   (France)

^b CNRS   (France)

^c LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATABASE SYSTEMS; INDUSTRIAL APPLICATIONS; KNOWLEDGE ENGINEERING; LEARNING SYSTEMS; TECHNICAL PRESENTATIONS;

CONCEPT LATTICE BASED THEORY; GALOIS LATTICES; KNOWLEDGE DISCOVERY;

ARTIFICIAL INTELLIGENCE;

EID: 0242666905     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/713827117     Document Type: Article

References (17)

1. Barbut, M. 1965. Note sur I'algèbre des techniques d'analyse hiérarchique. In L'analyse hiérarchique. ed. B. Matalon. Paris: Gauthier-Villars.
2. Barbut, M., and B. Monjardet. 1970. Ordre et classification, Algèbre et Combinatoire, 2 tomes. Paris: Hachette.
3. Birkhoff, G. 1940. Lattice Theory, 1st edition. Providence, RI: Amer. Math. Soc.
4. Birkhoff, G. 1967. Lattice Theory, 2nd edition. Providence, RI: Amer. Math. Soc.
5. Carpineto, C., and G. Romano. 1996. A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning 24:95-122.
6. Day, A. 1992. The lattice theory of functional dependencies and normal decompositions. Intl. J. of Algebra and Computation 2(4):409-431.
7. Fayyad, U.M., G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors. 1996. Advances in Knowledge Discovery & Data Mining. Cambridge, MA: AAAI/The MIT Press.
8. Ganter, B. 1987. Algorithmen zur formalen begriffsanalyse. In Beitrage zur Begriffsanalyse, eds. B. Ganter, R. Wille, and K.E. Wolff, 241-254. Wissenchaftverlag: Mannheim.
9. Ganter, B., and R. Wille. 1999. Formal Concept Analysis, Mathematical Foundations. Berlin: Springer-Verlag.
10. Guigues, J.L., and V. Duquenne. 1986. Familles minimales d'implications informatives résultant d'un tableau de données binaires. Math. Sci. Humaines 95:5-18.
11. Mephu Nguifo, E., V. Duquenne, and M. Liquiè re. 2001. Proceedings of ICCS'01 Workshop on Concept Lattices for Knowledge Discovery in Databases, Stanford University, July 30, 2001.
12. Mephu Nguifo, E., V. Duquenne, and M. Liquière. 2002. Special Issue of Journal of Experimental and Theoretical Artificial Intelligence (JETAI) on Concept Lattices for Knowledge Discovery in Databases: Algorithms and Methods. Philadelphia, PA: Taylor & Francis Ltd., to appear.
13. Mephu Nguifo, E., and P. Njiwoua. 2001. IGLUE: A lattice-based constructive induction system. Intelligent Data Analysis (IDA) 5(1):73-91.
14. Pasquier, N., Y. Bastide, R. Taouil, and L. Lakhal. 1999. Discovering frequent closed itemsets for association rules. In Proc. of 7th Intl. Conf. on Database Theory (ICDT) 398-416, Jerusalem, Israel, January, 1999.
15. Riguet, J. 1983. Personal and public communications at several workshops and conferences.
16. Wille, R. 1982. Restructuring lattice theory: An approach based on hierarchies of concepts. In ed. Ivan Rival, 445-470. Dordrecht-Boston: Reidel.
17. Wille, R. 2001. Why can concept lattices support knowledge discovery in databases. In ICCS Workshop on CLKDD, eds. Mephu Nguifo et al., 7-20, Stanford University, 2001.