메뉴 건너뛰기




Volumn 3596 LNAI, Issue , 2005, Pages 181-194

Merge-based computation of minimal generators

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATABASE SYSTEMS; FORMAL LOGIC;

EID: 26944435139     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11524564_12     Document Type: Conference Paper
Times cited : (5)

References (19)
  • 5
    • 0029306863 scopus 로고
    • Incremental concept formation algorithms based on galois (concept) lattices
    • R. Godin, R. Missaoui, and H. Alaoui. Incremental Concept Formation Algorithms Based on Galois (Concept) Lattices. Computational Intelligence, 11(2):246-267, 1995.
    • (1995) Computational Intelligence , vol.11 , Issue.2 , pp. 246-267
    • Godin, R.1    Missaoui, R.2    Alaoui, H.3
  • 6
    • 0002819235 scopus 로고
    • Families minimales d'implications informatives résultant d'un tableau de données binaires
    • J.L. Guigues and V. Duquenne. Families minimales d'implications informatives résultant d'un tableau de données binaires. Mathématiques et Sciences Humaines, 95:5-18, 1986.
    • (1986) Mathématiques et Sciences Humaines , vol.95 , pp. 5-18
    • Guigues, J.L.1    Duquenne, V.2
  • 8
    • 84945313149 scopus 로고    scopus 로고
    • Concise representation of frequent patterns based on generalized disjunction-free generators
    • Marzena Kryszkiewicz and Marcin Gajek. Concise representation of frequent patterns based on generalized disjunction-free generators. In PAKDD, pages 159-171, 2002.
    • (2002) PAKDD , pp. 159-171
    • Kryszkiewicz, M.1    Gajek, M.2
  • 10
    • 0000300428 scopus 로고
    • On the complexity of inferring functional dependencies
    • H. Mannila and K.-J. Räihä. On the complexity of inferring functional dependencies. Discrete Applied Mathematics, 40(2):237-243, 1992.
    • (1992) Discrete Applied Mathematics , vol.40 , Issue.2 , pp. 237-243
    • Mannila, H.1    Räihä, K.-J.2
  • 15
    • 7044239762 scopus 로고    scopus 로고
    • A generic scheme for the design of efficient on-line algorithms for lattices
    • B. Ganter A. de Moor, W. Lex, editor, Proceedings of the 11th Intl. Conference on Conceptual Structures (ICCS'03), Berlin (DE). Springer-Verlag
    • P. Valtchev, M. Rouane Hacene, and R. Missaoui. A generic scheme for the design of efficient on-line algorithms for lattices. In B. Ganter A. de Moor, W. Lex, editor, Proceedings of the 11th Intl. Conference on Conceptual Structures (ICCS'03), volume 2746 of Lecture Notes in Computer Science, pages 282-295, Berlin (DE), 2003. Springer-Verlag.
    • (2003) Lecture Notes in Computer Science , vol.2746 , pp. 282-295
    • Valtchev, P.1    Hacene, M.R.2    Missaoui, R.3
  • 16
    • 84974711985 scopus 로고    scopus 로고
    • Building concept (Galois) lattices from parts: Generalizing the incremental methods
    • H. Delugach and G. Stumme, editors, Proceedings of the ICCS'01
    • P. Valtchev and R. Missaoui. Building concept (Galois) lattices from parts: generalizing the incremental methods. In H. Delugach and G. Stumme, editors, Proceedings of the ICCS'01, volume 2120 of Lecture Notes in Computer Science, pages 290-303, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2120 , pp. 290-303
    • Valtchev, P.1    Missaoui, R.2
  • 17
    • 9444248155 scopus 로고    scopus 로고
    • Formal concept analysis for knowledge discovery and data mining: The new challenges
    • P. Eklund, editor, Concept Lattices: Proceedings of the 2nd Int. Conf. on Formal Concept Analysis (FCA'04). Springer-Verlag
    • P. Valtchev, R. Missaoui, and R. Godin. Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges. In P. Eklund, editor, Concept Lattices: Proceedings of the 2nd Int. Conf. on Formal Concept Analysis (FCA'04), volume 2961 of Lecture Notes in Computer Science, pages 352-371. Springer-Verlag, 2004.
    • (2004) Lecture Notes in Computer Science , vol.2961 , pp. 352-371
    • Valtchev, P.1    Missaoui, R.2    Godin, R.3
  • 18
    • 0012190941 scopus 로고    scopus 로고
    • A partition-based approach towards building Galois (concept) lattices
    • P. Valtchev, R. Missaoui, and P. Lebrun. A partition-based approach towards building Galois (concept) lattices. Discrete Mathematics, 256(3):801-829, 2002.
    • (2002) Discrete Mathematics , vol.256 , Issue.3 , pp. 801-829
    • Valtchev, P.1    Missaoui, R.2    Lebrun, P.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.