메뉴 건너뛰기




Volumn 4706 LNCS, Issue PART 2, 2007, Pages 434-447

New fast algorithm for constructing concept lattice

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING;

EID: 38049112438     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74477-1_41     Document Type: Conference Paper
Times cited : (8)

References (20)
  • 1
    • 0016572913 scopus 로고
    • A Vector Space Model for Automatic Indexing
    • Salton, G., Wong, A., Yang, C.S.: A Vector Space Model for Automatic Indexing. Communication of the ACM. 18(11), 613-620 (1975)
    • (1975) Communication of the ACM , vol.18 , Issue.11 , pp. 613-620
    • Salton, G.1    Wong, A.2    Yang, C.S.3
  • 3
    • 0000398336 scopus 로고
    • Restructuring the Lattice Theory: An Approach Based on Hierarchies of Concepts
    • Rival, I, ed, Reidel, Dordrecht Boston
    • Wille, R.: Restructuring the Lattice Theory: an Approach Based on Hierarchies of Concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445-470. Reidel, Dordrecht Boston (1982)
    • (1982) Ordered Sets , pp. 445-470
    • Wille, R.1
  • 4
    • 0002871914 scopus 로고
    • Calcul Pratique Du Treillis De Galois Dune Correspondance
    • Bordat, J.P.: Calcul Pratique Du Treillis De Galois Dune Correspondance. Math. Sci. Hum. 96, 31-47 (1986)
    • (1986) Math. Sci. Hum , vol.96 , pp. 31-47
    • Bordat, J.P.1
  • 5
    • 0012110977 scopus 로고
    • A Fast Algorithm for Computing All Intersections of Objects in a Finite Semi-Lattice. Automatic Documentation and Mathematical
    • Kuznetsov, S.O.: A Fast Algorithm for Computing All Intersections of Objects in a Finite Semi-Lattice. Automatic Documentation and Mathematical Linguistics 27(5), 11-21 (1993)
    • (1993) Linguistics , vol.27 , Issue.5 , pp. 11-21
    • Kuznetsov, S.O.1
  • 8
    • 0345477141 scopus 로고
    • Search for Concepts and Dependencies in Databases
    • Ziarko, W.P, ed, Springer, London
    • Missaoui, R., Godin, R.: Search for Concepts and Dependencies in Databases. In: Ziarko, W.P. (ed.) Rough Sets and Fuzzy Sets and Knowlwdge Discovery, pp. 16-23. Springer, London (1994)
    • (1994) Rough Sets and Fuzzy Sets and Knowlwdge Discovery , pp. 16-23
    • Missaoui, R.1    Godin, R.2
  • 9
    • 0034335004 scopus 로고    scopus 로고
    • An Integrated Mining Approach for Classification and Association Rule Based on Concept Lattice
    • Hu, K.Y., Lu, Y.C., Shi, C.Y.: An Integrated Mining Approach for Classification and Association Rule Based on Concept Lattice. Journal of Software 11(11), 1479-1484 (2000)
    • (2000) Journal of Software , vol.11 , Issue.11 , pp. 1479-1484
    • Hu, K.Y.1    Lu, Y.C.2    Shi, C.Y.3
  • 10
    • 26944444819 scopus 로고    scopus 로고
    • Conceptual Clustering with Iceberg Concept Lattices
    • Schroder, R, Klinkenberg, S, Rping, A, Fick, N, Henze, C, Herzog, R, Molitor, O, eds, University Dortmund, Oktober
    • Stumme, G., Taouil, R., Bastide, Y., Lakhal, L.: Conceptual Clustering with Iceberg Concept Lattices. In: Schroder, R., Klinkenberg, S., Rping, A., Fick, N., Henze, C., Herzog, R., Molitor, O. (eds.) Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01), University Dortmund 763 (Oktober 2001)
    • (2001) Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01) , pp. 763
    • Stumme, G.1    Taouil, R.2    Bastide, Y.3    Lakhal, L.4
  • 12
    • 23944465512 scopus 로고    scopus 로고
    • Fast Access to Concepts in Concept Lattices via Bidirectional Associative Memories
    • Rajapakse, R.K., Denham, M.: Fast Access to Concepts in Concept Lattices via Bidirectional Associative Memories. Journal of Neural Computation. 17, 2291-2300 (2005)
    • (2005) Journal of Neural Computation , vol.17 , pp. 2291-2300
    • Rajapakse, R.K.1    Denham, M.2
  • 15
    • 0002719691 scopus 로고
    • Algorithm De Recherche Des Sous-Matrices Premiresdune Matrice
    • Chein, M.: Algorithm De Recherche Des Sous-Matrices Premiresdune Matrice. Bull. Math. Soc. Sci. Math. R. S. Roumanie 13, 21-25 (1969)
    • (1969) Bull. Math. Soc. Sci. Math. R. S. Roumanie , vol.13 , pp. 21-25
    • Chein, M.1
  • 16
    • 0001369117 scopus 로고
    • An Algorithm for Computing the Maximal Rectangles in a Binary Relation
    • Norris, E.M.: An Algorithm for Computing the Maximal Rectangles in a Binary Relation. Revue Roumaine de Mathematiques Pures et Appliques 23(2), 243-250 (1978)
    • (1978) Revue Roumaine de Mathematiques Pures et Appliques , vol.23 , Issue.2 , pp. 243-250
    • Norris, E.M.1
  • 17
    • 4644256188 scopus 로고    scopus 로고
    • University of California, Department of Information and Computer Science, Irvine, CA
    • Hettich, S., Bay, S.D.: The UCIKDD Archive. University of California, Department of Information and Computer Science, Irvine, CA (1999), http://kdd.ics.uci.edu
    • (1999) The UCIKDD Archive
    • Hettich, S.1    Bay, S.D.2
  • 18
    • 0002063064 scopus 로고    scopus 로고
    • Godin, R., Missaoui, R., April, A.: Experimental Comparison of Navigation in a Galois Lattice with Conventional Information Retrieval Methods. Int. J. ManMachine Studies 38, 747-767
    • Godin, R., Missaoui, R., April, A.: Experimental Comparison of Navigation in a Galois Lattice with Conventional Information Retrieval Methods. Int. J. ManMachine Studies 38, 747-767
  • 20
    • 0011642506 scopus 로고    scopus 로고
    • Concept Lattice and Association Rule Discovery
    • Xie, Z.P., Liu, Z.T.: Concept Lattice and Association Rule Discovery. Journal of Computer Research Development 37(12), 1415-1421 (2000)
    • (2000) Journal of Computer Research Development , vol.37 , Issue.12 , pp. 1415-1421
    • Xie, Z.P.1    Liu, Z.T.2


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