메뉴 건너뛰기




Volumn , Issue , 2010, Pages 417-420

Comparing and analyzing the computational complexity of FCA algorithms

Author keywords

algorithm; computational complexity; formal concept analysis; implementation

Indexed keywords

ALGORITHMIZATION; COMPARATIVE ANALYSIS; COMPARATIVE ANALYSIS OF ALGORITHMS; EFFICIENT IMPLEMENTATION; FORMAL CONCEPT ANALYSES (FCA); FORMAL CONTEXTS; IMPLEMENTATION; INTEGRATED RESEARCH;

EID: 84885228226     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1899503.1899557     Document Type: Conference Paper
Times cited : (11)

References (11)
  • 3
    • 0036555973 scopus 로고    scopus 로고
    • Comparing performance of algorithms for generating concept lattices
    • Kuznetsov, S. O., Obiedkov, S.A. Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell. 14(2-3): (2002).
    • (2002) J. Exp. Theor. Artif. Intell. , vol.14 , Issue.2-3
    • Kuznetsov, S.O.1    Obiedkov, S.A.2
  • 8
    • 78649934709 scopus 로고    scopus 로고
    • Irvine, CA: University of California, School of Information and Computer Science
    • Frank, A. & Asuncion, A. (2010). UCI Machine Learning Repository (http://archive.ics.uci.edu/ml). Irvine, CA: University of California, School of Information and Computer Science.
    • (2010) UCI Machine Learning Repository
    • Frank, A.1    Asuncion, A.2
  • 11
    • 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 Mathématiques Pures et Appliquées 23 (2) (1978), pp. 243-250.
    • (1978) Revue Roumaine de Mathématiques Pures et Appliquées , vol.23 , Issue.2 , pp. 243-250
    • Norris, E.M.1


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