메뉴 건너뛰기




Volumn , Issue , 2004, Pages 1721-1724

Clustering concept hierarchies from text

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; INFORMATION ANALYSIS; TAXONOMIES;

EID: 84899185925     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (30)

References (21)
  • 6
    • 0002546287 scopus 로고
    • Efficient algorithms for agglomerative hierarchical clustering methods
    • W. Day and H. Edelsbrunner. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification, 1(7).
    • (1984) Journal of Classification , vol.1 , pp. 7
    • Day, W.1    Edelsbrunner, H.2
  • 15
    • 9444255329 scopus 로고    scopus 로고
    • A set-theoretical approach for the induction of inheritance hierarchies
    • Wiebke Petersen. 2002. A set-theoretical approach for the induction of inheritance hierarchies. Electronic Notes in Theoretical Computer Science, 51.
    • (2002) Electronic Notes in Theoretical Computer Science , vol.51
    • Petersen, W.1
  • 16
    • 38049120755 scopus 로고    scopus 로고
    • Linguistic applications of formal concept analysis
    • In G. Stumme and R. Wille, editors, Springer
    • Uta Priss. 2004. Linguistic applications of formal concept analysis. In G. Stumme and R. Wille, editors, Formal Concept Analysis - State of the Art. Springer.
    • (2004) Formal Concept Analysis - State of the Art
    • Priss, U.1


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