메뉴 건너뛰기




Volumn 32, Issue 8, 1999, Pages 68-75

Chameleon: Hierarchical clustering using dynamic modeling

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY;

EID: 0032686723     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/2.781637     Document Type: Article
Times cited : (1812)

References (11)
  • 3
    • 0033315817 scopus 로고    scopus 로고
    • Document categorization and query generation on the World Wide Web using WebACE
    • to be published
    • D. Boley et al., "Document Categorization and Query Generation on the World Wide Web Using WebACE," to be published in AI Review, 1999.
    • (1999) AI Review
    • Boley, D.1
  • 4
    • 0002252929 scopus 로고    scopus 로고
    • Hypergraph-based clustering in high-dimensional data sets: A summary of results
    • Also a longer version available as Tech. Report TR-97-019, Dept. of Computer Science, Univ. of Minnesota, 1997
    • E.H. Han et al., "Hypergraph-Based Clustering in High-Dimensional Data Sets: A Summary of Results," Bull. Tech. Committee on Data Eng., Vol. 21, No. 1,1998, pp. 15-22. Also a longer version available as Tech. Report TR-97-019, Dept. of Computer Science, Univ. of Minnesota, 1997.
    • (1998) Bull. Tech. Committee on Data Eng. , vol.21 , Issue.1 , pp. 15-22
    • Han, E.H.1
  • 5
    • 0032665257 scopus 로고    scopus 로고
    • Clustering large datasets in arbitrary metric spaces
    • IEEE CS Press, Los Alamitos, Calif.
    • V. Ganti et al., "Clustering Large Datasets in Arbitrary Metric Spaces," Proc. 15th Int'l Conf. Data Eng., IEEE CS Press, Los Alamitos, Calif., 1999, pp. 502-511.
    • (1999) Proc. 15th Int'l Conf. Data Eng. , pp. 502-511
    • Ganti, V.1
  • 6
    • 0003136237 scopus 로고
    • Efficient and effective clustering method for spatial data mining
    • Morgan Kaufmann, San Francisco
    • R. Ng and J. Han, "Efficient and Effective Clustering Method for Spatial Data Mining," Proc. 20th Int'l Conf. Very Large Data Bases, Morgan Kaufmann, San Francisco, 1994, pp. 144-155.
    • (1994) Proc. 20th Int'l Conf. Very Large Data Bases , pp. 144-155
    • Ng, R.1    Han, J.2
  • 7
    • 0000550189 scopus 로고    scopus 로고
    • A density-based algorithm for discovering clusters in large spatial databases with noise
    • AAAI Press, Menlo Park, Calif.
    • M. Ester et al., "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise," Proc. 2nd Int'l Conf. Knowledge Discovery and Data Mining, AAAI Press, Menlo Park, Calif., 1996, pp. 226-231.
    • (1996) Proc. 2nd Int'l Conf. Knowledge Discovery and Data Mining , pp. 226-231
    • Ester, M.1
  • 8
    • 0032652570 scopus 로고    scopus 로고
    • ROCK: A robust clustering algorithm for categorical attributes
    • IEEE CS Press, Los Alamitos, Calif.
    • S. Guha, R. Rastogi, and K. Shim, "ROCK: A Robust Clustering Algorithm for Categorical Attributes," Proc. 15th Int'l Conf. Data Eng., IEEE CS Press, Los Alamitos, Calif., 1999, pp. 512-521.
    • (1999) Proc. 15th Int'l Conf. Data Eng. , pp. 512-521
    • Guha, S.1    Rastogi, R.2    Shim, K.3
  • 10
  • 11
    • 0018183618 scopus 로고
    • Agglomerative clustering using the concept of mutual nearest neighborhood
    • Feb.
    • K.C. Gowda and G. Krishna, "Agglomerative Clustering Using the Concept of Mutual Nearest Neighborhood," Pattern Recognition, Feb. 1978, pp. 105-112.
    • (1978) Pattern Recognition , pp. 105-112
    • Gowda, K.C.1    Krishna, G.2


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