메뉴 건너뛰기




Volumn 4654 LNCS, Issue , 2007, Pages 231-240

MOSAIC: A proximity graph approach for agglomerative clustering

Author keywords

Agglomerative clustering; Finding clusters of arbitrary shape; Hybrid clustering; Post processing; Using proximity graphs for clustering

Indexed keywords

CLUSTERING ALGORITHMS; DATA STRUCTURES; FUNCTION EVALUATION;

EID: 38049072164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74553-2_21     Document Type: Conference Paper
Times cited : (19)

References (22)
  • 1
    • 55349104264 scopus 로고    scopus 로고
    • Spatial Clustering for Mining Knowledge in Support of Generalization Processes in GIS
    • Jiang, B.: Spatial Clustering for Mining Knowledge in Support of Generalization Processes in GIS. In: ICA Workshop on Generalisation and Multiple representation (2004)
    • (2004) ICA Workshop on Generalisation and Multiple representation
    • Jiang, B.1
  • 4
    • 84963085136 scopus 로고
    • A New Statistical Approach to Geographic Variation Analysis
    • Gabriel, K., Sokal, R.: A New Statistical Approach to Geographic Variation Analysis. Systematic Zoology 18, 259-278 (1969)
    • (1969) Systematic Zoology , vol.18 , pp. 259-278
    • Gabriel, K.1    Sokal, R.2
  • 5
    • 0019213414 scopus 로고
    • The Relative Neighborhood Graph of A Finite Planar Set
    • Toussaint, G.: The Relative Neighborhood Graph of A Finite Planar Set. In: Int. Conf. Pattern Recognition, vol. 12, pp. 261-268 (1980)
    • (1980) Int. Conf. Pattern Recognition , vol.12 , pp. 261-268
    • Toussaint, G.1
  • 6
    • 0006938345 scopus 로고
    • A note on Delaunay and Optimal Triangulations
    • Kirkpatrick, D.: A note on Delaunay and Optimal Triangulations. Information Processing Letters 10, 127-128 (1980)
    • (1980) Information Processing Letters , vol.10 , pp. 127-128
    • Kirkpatrick, D.1
  • 8
    • 38049055317 scopus 로고    scopus 로고
    • Bhattacharya, B., Poulsen, R., Toussaint, G.: Application of Proximity Graphs to Editing Nearest Neighbor Decision Rule. In: Int. Sym. on Information Theory (1981)
    • Bhattacharya, B., Poulsen, R., Toussaint, G.: Application of Proximity Graphs to Editing Nearest Neighbor Decision Rule. In: Int. Sym. on Information Theory (1981)
  • 9
    • 38049010003 scopus 로고    scopus 로고
    • Asano, T., Imai, H., Ibaraki, T., Nishizeki, T.: SIGAL 1990. LNCS, 450, pp. 70-71. Springer, Heidelberg (1990)
    • Asano, T., Imai, H., Ibaraki, T., Nishizeki, T.: SIGAL 1990. LNCS, vol. 450, pp. 70-71. Springer, Heidelberg (1990)
  • 11
    • 38049051329 scopus 로고    scopus 로고
    • Data Mining and Machine Learning Group website, University of Houston
    • Data Mining and Machine Learning Group website, University of Houston, Texas, http://www.tlc2.uh.edu/dmmlg/Datasets
    • Texas
  • 17
    • 85140527321 scopus 로고    scopus 로고
    • An Efficient Approach to Clustering in Large Multimedia Databases with Noise
    • Hinneburg, A., Keim, D.: An Efficient Approach to Clustering in Large Multimedia Databases with Noise. In: Conf. Knowledge Discovery in Data Mining (1998)
    • (1998) Conf. Knowledge Discovery in Data Mining
    • Hinneburg, A.1    Keim, D.2
  • 18
    • 0032091595 scopus 로고    scopus 로고
    • CURE: An Efficient Clustering Algorithm for Large Databases
    • ACM Press, New York
    • Guha, S., Rastogi, R., Shim, K.: CURE: An Efficient Clustering Algorithm for Large Databases. In: Int. Conf. ACM SIGMOD on Management of data, pp. 73-84. ACM Press, New York (1998)
    • (1998) Int. Conf. ACM SIGMOD on Management of data , pp. 73-84
    • Guha, S.1    Rastogi, R.2    Shim, K.3
  • 19
    • 0032686723 scopus 로고    scopus 로고
    • CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling
    • Karypis, G., Han, E.H., Kumar, V.: CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling. IEEE Computer 32, 68-75 (1999)
    • (1999) IEEE Computer , vol.32 , pp. 68-75
    • Karypis, G.1    Han, E.H.2    Kumar, V.3
  • 20
    • 0242540424 scopus 로고    scopus 로고
    • A Robust and Efficient Clustering Algorithm based on Cohesion Self-Merging
    • ACM Press, New York
    • Lin, C., Chen, M.: A Robust and Efficient Clustering Algorithm based on Cohesion Self-Merging. In: Inf. Conf. 8th ACM SIGKDD on Knowledge Discovery and Data Mining, pp. 582-587. ACM Press, New York (2002)
    • (2002) Inf. Conf. 8th ACM SIGKDD on Knowledge Discovery and Data Mining , pp. 582-587
    • Lin, C.1    Chen, M.2
  • 21
    • 2142687208 scopus 로고    scopus 로고
    • A Unified Framework for Model-based Clustering
    • Zhong, S., Ghosh, J.: A Unified Framework for Model-based Clustering. Int. J. Machine Learning Research 4, 1001-1037 (2003)
    • (2003) Int. J. Machine Learning Research , vol.4 , pp. 1001-1037
    • Zhong, S.1    Ghosh, J.2


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