메뉴 건너뛰기




Volumn 2, Issue 3, 2014, Pages 267-279

A survey of clustering algorithms for big data: Taxonomy and empirical analysis

Author keywords

big data; Clustering algorithms; unsupervised learning

Indexed keywords

BIG DATA; CLUSTER ANALYSIS; LEARNING ALGORITHMS; SURVEYS; UNSUPERVISED LEARNING;

EID: 84908602473     PISSN: None     EISSN: 21686750     Source Type: Journal    
DOI: 10.1109/TETC.2014.2330519     Document Type: Article
Times cited : (912)

References (40)
  • 1
    • 34548850872 scopus 로고    scopus 로고
    • A survey on clustering algorithms for wireless sensor networks
    • Oct.
    • A. A. Abbasi and M. Younis, "A survey on clustering algorithms for wireless sensor networks, " Comput. Commun., vol. 30, nos. 14-15, pp. 2826-2841, Oct. 2007.
    • (2007) Comput. Commun. , vol.30 , Issue.14-15 , pp. 2826-2841
    • Abbasi, A.A.1    Younis, M.2
  • 2
    • 84949179803 scopus 로고    scopus 로고
    • A survey of text clustering algorithms
    • New York, NY, USA: Springer-Verlag
    • C. C. Aggarwal and C. Zhai, "A survey of text clustering algorithms, " in Mining Text Data. New York, NY, USA: Springer-Verlag, 2012, pp. 77-128.
    • (2012) Mining Text Data , pp. 77-128
    • Aggarwal, C.C.1    Zhai, C.2
  • 5
    • 0347172110 scopus 로고    scopus 로고
    • Optics: Ordering points to identify the clustering structure
    • M.Ankerst, M. M.Breunig, H.-P. Kriegel, andJ.Sander, "Optics: Ordering points to identify the clustering structure, " in Proc. ACM SIGMOD Rec., 1999, vol. 28, no. 2, pp. 49-60.
    • (1999) Proc. ACM SIGMOD Rec. , vol.28 , Issue.2 , pp. 49-60
    • Ankerst, M.1    Breunig, M.M.2    Kriegel, H.-P.3    Sander, J.4
  • 6
    • 0021583718 scopus 로고
    • FCM: The fuzzyc-means clustering algorithm
    • J. C. Bezdek, R. Ehrlich, and W. Full, "FCM: The fuzzyc-means clustering algorithm, " Comput. Geosci., vol. 10, nos. 2-3, pp. 191-203, 1984.
    • (1984) Comput. Geosci. , vol.10 , Issue.2-3 , pp. 191-203
    • Bezdek, J.C.1    Ehrlich, R.2    Full, W.3
  • 8
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the em algorithm
    • A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the em algorithm, " J. Roy. Statist. Soc., Ser. B, vol. 39, no. 1, pp. 1-38, 1977.
    • (1977) J. Roy. Statist. Soc., Ser. B , vol.39 , Issue.1 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 11
    • 84878323159 scopus 로고    scopus 로고
    • Toward an efficient and scalable feature selection approach for internet traffic classification
    • Jun.
    • A. Fahad, Z. Tari, I. Khalil, I. Habib, and H. Alnuweiri, "Toward an efficient and scalable feature selection approach for internet traffic classification, " Comput. Netw., vol. 57, no. 9, pp. 2040-2057, Jun. 2013.
    • (2013) Comput. Netw. , vol.57 , Issue.9 , pp. 2040-2057
    • Fahad, A.1    Tari, Z.2    Khalil, I.3    Habib, I.4    Alnuweiri, H.5
  • 12
    • 0343442766 scopus 로고
    • Knowledge acquisition via incremental conceptual clustering
    • Sep.
    • D. H. Fisher, "Knowledge acquisition via incremental conceptual clustering, " Mach. Learn., vol. 2, no. 2, pp. 139-172, Sep. 1987.
    • (1987) Mach. Learn. , vol.2 , Issue.2 , pp. 139-172
    • Fisher, D.H.1
  • 13
    • 0024732990 scopus 로고
    • Models of incremental concept formation
    • Sep.
    • J. H. Gennari, P. Langley, and D. Fisher, "Models of incremental concept formation, " Artif. Intell., vol. 40, nos. 1-3, pp. 11-61, Sep. 1989.
    • (1989) Artif. Intell. , vol.40 , Issue.1-3 , pp. 11-61
    • Gennari, J.H.1    Langley, P.2    Fisher, D.3
  • 14
    • 0032091595 scopus 로고    scopus 로고
    • Cure: An efficient clustering algorithm for large databases
    • S. Guha, R. Rastogi, and K. Shim, "Cure: An efficient clustering algorithm for large databases, " in Proc. ACM SIGMOD Rec., Jun. 1998, vol. 27, no. 2, pp. 73-84.
    • (1998) Proc. ACM SIGMOD Rec., Jun. , vol.27 , Issue.2 , pp. 73-84
    • Guha, S.1    Rastogi, R.2    Shim, K.3
  • 15
    • 0034228041 scopus 로고    scopus 로고
    • Rock: A robust clustering algorithm for categorical attributes
    • S. Guha, R. Rastogi, and K. Shim, "Rock: A robust clustering algorithm for categorical attributes, " Inform. Syst., vol. 25, no. 5, pp. 345-366, 2000.
    • (2000) Inform. Syst. , vol.25 , Issue.5 , pp. 345-366
    • Guha, S.1    Rastogi, R.2    Shim, K.3
  • 18
    • 0000835955 scopus 로고    scopus 로고
    • Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering
    • A. Hinneburg and D. A. Keim, "Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering, " in Proc. 25th Int. Conf. Very Large Data Bases (VLDB), 1999, pp. 506-517.
    • (1999) Proc. 25th Int. Conf. Very Large Data Bases (VLDB) , pp. 506-517
    • Hinneburg, A.1    Keim, D.A.2
  • 19
    • 0010486274 scopus 로고    scopus 로고
    • A fast clustering algorithm to cluster very large categorical data sets in data mining
    • Z. Huang, "A fast clustering algorithm to cluster very large categorical data sets in data mining, " in Proc. SIGMOD Workshop Res. Issues Data Mining Knowl. Discovery, 1997, pp. 1-8.
    • (1997) Proc. SIGMOD Workshop Res. Issues Data Mining Knowl. Discovery , pp. 1-8
    • Huang, Z.1
  • 20
    • 0000008146 scopus 로고
    • Comparing partitions
    • L. Hubert and P. Arabie, "Comparing partitions, " J. Classification, vol. 2, no. 1, pp. 193-218, 1985.
    • (1985) J. Classification , vol.2 , Issue.1 , pp. 193-218
    • Hubert, L.1    Arabie, P.2
  • 22
    • 0032686723 scopus 로고    scopus 로고
    • Chameleon: Hierarchical clustering using dynamic modelling
    • Aug.
    • G. Karypis, E.-H. Han, and V. Kumar, "Chameleon: Hierarchical clustering using dynamic modelling, " IEEE Comput., vol. 32, no. 8, pp. 68-75, Aug. 1999.
    • (1999) IEEE Comput. , vol.32 , Issue.8 , pp. 68-75
    • Karypis, G.1    Han, E.-H.2    Kumar, V.3
  • 24
    • 0345404396 scopus 로고    scopus 로고
    • The self-organizing map
    • T. Kohonen, "The self-organizing map, " Neurocomputing, vol. 21, no. 1, pp. 1-6, 1998.
    • (1998) Neurocomputing , vol.21 , Issue.1 , pp. 1-6
    • Kohonen, T.1
  • 26
    • 42949110140 scopus 로고    scopus 로고
    • An efficient clustering scheme to exploit hierarchical data in network traffic analysis
    • Jun.
    • A. Mahmood, C. Leckie, and P. Udaya, "An efficient clustering scheme to exploit hierarchical data in network traffic analysis, " IEEE Trans. Knowl. Data Eng., vol. 20, no. 6, pp. 752-767, Jun. 2007.
    • (2007) IEEE Trans. Knowl. Data Eng. , vol.20 , Issue.6 , pp. 752-767
    • Mahmood, A.1    Leckie, C.2    Udaya, P.3
  • 28
    • 0001788080 scopus 로고    scopus 로고
    • An experimental comparison of several clustering and initialization methods
    • M. Meila and D. Heckerman, "An experimental comparison of several clustering and initialization methods, " in Proc. 14th Conf. Uncertainty Artif. Intell. (UAI), 1998, pp. 386-395.
    • (1998) Proc. 14th Conf. Uncertainty Artif. Intell. (UAI) , pp. 386-395
    • Meila, M.1    Heckerman, D.2
  • 31
    • 0003136237 scopus 로고
    • Efficient and effective clustering methods for spatial data mining
    • R. T. Ng and J. Han, "Efficient and effective clustering methods for spatial data mining, " in Proc. Int. Conf. Very Large Data Bases (VLDB), 1994, pp. 144-155.
    • (1994) Proc. Int. Conf. Very Large Data Bases (VLDB) , pp. 144-155
    • Ng, R.T.1    Han, J.2
  • 32
    • 0036709106 scopus 로고    scopus 로고
    • CLARANS: A method for clustering objects for spatial data mining
    • Sep./Oct.
    • R. T. Ng and J. Han, "CLARANS: A method for clustering objects for spatial data mining, " IEEE Trans. Knowl. Data Eng. (TKDE), vol. 14, no. 5, pp. 1003-1016, Sep./Oct. 2002.
    • (2002) IEEE Trans. Knowl. Data Eng. (TKDE) , vol.14 , Issue.5 , pp. 1003-1016
    • Ng, R.T.1    Han, J.2
  • 33
    • 56349158295 scopus 로고    scopus 로고
    • A simple and fast algorithm for K-medoids clustering
    • Mar.
    • H.-S. Park and C.-H. Jun, "A simple and fast algorithm for K-medoids clustering, " Expert Syst. Appl., vol. 36, no. 2, pp. 3336-3341, Mar. 2009.
    • (2009) Expert Syst. Appl. , vol.36 , Issue.2 , pp. 3336-3341
    • Park, H.-S.1    Jun, C.-H.2
  • 38
    • 16444383160 scopus 로고    scopus 로고
    • Survey of clustering algorithms
    • May
    • R. Xu and D. Wunsch, "Survey of clustering algorithms, " IEEE Trans. Neural Netw., vol. 16, no. 3, pp. 645-678, May 2005.
    • (2005) IEEE Trans. Neural Netw. , vol.16 , Issue.3 , pp. 645-678
    • Xu, R.1    Wunsch, D.2
  • 40
    • 0030157145 scopus 로고    scopus 로고
    • BIRCH: An efficient data clustering method for very large databases
    • T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: An efficient data clustering method for very large databases, " in Proc. ACM SIGMOD Rec., Jun. 1996, vol. 25, no. 2, pp. 103-114.
    • (1996) Proc. ACM SIGMOD Rec., Jun. , vol.25 , Issue.2 , pp. 103-114
    • Zhang, T.1    Ramakrishnan, R.2    Livny, M.3


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