A review of clustering techniques and developments

Neurocomputing

Volumn 267, Issue , 2017, Pages 664-681

  Saxena, Amit ^a   Prasad, Mukesh ^b   Gupta, Akshansh ^c   Bharill, Neha ^d   Patel, Om Prakash ^d   Tiwari, Aruna ^d   Er, Meng Joo ^e   Ding, Weiping ^f   Lin, Chin Teng ^b  

^a GURU GHASIDAS UNIVERSITY   (India)

^b UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^c JAWAHARLAL NEHRU UNIVERSITY   (India)

^d INDIAN INSTITUTE OF TECHNOLOGY INDORE   (India)

^e NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^f NANTONG UNIVERSITY   (China)

Author keywords

Clustering; Data mining; Pattern recognition; Similarity measures; Unsupervised learning

Indexed keywords

CHARACTER RECOGNITION; DATA MINING; EDUCATION; IMAGE SEGMENTATION; UNSUPERVISED LEARNING;

CENTRAL COMPONENT; CLUSTERING; CLUSTERING TECHNIQUES; DENSITY-BASED; EVALUATION CRITERIA; MODEL-BASED OPC; SIMILARITY MEASURE;

PATTERN RECOGNITION;

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; AUTOMATED PATTERN RECOGNITION; BIOINFORMATICS; CLUSTER ANALYSIS; DATA MINING; DECISION TREE; GENE EXPRESSION; IMAGE SEGMENTATION; INFORMATION RETRIEVAL; NUCLEAR MAGNETIC RESONANCE IMAGING; PRIORITY JOURNAL; SPATIAL ANALYSIS;

EID: 85021901708     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2017.06.053     Document Type: Article

References (199)

