Skip to main content

2016 | OriginalPaper | Buchkapitel

Evolutionary Improved Swarm-Based Hybrid K-Means Algorithm for Cluster Analysis

verfasst von : Janmenjoy Nayak, D. P. Kanungo, Bighnaraj Naik, H. S. Behera

Erschienen in: Proceedings of the Second International Conference on Computer and Communication Technologies

Verlag: Springer India

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Improvement in the quality of cluster centers and minimization of intra-cluster distance are two most challenging areas of K-means clustering algorithm. Due to predetermined number of clusters, it is difficult to predict the exact value of k. Furthermore, in case of non-globular clusters, K-means fails to get optimal cluster center in a data set. In this paper, a hybrid improved particle swarm optimization-based evolutionary K-means clustering method has been proposed to obtain the optimal cluster center. The hybridization of improved PSO and genetic algorithm (GA) along with K-means algorithm improves the convergence speed as well as helps to find the global optimal solution. In the first stage, IPSO has been used to get a global solution in order to get optimal cluster centers. Then, the crossover steps of GA are used to improve the quality of particles and mutation is used for diversification of solution space in order to avoid premature convergence. The performance analysis of the proposed method is compared with other existing clustering techniques like K-means, GA-K-means, and PSO-K-means.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Hartigan, J.A.: Clustering algorithms. 1975, Wiley, New York Hartigan, J.A.: Clustering algorithms. 1975, Wiley, New York
2.
Zurück zum Zitat Hartigan, J.A., Wong, M.A.: Algorithm AS 136: A K-means clustering algorithm. J. Royal Stat. Soc. C 28(1), 100–108. JSTOR 2346830 (1979) Hartigan, J.A., Wong, M.A.: Algorithm AS 136: A K-means clustering algorithm. J. Royal Stat. Soc. C 28(1), 100–108. JSTOR 2346830 (1979)
4.
Zurück zum Zitat Sha, M., Yang, H.: Speaker recognition based on APSO-K-means clustering algorithm. In: International Conference on Artificial Intelligence and Computational Intelligence, (2009). doi: 10.1109/AICI.2009.17 Sha, M., Yang, H.: Speaker recognition based on APSO-K-means clustering algorithm. In: International Conference on Artificial Intelligence and Computational Intelligence, (2009). doi: 10.​1109/​AICI.​2009.​17
5.
Zurück zum Zitat Kader, A.R.F.: Genetically improved PSO algorithm for efficient data clustering. In: Second International Conference on Machine Learning and Computing, 2010. doi:10.1109/ICMLC.2010.19 (2010) Kader, A.R.F.: Genetically improved PSO algorithm for efficient data clustering. In: Second International Conference on Machine Learning and Computing, 2010. doi:10.​1109/​ICMLC.​2010.​19 (2010)
7.
Zurück zum Zitat Youguo, L., Haiyan, W.: A clustering method based on K-means algorithm. Phys. Procedia 25, 1104–1109 (2012)CrossRef Youguo, L., Haiyan, W.: A clustering method based on K-means algorithm. Phys. Procedia 25, 1104–1109 (2012)CrossRef
8.
Zurück zum Zitat Naik, B., Swetanisha, S., Behera, D. K., Mahapatra, S., Padhi, B.K.: Cooperative swarm based clustering algorithm based on PSO and k-means to find optimal cluster centroids. In: National Conference on Computing and Communication Systems (NCCCS), pp. 1–5 (2012). doi:10.1109/NCCCS.2012.6413027 (2012) Naik, B., Swetanisha, S., Behera, D. K., Mahapatra, S., Padhi, B.K.: Cooperative swarm based clustering algorithm based on PSO and k-means to find optimal cluster centroids. In: National Conference on Computing and Communication Systems (NCCCS), pp. 1–5 (2012). doi:10.​1109/​NCCCS.​2012.​6413027 (2012)
9.
Zurück zum Zitat Govindarajan, K., Somasundaram, T.S. Vivekanandan, K.S.K.: Particle swarm optimization (PSO)-based clustering for improving the quality of learning using cloud computing. In: IEEE 13th International Conference on Advanced Learning Technologies, pp. 495–497 (2013). doi:10.1109/ICALT.2013.160 (2013) Govindarajan, K., Somasundaram, T.S. Vivekanandan, K.S.K.: Particle swarm optimization (PSO)-based clustering for improving the quality of learning using cloud computing. In: IEEE 13th International Conference on Advanced Learning Technologies, pp. 495–497 (2013). doi:10.​1109/​ICALT.​2013.​160 (2013)
10.
11.
Zurück zum Zitat Bai, L., Liang, J., Chao, S., Dang, C.: Fast global k-means clustering based on local geometrical information. Inf. Sci. 245, 168–180 (2013)CrossRef Bai, L., Liang, J., Chao, S., Dang, C.: Fast global k-means clustering based on local geometrical information. Inf. Sci. 245, 168–180 (2013)CrossRef
12.
Zurück zum Zitat Liao, K., Liu, G., Xiao, L., Chaoteng L.: A sample-based hierarchical adaptive K-means clustering method for large-scale video retrieval. Knowl.-Based Syst. 49, 123–133 (2013) Liao, K., Liu, G., Xiao, L., Chaoteng L.: A sample-based hierarchical adaptive K-means clustering method for large-scale video retrieval. Knowl.-Based Syst. 49, 123–133 (2013)
13.
Zurück zum Zitat Jaganathan, P., Jaiganesh, S.: An improved K-means algorithm combined with Particle Swarm Optimization approach for efficient web document clustering, pp. 772–776, (2013). doi:10.1109/ICGCE.2013.6823538 Jaganathan, P., Jaiganesh, S.: An improved K-means algorithm combined with Particle Swarm Optimization approach for efficient web document clustering, pp. 772–776, (2013). doi:10.​1109/​ICGCE.​2013.​6823538
14.
Zurück zum Zitat Yao, H., Duan, Q., Li, D., Wang, L.: An improved K-means clustering algorithm for fish image segmentation. Math. Comput. Model. 58, 790–798 (2013)MATHCrossRef Yao, H., Duan, Q., Li, D., Wang, L.: An improved K-means clustering algorithm for fish image segmentation. Math. Comput. Model. 58, 790–798 (2013)MATHCrossRef
15.
Zurück zum Zitat Monedero, D.R., Solé, M., Nin, J., Forné, J.: A modification of the k-means method for quasi-unsupervised learning. Knowl.-Based Syst. 37, 176–185 (2013)CrossRef Monedero, D.R., Solé, M., Nin, J., Forné, J.: A modification of the k-means method for quasi-unsupervised learning. Knowl.-Based Syst. 37, 176–185 (2013)CrossRef
16.
Zurück zum Zitat Shahbaba, M., Beheshti, S.: MACE-means clustering. Sig. Process. 105, 216–225 (2014)CrossRef Shahbaba, M., Beheshti, S.: MACE-means clustering. Sig. Process. 105, 216–225 (2014)CrossRef
17.
Zurück zum Zitat Naldi, M.C., Campello, R.J.G.B.: Evolutionary k-means for distributed datasets. Neurocomputing 127, 30–42 (2014)CrossRef Naldi, M.C., Campello, R.J.G.B.: Evolutionary k-means for distributed datasets. Neurocomputing 127, 30–42 (2014)CrossRef
18.
Zurück zum Zitat Scitovski, R., Sabo, K.: Analysis of the k-means algorithm in the case of data points occurring on the border of two or more clusters, Knowl.-Based Syst. 57, 1–7 (2014) Scitovski, R., Sabo, K.: Analysis of the k-means algorithm in the case of data points occurring on the border of two or more clusters, Knowl.-Based Syst. 57, 1–7 (2014)
19.
Zurück zum Zitat Pavithra, M.S.: Aradhya Manjunath VN : A comprehensive of transforms, Gabor filter and k-means clustering for text detection in images and video. Appl. Comput. Inf. (2014). doi:10.1016/j.aci.2014.08.001 Pavithra, M.S.: Aradhya Manjunath VN : A comprehensive of transforms, Gabor filter and k-means clustering for text detection in images and video. Appl. Comput. Inf. (2014). doi:10.​1016/​j.​aci.​2014.​08.​001
20.
Zurück zum Zitat Kennedy, J., Eberhart, R.: Particle swarm optimization, In: Proceedings of the 1995 IEEE International Conference on Neural Networks, vol. 4,1942–1948 (1995) Kennedy, J., Eberhart, R.: Particle swarm optimization, In: Proceedings of the 1995 IEEE International Conference on Neural Networks, vol. 4,1942–1948 (1995)
21.
Zurück zum Zitat Wei, J., Guangbin, L., Dong, L.: Elite particle swarm optimization with mutation. In: IEEE Asia Simulation Conference—7th International Conference on System Simulation and Scientific Computing, pp. 800–803 (2008) Wei, J., Guangbin, L., Dong, L.: Elite particle swarm optimization with mutation. In: IEEE Asia Simulation Conference—7th International Conference on System Simulation and Scientific Computing, pp. 800–803 (2008)
22.
Zurück zum Zitat Khare, A., Rangnekar, S.: A review of particle swarm optimization and its applications in solar photovoltaic system. Appl. Soft Comput. 13, 2997–3006 (2013)CrossRef Khare, A., Rangnekar, S.: A review of particle swarm optimization and its applications in solar photovoltaic system. Appl. Soft Comput. 13, 2997–3006 (2013)CrossRef
23.
Zurück zum Zitat Babaei, M.: A general approach to approximate solutions of nonlinear differential equations using particle swarm optimization. Appl. Soft Comput. 13, 3354–3365 (2013)CrossRef Babaei, M.: A general approach to approximate solutions of nonlinear differential equations using particle swarm optimization. Appl. Soft Comput. 13, 3354–3365 (2013)CrossRef
24.
25.
Zurück zum Zitat Nayak, J., Naik, B., Kanungo, D.P., Behera, H.S.: An improved swarm based hybrid k-means clustering for optimal cluster centers. In: Information Systems Design and Intelligent Applications, pp. 545–553. Springer, (2015) Nayak, J., Naik, B., Kanungo, D.P., Behera, H.S.: An improved swarm based hybrid k-means clustering for optimal cluster centers. In: Information Systems Design and Intelligent Applications, pp. 545–553. Springer, (2015)
26.
Zurück zum Zitat Yue-bo, M., Jian-hua, Z., Xu-sheng, G., Liang, Z.: Research on WNN aerodynamic modeling from flight data based on improved PSO algorithm. Neurocomputing 83, 212–221 (2012) Yue-bo, M., Jian-hua, Z., Xu-sheng, G., Liang, Z.: Research on WNN aerodynamic modeling from flight data based on improved PSO algorithm. Neurocomputing 83, 212–221 (2012)
27.
Zurück zum Zitat Dehuri, S., Roy, R., Cho, S.B., Ghosh, A.: An improved swarm optimized functional link artificial neural network (ISO-FLANN) for classification. J. Syst. Softw. 85, 1333–1345 (2012)CrossRef Dehuri, S., Roy, R., Cho, S.B., Ghosh, A.: An improved swarm optimized functional link artificial neural network (ISO-FLANN) for classification. J. Syst. Softw. 85, 1333–1345 (2012)CrossRef
28.
Zurück zum Zitat Kanungo, D.P., Naik, B., Nayak, J., Baboo, S., Behera, H.S.: An improved PSO based back propagation learning—MLP(IPSO-BP-MLP) for classification, Smart Innovation, Systems and Technologies 31, doi:10.1007/978-81-322-2205-7_32 (2015) Kanungo, D.P., Naik, B., Nayak, J., Baboo, S., Behera, H.S.: An improved PSO based back propagation learning—MLP(IPSO-BP-MLP) for classification, Smart Innovation, Systems and Technologies 31, doi:10.​1007/​978-81-322-2205-7_​32 (2015)
Metadaten
Titel
Evolutionary Improved Swarm-Based Hybrid K-Means Algorithm for Cluster Analysis
verfasst von
Janmenjoy Nayak
D. P. Kanungo
Bighnaraj Naik
H. S. Behera
Copyright-Jahr
2016
Verlag
Springer India
DOI
https://doi.org/10.1007/978-81-322-2517-1_34