메뉴 건너뛰기




Volumn , Issue , 2007, Pages 429-432

Hierarchical clustering algorithm based on granularity

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CLUSTER ANALYSIS; COMPUTATIONAL COMPLEXITY; FLOW OF SOLIDS; GRANULATION;

EID: 46749084292     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GRC.2007.4403136     Document Type: Conference Paper
Times cited : (3)

References (7)
  • 2
    • 0030157145 scopus 로고    scopus 로고
    • An efficient data clustering method for very large databases
    • T. Zhang, R. Ramakrishnan, M. Livny. An efficient data clustering method for very large databases. Magement of data, 1996, 103-114
    • (1996) Magement of data , pp. 103-114
    • Zhang, T.1    Ramakrishnan, R.2    Livny, M.3
  • 3
    • 0035279319 scopus 로고    scopus 로고
    • CURE: An efficient clustering algorithm for large database
    • R. Rastogi,S. Guha, K. Shim. CURE: an efficient clustering algorithm for large database. Information Systems, 2001, 26(1): 35-58
    • (2001) Information Systems , vol.26 , Issue.1 , pp. 35-58
    • Rastogi, R.1    Guha, S.2    Shim, K.3
  • 4
    • 0032652570 scopus 로고    scopus 로고
    • A robust clustering algorithm for categorical attributes
    • S. Guha, R. Rastogi, K. Shim. A robust clustering algorithm for categorical attributes. Data Engineerin, 1999, 512-521
    • (1999) Data Engineerin , pp. 512-521
    • Guha, S.1    Rastogi, R.2    Shim, K.3
  • 5
    • 0032686723 scopus 로고    scopus 로고
    • G. Karypis, E. H. Han, V. Kumar. A hierarchical clustering algorithm using dynamic modeling. COMPUTER, 1999, 32(8): 68-75
    • G. Karypis, E. H. Han, V. Kumar. A hierarchical clustering algorithm using dynamic modeling. COMPUTER, 1999, 32(8): 68-75


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