메뉴 건너뛰기




Volumn 181, Issue 4, 2011, Pages 732-746

Data clustering by minimizing disconnectivity

Author keywords

Heuristic approach; K Nearest neighbors; Partitional clustering

Indexed keywords

ARBITRARY SHAPE; COMPLEX SHAPES; DATA CLUSTERING; DISCONNECTIVITY; HEURISTIC APPROACH; K-NEAREST NEIGHBORS; NEAREST NEIGHBORS; NUMERICAL RESULTS; PARTITIONAL CLUSTERING;

EID: 78649819757     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2010.10.028     Document Type: Article
Times cited : (35)

References (43)
  • 2
    • 0347172110 scopus 로고    scopus 로고
    • OPTICS: Ordering points to identify the clustering structure
    • M. Ankerst, M. Breunig, H.-P. Kriegel, and J. Sander OPTICS: ordering points to identify the clustering structure SIGMOD Record 28 1999 49 60
    • (1999) SIGMOD Record , vol.28 , pp. 49-60
    • Ankerst, M.1    Breunig, M.2    Kriegel, H.-P.3    Sander, J.4
  • 3
    • 36948999941 scopus 로고    scopus 로고
    • University of California, School of Information and Computer Science, Irvine, CA
    • A. Asuncion, D.J. Newman, UCI Machine Learning Repository, University of California, School of Information and Computer Science, Irvine, CA, 2007. .
    • (2007) UCI Machine Learning Repository
    • Asuncion, A.1    Newman, D.J.2
  • 4
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • J.L. Bentley Multidimensional binary search trees used for associative searching Communications of the ACM 18 1975 509 517
    • (1975) Communications of the ACM , vol.18 , pp. 509-517
    • Bentley, J.L.1
  • 5
    • 33846024749 scopus 로고    scopus 로고
    • ST-DBSCAN: An algorithm for clustering spatial-temporal data
    • D. Birant, and A. Kut ST-DBSCAN: an algorithm for clustering spatial-temporal data Data and Knowledge Engineering 60 2007 208 221
    • (2007) Data and Knowledge Engineering , vol.60 , pp. 208-221
    • Birant, D.1    Kut, A.2
  • 7
  • 10
    • 2442514312 scopus 로고    scopus 로고
    • K-Nearest-Neighbor consistency in data clustering: Incorporating local information into global optimization
    • C. Ding, X. He, K-Nearest-Neighbor consistency in data clustering: incorporating local information into global optimization, in: Proceedings of the 2004 ACM Symposium on Applied Computing, 2004, pp. 584-589.
    • (2004) Proceedings of the 2004 ACM Symposium on Applied Computing , pp. 584-589
    • Ding, C.1    He, X.2
  • 12
    • 0012834533 scopus 로고    scopus 로고
    • Why so many clustering algorithms - A position paper
    • V. Estivill-Castro Why so many clustering algorithms - a position paper ACM SIGKDD Explorations 4 2002 65 75
    • (2002) ACM SIGKDD Explorations , vol.4 , pp. 65-75
    • Estivill-Castro, V.1
  • 14
    • 0346216900 scopus 로고    scopus 로고
    • A novel genetic algorithm for automatic clustering
    • G. Garai, and B.B. Chaudhuri A novel genetic algorithm for automatic clustering Pattern Recognition Letters 25 2004 173 187
    • (2004) Pattern Recognition Letters , vol.25 , pp. 173-187
    • Garai, G.1    Chaudhuri, B.B.2
  • 18
    • 79959599024 scopus 로고    scopus 로고
    • Data Clustering: 50 Years beyond K-Means
    • A.K. Jain, Data Clustering: 50 Years Beyond K-Means, Technical Report TR-CSE-09-11, 2009. Downloaded from .
    • (2009) Technical Report TR-CSE-09-11
    • Jain, A.K.1
  • 19
    • 0014129195 scopus 로고
    • Hierarchical clustering schemes
    • S.C. Johnson Hierarchical clustering schemes Psychometrika 32 1967 241 254
    • (1967) Psychometrika , vol.32 , pp. 241-254
    • Johnson, S.C.1
  • 20
    • 0032686723 scopus 로고    scopus 로고
    • CHAMELEON: A hierarchical clustering algorithm using dynamic modeling
    • G. Karypis, E.-H. Han, and V. Kumar CHAMELEON: a hierarchical clustering algorithm using dynamic modeling IEEE Computer 32 1999 68 75
    • (1999) IEEE Computer , vol.32 , pp. 68-75
    • Karypis, G.1    Han, E.-H.2    Kumar, V.3
  • 23
    • 52949106103 scopus 로고    scopus 로고
    • Clustering high dimensional data: A graph-based relaxed optimization approach
    • C.-H. Lee, O.R. Zaianea, H.-H. Park, J. Huangc, and R. Greinera Clustering high dimensional data: a graph-based relaxed optimization approach Information Sciences 178 2008 4501 4511
    • (2008) Information Sciences , vol.178 , pp. 4501-4511
    • Lee, C.-H.1    Zaianea, O.R.2    Park, H.-H.3    Huangc, J.4    Greinera, R.5
  • 24
    • 0017631930 scopus 로고
    • Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
    • D.T. Lee, and C.K. Wong Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees Acta Informatica 9 1977 23 29
    • (1977) Acta Informatica , vol.9 , pp. 23-29
    • Lee, D.T.1    Wong, C.K.2
  • 26
    • 41749090886 scopus 로고    scopus 로고
    • A tabu search approach for the minimum sum-of-squares clustering problem
    • Y. Liua, Z. Yia, H. Wua, M. Yea, and K. Chenc A tabu search approach for the minimum sum-of-squares clustering problem Information Sciences 178 2008 2680 2704
    • (2008) Information Sciences , vol.178 , pp. 2680-2704
    • Liua, Y.1    Yia, Z.2    Wua, H.3    Yea, M.4    Chenc, K.5
  • 29
    • 0033715579 scopus 로고    scopus 로고
    • Genetic algorithm-based clustering technique
    • U. Maulik, and S. Bandyopadhyay Genetic algorithm-based clustering technique Pattern Recognition 33 2000 1455 1465
    • (2000) Pattern Recognition , vol.33 , pp. 1455-1465
    • Maulik, U.1    Bandyopadhyay, S.2
  • 30
    • 0030189865 scopus 로고    scopus 로고
    • In search of optimal clusters using genetic algorithms
    • C.A. Murthy, and N. Chowdhury In search of optimal clusters using genetic algorithms Pattern Recognition Letters 17 1996 825 -832
    • (1996) Pattern Recognition Letters , vol.17 , pp. 825-832
    • Murthy, C.A.1    Chowdhury, N.2
  • 33
    • 56349158295 scopus 로고    scopus 로고
    • A simple and fast algorithm for k-medoids clustering
    • H.-S. Park, and C.-H. Jun A simple and fast algorithm for k-medoids clustering Expert Systems with Applications 36 2009 3336 3341
    • (2009) Expert Systems with Applications , vol.36 , pp. 3336-3341
    • Park, H.-S.1    Jun, C.-H.2
  • 34
    • 0000470917 scopus 로고
    • Cluster analysis in marketing research: Review and suggestions for application
    • G. Punj, and D.W. Stewart Cluster analysis in marketing research: review and suggestions for application Journal of Marketing Research 20 1983 134 148
    • (1983) Journal of Marketing Research , vol.20 , pp. 134-148
    • Punj, G.1    Stewart, D.W.2
  • 36
    • 0002663098 scopus 로고
    • SLINK: An optimally efficient algorithm for the single-link cluster method
    • R. Sibson SLINK: an optimally efficient algorithm for the single-link cluster method The Computer Journal 16 1973 30 34
    • (1973) The Computer Journal , vol.16 , pp. 30-34
    • Sibson, R.1
  • 41
    • 0012393308 scopus 로고
    • Pattern clustering by multivariate mixture analysis
    • J.H. Wolfe Pattern clustering by multivariate mixture analysis Multivariate Behavioral Research 5 1970 329 350
    • (1970) Multivariate Behavioral Research , vol.5 , pp. 329-350
    • Wolfe, J.H.1
  • 42
    • 0027697605 scopus 로고
    • An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
    • Z. Wu, and R. Leahy An optimal graph theoretic approach to data clustering: theory and its application to image segmentation IEEE Transactions on Pattern Analysis and Machine Intelligence 15 1993 1101 1113
    • (1993) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.15 , pp. 1101-1113
    • Wu, Z.1    Leahy, R.2
  • 43
    • 78049265793 scopus 로고    scopus 로고
    • A general fuzzy-statistical clustering approach for estimating the time of change in variable sampling control charts
    • M.H.F. Zarandia, and A. Alaeddinib A general fuzzy-statistical clustering approach for estimating the time of change in variable sampling control charts Information Sciences 180 2010 3033 3044
    • (2010) Information Sciences , vol.180 , pp. 3033-3044
    • Zarandia, M.H.F.1    Alaeddinib, A.2


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