1. Duda, R.O., Hart, P.E., Stork, D.G., Pattern Classification. 2001, Wiley Publications.
2. Zhang, Y., Yin, Y., Guo, D., Yu, X., Xiao, L., Cross-validation based weights and structure determination of Chebyshev-polynomial neural networks for pattern classification. Pattern Recognit. 47:10 (2014), 3414–3428.
3. Nakayama, H., Kagaku, N., Pattern classification by linear goal programming and its extensions. J. Global Optim. 12:2 (1998), 111–126.
4. C.M. Bishop, Pattern Recognition and Machine Learning, Springer, Berlin. ISBN 978-0-387-31073-2.
5. Zhang, G.P., Neural networks for classification: a survey. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 30:4 (2002), 451–462.
6. Zhang, H., Liu, J., Ma, D., Wang, Z., Data-core-based fuzzy min–max neural network for pattern classification. IEEE Trans. Neural Netw. 22:12 (2011), 2339–2352.
7. Jiang, X., Wah, A.H.K.S., Constructing and training feed-forward neural net- works for pattern classification. Pattern Recognit. 36:4 (2003), 853–867.
8. Ou, G., Murphey, Y.L., Multi-class pattern classification using neural networks. Pattern Recognit. 40:1 (2007), 4–18.
9. Paola, J.D., Schowengerdt, R.A., A detailed comparison of back propagation neural network and maximum-likelihood classifiers for urban land use classification. IEEE Trans. Geosci. Remote Sens. 33:4 (1995), 981–996.
10. Rumelhart, D.E., McClelland, J.L., Parallel Distributed Processing. 1986, MIT Press, Cambridge.
11. Zhou, W., Verification of the nonparametric characteristics of back-propagation neural networks for image classification. IEEE Trans. Geosci. Remote Sens. 37:2 (1999), 771–779.
12. Jaeger, G., Benz, U.C., Supervised fuzzy classification of SAR data using multiple sources. IEEE Int. Geosci. Remote Sens. Symp., 1999.
13. Marzano, F.S., Scaranari, D., Vulpiani, G., Supervised fuzzy-logic classification of hydrometeors using C-band weather radars. IEEE Trans. Geosci. Remote Sens. 45:11 (2007), 3784–3799.
14. B. Xue, M. Zhang, Browne, W.N., Particle swarm optimization for feature selection in classification: a multi-objective approach. IEEE Trans. Cybern. 43:6 (2013), 1656–1671.
15. Saxena, A., Vora, M., Novel approach for the use of small world theory in particle swarm optimization. Proceedings of the Sixteenth International Conference on Advanced Computing and Communications, 2008.
16. Pawlak, Z., Rough sets. Int. J. Comput. Inf. Sci. 11:5 (1982), 341–356.
17. Pawlak, Z., Rough Sets in Theoretical Aspects of Reasoning about Data. 1991, Kluwer, Netherlands.
18. Dalai, S., Chatterjee, B., Dey, D., Chakravorti, S., Bhattacharya, K., Rough-set-based feature selection and classification for power quality sensing device employing correlation techniques. IEEE Sens. J. 13:2 (2013), 563–573.
19. Quinlan, J.R., Induction of decision trees. Mach. Learn. 1:1 (1986), 81–106.
20. Farida, D.M., Zhang, L., Rahman, C.M., Hossain, M.A., Strachan, R., Hybrid decision tree and naïve Bayes classifiers for multi-class classification tasks. Expert Syst. Appl. 41:2 (2014), 1937–1946.
21. Han, J., Kamber, M., Pei, J., Data Mining: Concepts and Techniques. 2011, Morgan Kaufmann Publishers.
22. Rokach, L., Clustering methods. Data Mining and Knowledge Discovery Handbook, 2005, Springer, 331–352.
23. Saxena, A., Pal, N.R., Vora, M., Evolutionary methods for unsupervised feature selection using Sammon's stress function. Fuzzy Inf. Eng. 2:3 (2010), 229–247.
24. Jain, A.K., Data clustering: 50 years beyond k-means. Pattern Recognit. Lett. 31:8 (2010), 651–666.
25. Merriam-Webster Online Dictionary, 2008.
26. Castro, V.E., Yang, J., A fast and robust general purpose clustering algorithm. Proceedings of the International Conference on Artificial Intelligence, 2000.
27. Fraley, C., Raftery, A.E., How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis., 1998, Department of Statistics University of Washington Technical Report No. 329.
28. Jain, A.K., Murty, M.N., Flynn, P.J., Data clustering: a review. ACM Comput. Surv. 31:3 (1999), 264–323.
29. Sneath, P., Sokal, R., Numerical Taxonomy. 1973, W.H. Freeman Co, San Francisco, CA.
30. King, B., Step-wise clustering procedures. J. Am. Stat. Assoc. 69:317 (1967), 86–101.
31. Ward, J.H., Hierarchical grouping to optimize an objective function. J. Am. Stat. Assoc. 58:301 (1963), 236–244.
32. Murtagh, F., A survey of recent advances in hierarchical clustering algorithms which use cluster centers. Comput. J. 26:4 (1984), 354–359.
33. Nagpal, A., Jatain, A., Gaur, D., Review based on data clustering algorithms. Proceedings of the IEEE Conference on Information and Communication Technologies, 2013.
34. Periklis, A., Data Clustering Techniques. 2002, University of Toronto.
35. Guha, S., Rastogi, R., Kyuseok, S., CURE: An Efficient Clustering Algorithm For Large Databases. 1998, ACM.
36. George, K., Han, E.H., Kumar, V., Chameleon: a hierarchical clustering algorithm using dynamic modeling. IEEE Comput. 32:8 (1999), 68–75.
37. Lam, D., Wunsch, D.C., Clustering, academic press library in signal processing. Signal Process. Theory Mach. Learn. 1 (2014), 1115–1149.
38. MacQueen, J.B., Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Symposium on Mathematical Statistics and Probability, Berkeley, vol. 1, 1967, University of California Press, 281–297.
39. Gersho, A., Gray, R., Vector Quantization and Signal Compression. 1992, Kluwer Academic Publishers.
40. Dunn, J.C., A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. J. Cybern. 3:3 (1973), 32–57.
41. Bezdek, J.C., Pattern Recognition with Fuzzy Objective Function Algorithms. 1981, Plenum Press, New York.
42. Yager, R., Filev, D., Approximate clustering via the mountain method. IEEE Trans. Syst. Man Cybern. Part B Cybern. 24:8 (1994), 1279–1284.
43. Gath, I., Geva, A., Unsupervised optimal fuzzy clustering. IEEE Trans. Pattern Anal. Mach. Intell. 11:7 (1989), 773–781.
44. Hathaway, R., Bezdek, J., Hu, Y., Generalized fuzzy c-means clustering strategies using Lp norm distances. IEEE Trans. Fuzzy Syst. 8:5 (2000), 576–582.
45. Krishnapuram, R., Keller, J., A possibilistic approach to clustering. IEEE Trans. Fuzzy Syst. 1:2 (1993), 98–110.
46. Zahn, C.T., Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. Comput. C-20:1 (1971), 68–86.
47. Urquhart, R., Graph-theoretical clustering based on limited neighborhood sets. Pattern Recognit. 15:3 (1982), 173–187.
48. Fisher, D.H., Knowledge acquisition via incremental conceptual clustering. Mach. Learn. 2 (1987), 139–172.
49. Haykin, S., Neural Networks: A Comprehensive Foundation. second ed., 1999, Prentice Hall.
50. Xu, R., Wunsch, D., Survey of clustering algorithms. IEEE Trans. Neural Netw. 16:3 (2005), 645–678.
51. Xu., R., Wunsch, D.C., Clustering algorithms in biomedical research: a review. IEEE Rev. Biomed. Eng. 3 (2010), 120–154.
52. McLachlan, G., Krishnan, T., The EM Algorithm and Extensions. 1997, Wiley, New York.
53. J.D. Banfield and A.E. Raftery, Model-based Gaussian and non-Gaussian clustering Biometrics, vol. 49, no. 3, pp. 803–821, 1993.
54. SEster, M., Kriegel, H.P., Sander, S., Xu, X., A density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, 1996.
55. Cheeseman, P., Stutz, J., Bayesian classification (AutoClass): theory and results. Advances in Knowledge Discovery and Data Mining, 1996, American Association for Artificial Intelligence Menlo Park, CA, USA, 153–180.
56. Wallace, C.S., Dowe, D.L., Intrinsic classification by MML-the snob program. Proceedings of the Seventh Australian Joint Conference on Artificial Intelligence, 1994, 37–44.
57. Wang, W., Yang, J., Muntz, R.R., STING: a statistical information grid approach to spatial data mining. Proceedings of the Twenty-third International Conference on Very Large Data Bases, 1997, 86–195.
58. Sheikholeslami, G., Chatterjee, S., Zhang, A., WaveCluster: a wavelet-based clustering approach for spatial data in very large databases. Int. J. Very Large Data Bases 8:3–4 (2000), 289–304.
59. Agrawal, R., Johannes, G., Dimitrios, G., Raghavan, P., Automatic subspace clustering of high dimensional data for data mining applications. Proceedings of the ACM SIGMOD International Conference on Management of Data Conference, 1998, 94–105.
60. Jain, A.K., Flynn, M., Data clustering: a review. ACM Comput. Surv. 31:3 (1999), 264–323.
61. Schwefel, H.P., Numerical Optimization of Computer Models. 1981, John Wiley, New York.
62. Fogel, L.J., Owens, A.J., Walsh, MJ, Artificial Intelligence Through Simulated Evolution. 1965, John Wiley, New York.
63. Holland, J.H., Adaption in Natural and Artificial Systems. 1975, University of Michigan Press.
64. Goldberg, D., Genetic Algorithms in Search Optimization and Machine Learning. 1989, Addison–Wesley, Reading.
65. Kennedy, J., Eberhart, R.C., Swarm Intelligence, 2001.
66. Kennedy, J., Eberhart, R., Particle swarm optimization. Proceedings of the Fourth IEEE International Conference on Neural Networks, 1995, 1942–1948.
67. Dorigoand, M., Stützle, T., Ant Colony Optimization. 2004, MIT Press.
68. Glover, F., Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 5:5 (1986), 533–549.
69. Al. Sultan, K.S., A tabu search approach to clustering problem. Pattern Recognit. 28:9 (1995), 1443–1451.
70. Pedrycz, W., Collaborative fuzzy clustering. Pattern Recognit. Lett. 23:14 (2002), 1675–1686.
71. Coletta, L.F.S., Vendramin, L., Hruschka, E.R., Campello, R.J.G.B., Pedrycz, W., Collaborative fuzzy clustering algorithms: some refinements and design guidelines. IEEE Trans. Fuzzy Syst. 20:3 (2012), 444–462.
72. Pedrycz, W., Rai, P., Collaborative clustering with the use of fuzzy c-means and its quantification. Fuzzy Sets Syst. 159:18 (2008), 2399–2427.
73. Pedrycz, W., Knowledge Based Clustering: From Data to Information Granules. 2005, Wiley Publications.
74. Prasad, M., Lin, C.T., Yang, C.T., Saxena, A., Vertical collaborative fuzzy c-means for multiple EEG data sets. Proceedings of the Sixth International Conference on Intelligent Robotics and Applications, 8102, 2013, Springer, 246–257 Lecture Notes in Computer Science.
75. Pizzuti, C., Overlapping community detection in complex networks, in: Proceedings of the Eleventh Annual Conference on Genetic and Evolutionary Computation. 2009, 859–866.
76. Gregory, S., A fast algorithm to find overlapping communities in networks. Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (PKDD), 2008, 408–423.
77. Ahn, Y.Y., Bagrow, J.P., Lehmann, S., Link communities reveal multi-scale complexity in networks. Nature 466 (2010), 761–764.
78. Forestier, G, Gancarski, P, Wemmert, C, Collaborative clustering with back ground knowledge. Data Knowl. Eng. 69:2 (2010), 211–228.
79. Handl, J., Knowles, J., An evolutionary approach to multiobjective clustering. IEEE Trans. Evolut. Comput. 11:1 (2007), 56–76.
80. Konak, A., Coit, D., Smith, A., Multiobjective optimization using genetic algorithms: a tutorial. Reliab. Eng. Syst. Saf. 91:9 (2006), 992–1007.
81. Faceili, K., Carvalho, A.D., Souto, D., Multiobjective clustering ensemble. Proceedings of the International Conference on Hybrid Intelligent Systems, 2006.
82. Law, M.K., Topchy, A., Jain, A.K., Multiobjective data clustering. IEEE Conf. Comp. Vis. Pattern Recognit. 2 (2004), 424–430.
83. Forsyth, D., Ponce, J., Computer Vision: A Modern Approach. 2002, Prentice Hall.
84. Consortium, I.H.G.S., Initial sequencing and analysis of the human genome. Nature 409 (2001), 860–921.
85. Dorai, C., Jain, A.K., Shape spectra based view grouping for free form object. Proceedings of the International Conference on Image Processing, 3, 1995, 240–243.
86. Connell, S., Jain, A.K., Learning prototypes for on-line handwritten digits. Proceedings of the Fourteenth International Conference on Pattern Recognition, 1, 1998, 182–184.
87. Rasmussen, E., Clustering Algorithms, Information Retrieval: Data Structures and Algorithms. 1992, Prentice Hall, Englewood Cliffs, 419–442.
88. McKiernan, G., LC Classification Outline. 1990, Library of Congress, Washington, D.C.
89. Hedberg, S.R., Searching for the mother lode: tales of the first data miners. IEEE Expert Intell. Syst. Appl. 11:5 (1996), 4–7.
90. Cohen, J., Communications of the ACM. 1996, Data Mining Association for Computing Machinery.
91. Saxena, A., Wang, J., Dimensionality reduction with unsupervised feature selection and applying non-Euclidean norms for classification accuracy. Int. J. Data Wareh. Min. 6:2 (2010), 22–40.
92. Sultan, K.S.Al., Khan, M.M., Computational experience on four algorithms for the hard clustering problem. Pattern Recognit. Lett. 17:3 (1996), 295–308.
93. Michalski, R., Stepp, R.E., Diday, E., Automated construction of classifications: conceptual clustering versus numerical taxonomy. IEEE Trans. Pattern Anal. Mach. Intell. 5:4 (1983), 396–409.
94. Venter, J.C., The sequence of the human genome. Science 291 (2001), 1304–1351.
95. Kolodner, J.L., Reconstructive memory: a computer model. Cogn. Sci. 7:4 (1983), 281–328.
96. Carpineto, C., Romano, G., An order-theoretic approach to conceptual clustering. Proceedings of the Tenth International Conference on Machine Learning, 1993, 33–40.
97. Talavera, L., Bejar, J., Generality-based conceptual clustering with probabilistic concepts. IEEE Trans. Pattern Anal. Mach. Intell. 23:2 (2001), 196–206.
98. Hadzikadic, M., Yun, D., Concept formation by incremental conceptual clustering. Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 1989, 831–836.
99. Biswas, G., Weinberg, J.B., Fisher, D.H., Iterate: a conceptual clustering algorithm for data mining. IEEE Trans. Syst. Man Cybern. Part C 28:2 (1998), 219–230.
100. Thompson, K., Langley, P., Concept formation in structured domains. Concept Formation: Knowledge and Experience in Unsupervised Learning, 1991, Morgan Kaufmann.
101. Jonyer, I., Cook, D., Holder, L., Graph-based hierarchical conceptual clustering. J. Mach. Learn. Res. 2 (2001), 19–43.
102. Lebowitz, M., Experiments with incremental concept formation: UNIMEM. Mach. Learn. 2:2 (1987), 103–138.
103. Hanson, S., Bauer, M., Conceptual clustering, categorization and polymorphy. Mach. Learn. J. 3:4 (1989), 343–372.
104. Kohonen, T., The self-organizing map. Neurocomputing 21:1–3 (1998), 1–6 Pages.
105. Vesanto, J., Alhoniemi, E., Clustering of the self-organizing map. IEEE Trans. Neural Netw. 11:3 (2000), 586–600.
106. Upton, J.G., Fingelton, B., Spatial data analysis by example. Point Pattern and Quantitative Data, 1, 1985 John Wiley & Sons New York.
107. Strehl, A., Ghosh, J., Mooney, R., Impact of similarity measures on web-page clustering. Proceedings of the Workshop on Artificial Intelligence for Web Search, 2000, 58–64.
108. Fortier, J.J., Solomon, H., Clustering procedures. The Multivariate Analysis, 1996, SAS Institute Inc., Cary, NC, USA, 493–506.
109. Gluck, M.A., Corter, J.E., Information, uncertainty, and the utility of categories. Proceedings of the Seventh Annual Conference of the Cognitive Science Society, 1985, 283–287 1985.
110. Condorcet, M.J.A.N., Essai sur l'Application de l'Analyse `a la Probabilite´ des Decisions Rendues a la Pluralite´ des Voix. 1785, L'Imprimerie Royale, Paris.
111. Marcotorchino, J.F., Michaud, P., Optimisation En Analyse Ordinale Des Donnees. 1979, Masson, Paris.
112. Corter, J.E., Gluck, M.A., Explaining basic categories: feature predictability and information. Psychol. Bull. 111:2 (1992), 291–303.
113. Strehl, A., Ghosh, J., Clustering guidance and quality evaluation using relationship-based visualization. Intelligent Engineering Systems Through Artificial Neural Networks, 2000, St. Louis, Missouri, USA, 483–488.
114. Stehman, S.V., Selecting and interpreting measures of thematic classification accuracy. Remote Sens. Environ. 62:1 (1997), 77–89.
115. Rand, W.M., Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66:336 (1971), 846–850.
116. Rijsbergen, V., Information Retrieval. 1979, Butterworths, London.
117. Brendan, J.F., Dueck, D., Clustering by passing messages between data points. Science 315 (2007), 972–976.
118. Fowlkes, E.B., Mallows, C.L., A method for comparing two hierarchical clusterings. J. Am. Stat. Assoc. 78:383 (1983), 553–569 2010.
119. Olson, D.L., Delen, D., Advanced Data Mining Techniques. first ed., 2008, Springer.
120. Powers, D.M.W., Evaluation: from precision, recall and F-factor to ROC, informedness, markedness & correlation. J. Mach. Learn. Technol. 2:1 (2007), 37–63.
121. Jaccard, P., Distribution de la flore alpine dans le bassin des dranses et dans quelques régions voisines. Bull. Soc. Vaud. Sci. Nat. 37 (1901), 241–272.
122. Han, J., Kamber, M., Pei, J., Data Mining: Concepts and Techniques. 2011, Morgan Kaufman, San Francisco, USA.
123. Grefenstette, J.J., Optimization of control parameters for genetic algorithms. IEEE Trans. Syst. Man Cybern. 16:1 (1986), 122–128.
124. Lin, C.T., Prasad, M., Chang, J.Y., Designing Mamdani type fuzzy rule using a collaborative FCM scheme. Proceedings of the International Conference on Fuzzy Theory and its Applications, 2013.
125. Eugene, L., Chapter 4.5. Combinatorial implications of max-flow min-cut theorem, Chapter 4.6. Linear programming interpretation of max-flow min-cut theorem. Combinatorial Optimization: Networks and Matroids, 2001, Dover, 117–120.
126. Papadimitriou, C.H., Steiglitz, K., Chapter 6.1: the max-flow, min-cut theorem. Combinatorial Optimization: Algorithms and Complexity, 1998, Dover, 120–128.
127. Fotheringham, A.S., Charlton, M.E., Brunsdon, C., Geographically weighted regression: a natural evolution of the expansion method for spatial data analysis. Environ. Plann. 30:11 (1998), 1905–1927.
128. Honarkhah, M., Caers, J., Stochastic simulation of patterns using distance-based pattern modeling. Math. Geosci. 42:5 (2010), 487–517.
129. Tahmasebi, P., Hezarkhani, A., Sahimi, M, Multiple-point geostatistical modeling based on the cross-correlation functions. Comput. Geosci. 16:3 (2012), 779–797.
130. Guha, S., Rastogi, R., Shim, K., Rock: a robust clustering algorithm for categorical attributes. Proceedings of the IEEE Conference on Data Engineering, 1999.
131. Zhang, T., Ramakrishnan, R., Linvy, M., BIRCH: an efficient method for very large databases. Proceedings of the ACM SIGMOD International Conference on Management of Data, 1996, ACM.
132. Jiang, D., Chen, G., Ooi, B.C., Tan, K.L., W, S., epiC: an Extensible and Scalable System for Processing Big Data. 40th VLDB Conference, 2014, 541–552.
133. Huang, Z., A Fast Clustering Algorithm to Cluster very Large Categorical Data Sets in Data Mining. 1997, Data Mining and Knowledge Discovery DMKD.
134. Hinneburg, A., Keim, D., An efficient approach to clustering in large multimedia databases with noise. Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, KDD, 1998.
135. Berry, M.J.A., Linoff, G., Data Mining Techniques For Marketing, Sales and Customer Support. 1996 John Wiley & Sons, Inc USA.
136. Fennell, G., Allenby, G.M., Yang, S., Edwards, Y., The effectiveness of demographics and psychographic variables for explaining brand and product category use. Quant. Market. Econ. 1:2 (2003), 223–224.
137. Kiang, M.Y., Fisher, D.M., Hu, M.Y., The effect of sample size on the extended self-organizing map network: a market segmentation application. Comput. Stat. Data Anal. 51:12 (2007), 5940–5948.
138. Dolnicar, S., Using cluster analysis for market segmentation–typical misconceptions, established methodological weaknesses and some recommendations for improvement. J. Market. Res. 11:2 (2003), 5–12.
139. Wagner, R., Scholz, S.W., Decker, R., The number of clusters in market segmentation. Data Analysis and Decision Support, 2005, Springer, Heidelberg, 157–176.
140. Durbin, R.M., Eddy, S.R., Krogh, A., Mitchison, G., Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. 1998, Cambridge University Press, Cambridge.
141. Kaplan, J.M., Winther, R.G., Prisoners of abstraction? The theory and measure of genetic variation, and the very concept of “Race”. Biol. Theory 7 (2012), 401–412.
142. Carrington, P.J., Scott, J., Social network analysis: an introduction. The Sage Handbook of Social Network Analysis, 1, 2011, Sage, London.
143. Yippy growing by leaps, bounds, The News-Press. 23 May 2010, Retrieved 24 May 2010.
144. Dirk, D., A concept-oriented approach to support software maintenance and reuse activities. Proceedings of the Fifth Joint Conference on Knowledge Based Software Engineering, 2002.
145. Dias, M.G.B., Anquetil, N., Oliveira, K.M.D., Organizing the knowledge used in software maintenance. J. Univ. Comput. Sci. 9:7 (2003), 641–658.
146. Francesco, R., Rokach, L., Shapira, B., Introduction to recommender systems handbook. Recommender Systems Handbook, 2011, Springer, 1–35.
147. www.educationaldatamining.org, 2013.
148. Baker, R., Data mining for education. third ed. International Encyclopedia of Education, 7, 2010, Elsevier, Oxford, UK, 112–118.
149. Siemens, G., Baker, R.S.J.D., Learning analytics and educational data mining: towards communication and collaboration. Proceedings of the Second International Conference on Learning Analytics and Knowledge, 2012, 252–254.
150. Huth, R., Beck, C., Philipp, A., Demuzere, M., Ustrnul, Z., Cahynova, M., Kysely, J., Tveito, O.E., Classifications of atmospheric circulation patterns: recent advances and applications. Ann. N.Y. Acad. Sci. 1146:1 (2008), 105–152.
151. Bewley, A., Shekhar, R., Leonard, S., Upcroft, B., Lever, P., Real-time volume estimation of a dragline payload. Proceedings of the IEEE International Conference on Robotics and Automation, 2011, 1571–1576.
152. Manning, C.D., Raghavan, P., Schütze, H., An Introduction to Information Retrieval. 2009, Cambridge University Press.
153. Nguyen, D.T., Chen, L., Chan, C.K., Clustering with multi-viewpoint-based similarity measure. IEEE Trans. Knowl. Data Eng. 24:6 (2012), 988–1001.
154. Bravais, A., Analyse mathamatique sur les probabilities des erreus de situation d'un point. Memoires presentes par divers savants. France: l Academie Royale des Sciences de l Institute de France, 9, 1846, 255–332.
155. Pearson, K., Mathematical contributions to the theory of evolution, III, regression, heredity, and panmixia. Philos. Trans. R. Soc. Lond. Ser. A 187 (1896), 253–318.
156. Sørensen, T., A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on Danish commons. K. Dan. Vidensk. Selsk. 5:4 (1948), 1–34.
157. Dice, L.R., Measures of the amount of ecologic association between species. Ecology 26:3 (1945), 297–302.
158. Hamilton, J.D., Time Series Analysis. 1994, Princeton University Press.
159. Tsay, R.S., Analysis of Financial Time Series. 2005 John Wiley & SONS.
160. Saxena, A., Wang, J., Dimensionality reduction with unsupervised feature selection and applying non-Euclidean norms for classification accuracy. Int. J. Data Warehous. Min. 6:2 (2010), 22–40.
161. Arora, S., Chana, I., A survey of clustering techniques for big data analysis. Proceedings of the Fifth International Conference on The Next Generation Information Technology Summit (Confluence), 2014.
162. Shirkhorshidi, A.S., Aghabozorgi, S., Wah, T.Y., Herawan, T., Big Data Clustering: A Review, 8583, 2014, Springer, 707–720 Lecture Notes Computer Science.
163. Wang, H., Wang, W., Yang, J., Yu, P.S., Clustering by pattern similarity in large data sets. Proceedings of the International Conference on Management of Data, 2002, ACM.
164. Bharill, N., Tiwari, A., Malviya, A., Fuzzy Based Scalable Clustering Algorithms for Handling Big Data Using Apache Spark. IEEE Trans. Big Data 2:4 (2016), 339–352.
165. Wu, X., Zhu, X., Wu, G.Q., Ding, W., Data mining with big data. IEEE Trans. Knowl. Data Eng. 26:1 (2014), 97–107.
166. Russom, P., Big Data Analytics, TDWI best practices report, The Data Warehousing Institute (TDWI) Research., 2011.
167. Xiao, C., Nie, F., Huang, H., Multi-view k-means clustering on big data. Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, 2013, AAAI.
168. Fan, W., Albert, B., Mining big data: current status and forecast to the future. ACM SIGKDD Explor. Newsl. 14:2 (2013), 1–5.
169. Shvachko, K., Kuang, H., Radia, S., Chansler, R., The hadoop distributed file system. Proceedings of the IEEE Twenty-sixth Symposium on Mass Storage Systems and Technologies (MSST), 2010.
170. Jeffrey, D., Ghemawat, S., MapReduce: a flexible data processing tool. Commun. ACM 53:1 (2010), 72–77.
171. Dean, J., Ghemawat, S., Map Reduce: a flexible data processing tool. Communications of the ACM 53:1 (2010), 72–77.
172. Celeux, G., Govaert, G., A classification EM algorithm for clustering and two stochastic versions. Comput. Stat. Data Anal. 14:3 (1992), 315–332.
173. Kaufman, L., Rousseeuw, P., Finding Groups in Data: An Introduction to Cluster Analysis. 1990, Wiley.
174. Ngand, R., Han, J., CLARANS: a method for clustering objects for spatial data mining. IEEE Trans. Knowl. Data Eng. 14:5 (2002), 1003–1016.
175. Sisodia, D., Sisodia, S., Saxena, K., Clustering techniques: a brief survey of different clustering algorithms. Int. J. Latest Trends Eng. Technol. 1:3 (2012), 82–87.
176. Zhong, C., Miao, D., Wang, R., A graph-theoretical clustering method based on two rounds of minimum spanning trees. Pattern Recognit. 43 (2010), 752–766.
177. Chen, Y., Sanghavi, S., Xu, H., Improved graph clustering. IEEE Trans. Inf. Theory 60:10 (2014), 6440–6455.
178. Condon, A., Karp, R., Algorithms for graph partitioning on the planted partition model. Random Struct. Algorithms 18:2 (2001), 116–140.
179. Donath, W.E., Hoffman, A.J., Lower bounds for the partitioning of graphs. IBM J. Res. Dev. 17 (1973), 420–425.
180. Shi, J., Malik, J., Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22:8 (2000), 888–905.
181. Luxburg, U., A tutorial on spectral clustering. Stat. Comput. 17:4 (2007), 395–416.
182. Rohe, K., Chatterjee, S., Yu, B., Spectral clustering and the high-dimensional stochastic block model. Ann. Stat. 39:4 (2011), 1878–1915.
183. Gunnemann, S., Farber, I., Boden, B., Seidl, T., Subspace clustering meets dense sub-graph mining: a synthesis of two paradigms. Proceedings of the IEEE International Conference on Data Mining, ICDM, 2010.
184. Macropol, K., Singh, A., Scalable discovery of best clusters on large graphs. Proceedings of the VLDB Endowment, 3, 2010, 693–702.
185. Whang, J.J., Sui, X., Dhillon, I.S., Scalable and memory-efficient clustering of large-scale social networks. Proceedings of the Twelfth IEEE International Conference on Data Mining, ICDM, 2012.
186. Karypis, G., Kumar, V., A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20:1 (1998), 359–392.
187. Karypis, G., Kumar, V., Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48 (1998), 96–129.
188. Yan, D., Huang, L., Jordan, M.I., Fast approximate spectral clustering. Proceedings of the Fifteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2009, 907–916.
189. Liu, J., Wang, C., Danilevsky, M., Han, J., Large-scale spectral clustering on graphs. Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence, IJCAI, 2013.
190. Yang, W., Xu, H., A divide and conquer framework for distributed graph clustering. Proceedings of the Thirty-second International Conference on Machine Learning (ICML-15), 2015.
191. Ghosh, S., Dubey, S.K., Comparative analysis of k-means and fuzzy c-means algorithms. Int. J. Adv. Comput. Sci. Appl. 4:4 (2013), 35–39.
192. Niwattanakul, S., Singthongchai, J., Naenudorn, E., Wanapu, S., Using of Jaccard coefficient for keywords similarity. Proceedings of the International MultiConference of Engineers and Computer Scientists (IMECS), I, 2013, Hong Kong, 1–5 March 13–15.
193. C. Chen, L. Pau, and P. Wang, Cluster analysis and related issue, R. Dubes Eds. Handbook of Pattern Recognition and Computer Vision, World Scientific, Singapore, pp. 3–32.
194. Jain, A., Dubes, R., Algorithms for Clustering Data. 1988, Prentice-Hall, Englewood, Cliffs, NJ.
195. Shi, C., Cai, Y., Fu, D., Dong, Y., Wu, B., A link clustering based overlapping community detection algorithm. Data Knowl. Eng. 87 (2013), 394–404.
196. Palla, G., Derenyi, I., Farkas, I., Vicsek, T., Uncovering the overlapping community structure of complex networks in nature and society. Nature 435 (2005), 814–818.
197. Wolpert, D.H., Macready, W.G., No free lunch theorem for optimization. IEEE Trans. Evol. Comput. 1:1 (1997), 67–82.
198. Bensmail, H., Celeux, G., Raftery, A.E., Robert, C.P., Inference in model-based cluster analysis. Stat. Comput 7 (1997), 1–10.
199. Xu, D., Tian, Y., A comprehensive survey of clustering algorithms. Ann. Data Sci 2 (2015), 165–193.