메뉴 건너뛰기




Volumn , Issue , 2002, Pages 179-186

A parameterless method for efficiently discovering clusters of arbitrary shape in large datasets

Author keywords

[No Author keywords available]

Indexed keywords


EID: 78149337520     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (38)

References (13)
  • 7
    • 0032686723 scopus 로고    scopus 로고
    • CHAMELEON: A hierarchical clustering algorithm using dynamic modeling
    • August
    • G. Karypis, E.-H. Han. and V. Kumar. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling. IEEE Computer, 32(8):68-75, August 1999.
    • (1999) IEEE Computer , vol.32 , Issue.8 , pp. 68-75
    • Karypis, G.1    Han, E.-H.2    Kumar, V.3
  • 11
    • 0032091595 scopus 로고    scopus 로고
    • CURE: An efficient clustering algorithm for large databases
    • Seattle, Washington
    • K. S. S. Guha, R. Rastogi. CURE: An efficient clustering algorithm for large databases. In SIGMOD'98, Seattle, Washington, 1998.
    • (1998) SIGMOD'98
    • Guha, K.S.S.1    Rastogi, R.2


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