Skip to main content
Top
Published in: Soft Computing 12/2015

05-06-2015 | Focus

Hybridization of magnetic charge system search and particle swarm optimization for efficient data clustering using neighborhood search strategy

Authors: Y. Kumar, G. Sahoo

Published in: Soft Computing | Issue 12/2015

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Clustering is a popular data analysis technique, which is applied for partitioning of datasets. The aim of clustering is to arrange the data items into clusters based on the values of their attributes. Magnetic charge system search (MCSS) algorithm is a new meta-heuristic optimization algorithm inspired by the electromagnetic theory. It has been proved better than other meta-heuristics. This paper presents a new hybrid meta-heuristic algorithm by combining both MCSS and particle swarm optimization (PSO) algorithms, which is called MCSS–PSO, for partitional clustering problem. Moreover, a neighborhood search strategy is also incorporated in this algorithm to generate more promising solutions. The performance of the proposed MCSS–PSO algorithm is tested on several benchmark datasets and its performance is compared with already existing clustering algorithms such as K-means, PSO, genetic algorithm, ant colony optimization, charge system search, chaotic charge system search algorithm, and some PSO variants. From the experimental results, it can be seen that performance of the proposed algorithm is better than the other algorithms being compared and it can be effectively used for partitional clustering problem.

Dont have a licence yet? Then find out more about our products and how to get one now:

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 "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!

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!

Literature
go back to reference Abraham A, Das S, Roy S (2007) Swarm intelligence algorithms for data clustering. In: Soft computing for knowledge discovery and data mining, part IV. Springer, Berlin, pp 79–313 Abraham A, Das S, Roy S (2007) Swarm intelligence algorithms for data clustering. In: Soft computing for knowledge discovery and data mining, part IV. Springer, Berlin, pp 79–313
go back to reference Alpaydin E (2004) Introduction to machine learning. MIT Press, Cambridge Alpaydin E (2004) Introduction to machine learning. MIT Press, Cambridge
go back to reference Anderberg MR (1973) Cluster analysis for application. Academic Press, New York Anderberg MR (1973) Cluster analysis for application. Academic Press, New York
go back to reference Ankerst M, Breunig M, Kriegel HP, Sander J (1999) OPTICS: ordering points to identify the clustering structure. In: Proceedings of the 1999 ACM-SIGMOD international conference on management of data, Philadelphia, pp 49–60 Ankerst M, Breunig M, Kriegel HP, Sander J (1999) OPTICS: ordering points to identify the clustering structure. In: Proceedings of the 1999 ACM-SIGMOD international conference on management of data, Philadelphia, pp 49–60
go back to reference Archer J, Robertson DL (2007) CTree: comparison of clusters between phylogenetic trees made easy. Bioinformatics 23(21):2952–2953CrossRef Archer J, Robertson DL (2007) CTree: comparison of clusters between phylogenetic trees made easy. Bioinformatics 23(21):2952–2953CrossRef
go back to reference Ball G, Hall D (1967) A clustering technique for summarizing multivariate data. Behav Sci 12:153–155CrossRef Ball G, Hall D (1967) A clustering technique for summarizing multivariate data. Behav Sci 12:153–155CrossRef
go back to reference Basu S, Davidson I, Wagstaff K (2008) Constrained clustering: advances in algorithms. In: Theory and applications, data mining and knowledge discovery. Chapman and Hall/CRC, London Basu S, Davidson I, Wagstaff K (2008) Constrained clustering: advances in algorithms. In: Theory and applications, data mining and knowledge discovery. Chapman and Hall/CRC, London
go back to reference Bezdek J (1981) Pattern recognition with fuzzy objective function algorithms. Advanced applications in pattern recognition. Plenum Press, New YorkCrossRef Bezdek J (1981) Pattern recognition with fuzzy objective function algorithms. Advanced applications in pattern recognition. Plenum Press, New YorkCrossRef
go back to reference Bezdek JC, Boggavarapu S, Hall LO, Bensaid A (1994) Genetic algorithm guided clustering. In: IEEE World Congress on computational intelligence and evolutionary computation, pp 34–39 Bezdek JC, Boggavarapu S, Hall LO, Bensaid A (1994) Genetic algorithm guided clustering. In: IEEE World Congress on computational intelligence and evolutionary computation, pp 34–39
go back to reference Bottou L, Vapnik V (1992) Local learning algorithms. Neural Comput 4(6):888–900CrossRef Bottou L, Vapnik V (1992) Local learning algorithms. Neural Comput 4(6):888–900CrossRef
go back to reference Carpenter GA, Grossberg S (1987) A massively parallel architecture for a self-organizing neural pattern recognition machine. Comput Vis Graph Image Process 37:54–115MATHCrossRef Carpenter GA, Grossberg S (1987) A massively parallel architecture for a self-organizing neural pattern recognition machine. Comput Vis Graph Image Process 37:54–115MATHCrossRef
go back to reference Celeux G, Govaert G (1995) Gaussian parsimonious clustering models. Pattern Recog 28(5):781–793CrossRef Celeux G, Govaert G (1995) Gaussian parsimonious clustering models. Pattern Recog 28(5):781–793CrossRef
go back to reference Cheeseman P, Stutz J (1996) Bayesian classification (AutoClass): theory and results. In: Fayyard UM, Piatetsky-Shapiro G, Smyth P, Uthurusamy R (eds) Advances in knowledge discovery and data mining. AAAI/MIT Press, Cambridge Cheeseman P, Stutz J (1996) Bayesian classification (AutoClass): theory and results. In: Fayyard UM, Piatetsky-Shapiro G, Smyth P, Uthurusamy R (eds) Advances in knowledge discovery and data mining. AAAI/MIT Press, Cambridge
go back to reference Chechik G, Globerson A, Tishby N, Weiss Y (2005) Information bottleneck for Gaussian variables. J Mach Learn Res 6:165–188MATHMathSciNet Chechik G, Globerson A, Tishby N, Weiss Y (2005) Information bottleneck for Gaussian variables. J Mach Learn Res 6:165–188MATHMathSciNet
go back to reference Chen S (1995) Nonlinear time series modelling and prediction using Gaussian RBF networks with enhanced clustering and RLS learning. Electron Lett 31(2):117–118CrossRef Chen S (1995) Nonlinear time series modelling and prediction using Gaussian RBF networks with enhanced clustering and RLS learning. Electron Lett 31(2):117–118CrossRef
go back to reference Chi SC, Yang CC (2006) Integration of ant colony SOM and k-means for clustering analysis. In: Knowledge-based intelligent information and engineering systems. Springer, Berlin, pp 1–8 Chi SC, Yang CC (2006) Integration of ant colony SOM and k-means for clustering analysis. In: Knowledge-based intelligent information and engineering systems. Springer, Berlin, pp 1–8
go back to reference Chen CY, Ye F (2004) Particle swarm optimization algorithm and its application to clustering analysis. In: IEEE international conference on networking, sensing and control, vol 2, pp 789–794 Chen CY, Ye F (2004) Particle swarm optimization algorithm and its application to clustering analysis. In: IEEE international conference on networking, sensing and control, vol 2, pp 789–794
go back to reference Dalli A (2003) Adaptation of the F-measure to cluster based lexicon quality evaluation. In: Proceedings of the EACL, pp 51–60 Dalli A (2003) Adaptation of the F-measure to cluster based lexicon quality evaluation. In: Proceedings of the EACL, pp 51–60
go back to reference Das S, Abraham A, Konar A (2009) Meta-heuristic clustering. Springer, Berlin Das S, Abraham A, Konar A (2009) Meta-heuristic clustering. Springer, Berlin
go back to reference Dawyndt P, De Meyer H, De Baets B (2006) UPGMA clustering revisited: a weight-driven approach to transitive approximation. Int J Approx Reason 42(3):174–191MATHCrossRef Dawyndt P, De Meyer H, De Baets B (2006) UPGMA clustering revisited: a weight-driven approach to transitive approximation. Int J Approx Reason 42(3):174–191MATHCrossRef
go back to reference Day WH, Edelsbrunner H (1984) Efficient algorithms for agglomerative hierarchical clustering methods. J Classif 1(1):7–24MATHCrossRef Day WH, Edelsbrunner H (1984) Efficient algorithms for agglomerative hierarchical clustering methods. J Classif 1(1):7–24MATHCrossRef
go back to reference Demiroz G, Guvenir A (1997) Classification by voting feature intervals. In: Proceedings of the seventh european conference on machine learning, pp 85–92 Demiroz G, Guvenir A (1997) Classification by voting feature intervals. In: Proceedings of the seventh european conference on machine learning, pp 85–92
go back to reference Demsar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1–30MATHMathSciNet Demsar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1–30MATHMathSciNet
go back to reference Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18CrossRef Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18CrossRef
go back to reference Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B: Cybern 26(1):29–41 Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B: Cybern 26(1):29–41
go back to reference Dunn WJ III, Greenberg MJ, Soledad SC (1976) Use of cluster analysis in the development of structure–activity relations for antitumor triazenes. J Med Chem 19(11):1299–1301CrossRef Dunn WJ III, Greenberg MJ, Soledad SC (1976) Use of cluster analysis in the development of structure–activity relations for antitumor triazenes. J Med Chem 19(11):1299–1301CrossRef
go back to reference Erol OK, Eksin I (2006) A new optimization method: big bang-big crunch. Adv Eng Softw 37(2):106–111CrossRef Erol OK, Eksin I (2006) A new optimization method: big bang-big crunch. Adv Eng Softw 37(2):106–111CrossRef
go back to reference Esmin AAA, Matwin S (2012) Data clustering using hybrid particle swarm optimization. In: Lecture notes in computer science, pp 159–166 Esmin AAA, Matwin S (2012) Data clustering using hybrid particle swarm optimization. In: Lecture notes in computer science, pp 159–166
go back to reference Ester M, Kriegel HP, Sander J, Xu X (1996) A density based algorithm for discovering clusters in large spatial databases. In: Proceedings of the 1996 international conference on knowledge discovery and data mining (KDD’96), Portland, pp 226–231 Ester M, Kriegel HP, Sander J, Xu X (1996) A density based algorithm for discovering clusters in large spatial databases. In: Proceedings of the 1996 international conference on knowledge discovery and data mining (KDD’96), Portland, pp 226–231
go back to reference Fraley C, Raftery AE (1999) MCLUST: software for model-based cluster analysis. J Classif 16(2):297–306MATHCrossRef Fraley C, Raftery AE (1999) MCLUST: software for model-based cluster analysis. J Classif 16(2):297–306MATHCrossRef
go back to reference Guha S, Rastogi R, Shim K (1998) CURE: an efficient clustering algorithm for large databases. In: Proceedings of the ACM SIGMOD int. conf. management of data, pp 73–84 Guha S, Rastogi R, Shim K (1998) CURE: an efficient clustering algorithm for large databases. In: Proceedings of the ACM SIGMOD int. conf. management of data, pp 73–84
go back to reference Guha S, Rastogi R, Shim K (2000) ROCK: a robust clustering algorithm for categorical attributes. Inf Syst 25(5):345–366CrossRef Guha S, Rastogi R, Shim K (2000) ROCK: a robust clustering algorithm for categorical attributes. Inf Syst 25(5):345–366CrossRef
go back to reference García S, Fernández A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power. Inf Sci 180(10):2044–2064CrossRef García S, Fernández A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power. Inf Sci 180(10):2044–2064CrossRef
go back to reference Gao W, Liu SY, Huang LL (2013) A novel artificial bee colony algorithm with Powell’s method. Appl Soft Comput 13(9):3763–3775CrossRef Gao W, Liu SY, Huang LL (2013) A novel artificial bee colony algorithm with Powell’s method. Appl Soft Comput 13(9):3763–3775CrossRef
go back to reference Handl J, Knowles J, Dorigo M (2003) On the performance of ant-based clustering. In: Design and application of hybrid intelligent system. Frontiers in artificial intelligence and applications, vol 104, pp 204–213 Handl J, Knowles J, Dorigo M (2003) On the performance of ant-based clustering. In: Design and application of hybrid intelligent system. Frontiers in artificial intelligence and applications, vol 104, pp 204–213
go back to reference Hassoun MH (1995) Fundamentals of artificial neural networks. The MIT Press, Cambridge Hassoun MH (1995) Fundamentals of artificial neural networks. The MIT Press, Cambridge
go back to reference He Y, Pan W, Jizhen L (2006) Cluster analysis using multivariate normal mixture models to detect differential gene expression with microarray data. Comput Stat Data Anal 51(2):641–658MATHCrossRef He Y, Pan W, Jizhen L (2006) Cluster analysis using multivariate normal mixture models to detect differential gene expression with microarray data. Comput Stat Data Anal 51(2):641–658MATHCrossRef
go back to reference Hruschka ER, Campello RJGB, Freitas AA, De Carvalho ACPLF (2009) A survey of evolutionary algorithms for clustering. IEEE Trans Syst Man Cybern Part C Appl Rev 39(2):133–155 Hruschka ER, Campello RJGB, Freitas AA, De Carvalho ACPLF (2009) A survey of evolutionary algorithms for clustering. IEEE Trans Syst Man Cybern Part C Appl Rev 39(2):133–155
go back to reference Huang KY (2011) A hybrid particle swarm optimization approach for clustering and classification of datasets. Knowl Based Syst 24:420–426CrossRef Huang KY (2011) A hybrid particle swarm optimization approach for clustering and classification of datasets. Knowl Based Syst 24:420–426CrossRef
go back to reference Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recogn Lett 31:651–666CrossRef Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recogn Lett 31:651–666CrossRef
go back to reference Jain AK, Dubes RC (1988) Algorithms clustering data. Prentice-Hall, Englewood cliffsMATH Jain AK, Dubes RC (1988) Algorithms clustering data. Prentice-Hall, Englewood cliffsMATH
go back to reference Jensen F (1996) An introduction to bayesian networks. UCL Press/Springer, Berlin Jensen F (1996) An introduction to bayesian networks. UCL Press/Springer, Berlin
go back to reference Jiang H, Yi S, Li J, Yang F, Hu X (2010) Ant clustering algorithm with K-harmonic means clustering. Expert Syst Appl 37(12):8679–8684CrossRef Jiang H, Yi S, Li J, Yang F, Hu X (2010) Ant clustering algorithm with K-harmonic means clustering. Expert Syst Appl 37(12):8679–8684CrossRef
go back to reference Jiang H, Li J, Yi S, Wang X, Hu X (2011) A new hybrid method based on partitioning-based DBSCAN and ant clustering. Expert Syst Appl 38(8):9373–9381CrossRef Jiang H, Li J, Yi S, Wang X, Hu X (2011) A new hybrid method based on partitioning-based DBSCAN and ant clustering. Expert Syst Appl 38(8):9373–9381CrossRef
go back to reference Kao Y, Cheng K (2006) Ant colony optimization and swarm intelligence., An ACO-based clustering algorithm Springer, Berlin Kao Y, Cheng K (2006) Ant colony optimization and swarm intelligence., An ACO-based clustering algorithm Springer, Berlin
go back to reference Kao YT, Zahara E, Kao IW (2008) A hybridized approach to data clustering. Exp Syst Appl 34(3):1754–1762CrossRef Kao YT, Zahara E, Kao IW (2008) A hybridized approach to data clustering. Exp Syst Appl 34(3):1754–1762CrossRef
go back to reference Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J Global Optim 39(3):459–471MATHMathSciNetCrossRef Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J Global Optim 39(3):459–471MATHMathSciNetCrossRef
go back to reference Karaboga D, Ozturk C (2011) A novel clustering approach: artificial bee colony (ABC) algorithm. Appl Soft Comput 11:652–657CrossRef Karaboga D, Ozturk C (2011) A novel clustering approach: artificial bee colony (ABC) algorithm. Appl Soft Comput 11:652–657CrossRef
go back to reference Kaufman L, Rousseeuw P (1990) Finding groups in data: an introduction to cluster analysis. Wiley, New York Kaufman L, Rousseeuw P (1990) Finding groups in data: an introduction to cluster analysis. Wiley, New York
go back to reference Kaveh A, Talatahari S (2010) A novel heuristic optimization method: charged system search. Acta Mechanica 213(3–4):267–289MATHCrossRef Kaveh A, Talatahari S (2010) A novel heuristic optimization method: charged system search. Acta Mechanica 213(3–4):267–289MATHCrossRef
go back to reference Kaveh A, Laknejadi A (2011) A novel hybrid charge system search and particle swarm optimization method for multi-objective optimization. Exp Syst Appl 38:15475–15488CrossRef Kaveh A, Laknejadi A (2011) A novel hybrid charge system search and particle swarm optimization method for multi-objective optimization. Exp Syst Appl 38:15475–15488CrossRef
go back to reference Kaveh A, Share AMAM, Moslehi M (2013) Magnetic charged system search: a new meta-heuristic algorithm for optimization. Acta Mechanica 224(1):85–107MATHCrossRef Kaveh A, Share AMAM, Moslehi M (2013) Magnetic charged system search: a new meta-heuristic algorithm for optimization. Acta Mechanica 224(1):85–107MATHCrossRef
go back to reference Kaveh A, Mirzaeib B, Jafarvand A (2015) An improved magnetic charged system search for optimization of truss structures with continuous and discrete variables. Appl Soft Comput 28:400–410CrossRef Kaveh A, Mirzaeib B, Jafarvand A (2015) An improved magnetic charged system search for optimization of truss structures with continuous and discrete variables. Appl Soft Comput 28:400–410CrossRef
go back to reference Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceeding of IEEE international conference on neural networks (ICW), IV, pp 1942–1948 Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceeding of IEEE international conference on neural networks (ICW), IV, pp 1942–1948
go back to reference Krishna K, Murty MN (1999) Genetic k-means algorithm. IEEE Trans Syst Man Cybern Part B Cybern 29(3):433–439CrossRef Krishna K, Murty MN (1999) Genetic k-means algorithm. IEEE Trans Syst Man Cybern Part B Cybern 29(3):433–439CrossRef
go back to reference Kumar Y, Sahoo G (2014a) A charged system search approach for data clustering. Progress Artif Intell 2(2–3):53–166 Kumar Y, Sahoo G (2014a) A charged system search approach for data clustering. Progress Artif Intell 2(2–3):53–166
go back to reference Kumar Y, Sahoo G (2014b) A chaotic charged system search approach for data clustering. Informatica 38(3):149–61 Kumar Y, Sahoo G (2014b) A chaotic charged system search approach for data clustering. Informatica 38(3):149–61
go back to reference Kumar Y, Sahoo G (2014c) A hybridize approach for data clustering based on cat swarm optimization. Int J Inf Commun Technol (in Press) Kumar Y, Sahoo G (2014c) A hybridize approach for data clustering based on cat swarm optimization. Int J Inf Commun Technol (in Press)
go back to reference Kumar Y, Sahoo G (2015) An improved cat swarm optimization algorithm for clustering. Comput Intell Data Min 1:187–197 Kumar Y, Sahoo G (2015) An improved cat swarm optimization algorithm for clustering. Comput Intell Data Min 1:187–197
go back to reference Kuo RJ, Lin LM (2010) Application of a hybrid of genetic algorithm and particle swarm optimization algorithm for order clustering. Dec Support Syst 49:451–462 Kuo RJ, Lin LM (2010) Application of a hybrid of genetic algorithm and particle swarm optimization algorithm for order clustering. Dec Support Syst 49:451–462
go back to reference Lu Y, Lu S, Fotouhi F, Deng Y, Brown SJ (2004) FGKA: a fast genetic k-means clustering algorithm. In: Proceedings of the ACM symposium on applied computing, pp 622–623 Lu Y, Lu S, Fotouhi F, Deng Y, Brown SJ (2004) FGKA: a fast genetic k-means clustering algorithm. In: Proceedings of the ACM symposium on applied computing, pp 622–623
go back to reference MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol 1, pp 281–297 MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol 1, pp 281–297
go back to reference Maulik U, Bandyopadhyay S (2000) Genetic algorithm-based clustering technique. Pattern Recognit 33(9):1455–1465CrossRef Maulik U, Bandyopadhyay S (2000) Genetic algorithm-based clustering technique. Pattern Recognit 33(9):1455–1465CrossRef
go back to reference Maulik U, Mukhopadhyay A (2010) Simulated annealing based automatic fuzzy clustering combined with ANN classification for analyzing microarray data. Comput Oper Res 37(8):1369–1380MATHCrossRef Maulik U, Mukhopadhyay A (2010) Simulated annealing based automatic fuzzy clustering combined with ANN classification for analyzing microarray data. Comput Oper Res 37(8):1369–1380MATHCrossRef
go back to reference McLachlan G, Krishnan T (1997) The EM algorithm and extensions. Wiley, New YorkMATH McLachlan G, Krishnan T (1997) The EM algorithm and extensions. Wiley, New YorkMATH
go back to reference Milan S, Hlavac V, Boyle R (1998) Image processing, analysis, and machine vision, 4th edn. Chapman and Hall, London Milan S, Hlavac V, Boyle R (1998) Image processing, analysis, and machine vision, 4th edn. Chapman and Hall, London
go back to reference Mullen Robert J, Monekosso Dorothy, Barman Sarah, Remagnino Paolo (2009) A review of ant algorithms. Exp Syst Appl 36(6):9608–9617CrossRef Mullen Robert J, Monekosso Dorothy, Barman Sarah, Remagnino Paolo (2009) A review of ant algorithms. Exp Syst Appl 36(6):9608–9617CrossRef
go back to reference Murthy CA, Chowdhury N (1996) In search of optimal clusters using genetic algorithms. Pattern Recognit Lett 17(8):825–832 Murthy CA, Chowdhury N (1996) In search of optimal clusters using genetic algorithms. Pattern Recognit Lett 17(8):825–832
go back to reference Niknam T, Amiri B (2010) An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Appl Soft Comput 10:183–197CrossRef Niknam T, Amiri B (2010) An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Appl Soft Comput 10:183–197CrossRef
go back to reference Price MN, Dehal PS, Arkin AP (2009) FastTree: computing large minimum evolution trees with profiles instead of a distance matrix. Mol Biol Evol 26(7):1641–1650 Price MN, Dehal PS, Arkin AP (2009) FastTree: computing large minimum evolution trees with profiles instead of a distance matrix. Mol Biol Evol 26(7):1641–1650
go back to reference Rao RV, Savsani VJ, Vakharia DP (2011) Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput-Aided Des 43(3):303–315CrossRef Rao RV, Savsani VJ, Vakharia DP (2011) Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput-Aided Des 43(3):303–315CrossRef
go back to reference Sahoo AJ, Kumar Y (2014) Advances in signal processing and intelligent recognition systems., Modified teacher learning based optimization method for data clusteringSpringer, Berlin Sahoo AJ, Kumar Y (2014) Advances in signal processing and intelligent recognition systems., Modified teacher learning based optimization method for data clusteringSpringer, Berlin
go back to reference Santosa B, Ningrum MK (2009) Cat swarm optimization for clustering. In: International conference on soft computing and pattern recognition (SOCPAR’09), pp 54–59 Santosa B, Ningrum MK (2009) Cat swarm optimization for clustering. In: International conference on soft computing and pattern recognition (SOCPAR’09), pp 54–59
go back to reference Satapathy SC, Naik A (2011) Data clustering based on teaching-learning-based optimization. In: Swarm, evolutionary, and memetic computing. Springer, Berlin, pp 148–56 Satapathy SC, Naik A (2011) Data clustering based on teaching-learning-based optimization. In: Swarm, evolutionary, and memetic computing. Springer, Berlin, pp 148–56
go back to reference Sarafrazi S, Nezamabadi-pour H, Saryazdi S (2011) Disruption: a new operator in gravitational search algorithm. Scien-tia Iranica D 18(3):539–548 Sarafrazi S, Nezamabadi-pour H, Saryazdi S (2011) Disruption: a new operator in gravitational search algorithm. Scien-tia Iranica D 18(3):539–548
go back to reference Selim SZ, Alsultan K (1991) A simulated annealing algorithm for the clustering problem. Pattern Recognit 24(10):1003–1008MathSciNetCrossRef Selim SZ, Alsultan K (1991) A simulated annealing algorithm for the clustering problem. Pattern Recognit 24(10):1003–1008MathSciNetCrossRef
go back to reference Shelokar PS, Jayaraman VK, Kulkarni BD (2004) An ant colony approach for clustering. Analytica Chimica Acta 509(2):187–95CrossRef Shelokar PS, Jayaraman VK, Kulkarni BD (2004) An ant colony approach for clustering. Analytica Chimica Acta 509(2):187–95CrossRef
go back to reference Sinha AN, Das N, Sahoo G (2007) Ant colony based hybrid optimization for data clustering. Kybernetes 36(2):175–191 Sinha AN, Das N, Sahoo G (2007) Ant colony based hybrid optimization for data clustering. Kybernetes 36(2):175–191
go back to reference Sneath P (1957) The application of computers to taxonomy. J Gen Microbiol 17:201–226CrossRef Sneath P (1957) The application of computers to taxonomy. J Gen Microbiol 17:201–226CrossRef
go back to reference Sokal R, Michener C (1958) A statistical method for evaluating systematic relationships. Univ Kansas Sci Bull 38:1409–1438 Sokal R, Michener C (1958) A statistical method for evaluating systematic relationships. Univ Kansas Sci Bull 38:1409–1438
go back to reference Sorensen T (1948) A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyzes of the vegetation on Danish commons. Biologiske Skrifter 5:1–34 Sorensen T (1948) A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyzes of the vegetation on Danish commons. Biologiske Skrifter 5:1–34
go back to reference Sung CS, Jin HW (2000) A tabu-search-based heuristic for clustering. Pattern Recognit 33(5):849–858 Sung CS, Jin HW (2000) A tabu-search-based heuristic for clustering. Pattern Recognit 33(5):849–858
go back to reference Tsai CF, Tsai CW, Wu HC, Yang T (2004) ACODF: a novel data clustering approach for data mining in large databases. J Syst Softw 73(1):133–145 Tsai CF, Tsai CW, Wu HC, Yang T (2004) ACODF: a novel data clustering approach for data mining in large databases. J Syst Softw 73(1):133–145
go back to reference Teppola P, Mujunen SP, Minkkinen P (1999) Adaptive fuzzy C-means clustering in process monitoring. In: Chemometrics and intelligent laboratory systems 45(1):23–28 Teppola P, Mujunen SP, Minkkinen P (1999) Adaptive fuzzy C-means clustering in process monitoring. In: Chemometrics and intelligent laboratory systems 45(1):23–28
go back to reference Trelea IC (2003) The particle swarm optimization algorithm: convergence analysis and parameter selection. Inf Process Lett 85:317–325MATHMathSciNetCrossRef Trelea IC (2003) The particle swarm optimization algorithm: convergence analysis and parameter selection. Inf Process Lett 85:317–325MATHMathSciNetCrossRef
go back to reference Tseng LY, Yang SB (1997) Genetic algorithms for clustering, feature selection and classification. IEEE Int Conf Neural Netw 3:1612–1616 Tseng LY, Yang SB (1997) Genetic algorithms for clustering, feature selection and classification. IEEE Int Conf Neural Netw 3:1612–1616
go back to reference Tseng LY, Yang SB (2001) A genetic approach to the automatic clustering problem. Pattern Recognit 34(2):415–424MATHCrossRef Tseng LY, Yang SB (2001) A genetic approach to the automatic clustering problem. Pattern Recognit 34(2):415–424MATHCrossRef
go back to reference Wang W, Yang J, Muntz R (1997) STING: a statistical information grid approach to spatial data mining. In: Proceedings of the 1997 international conference on very large data base (VLDB’97), Athens, Greek, pp 186–195 Wang W, Yang J, Muntz R (1997) STING: a statistical information grid approach to spatial data mining. In: Proceedings of the 1997 international conference on very large data base (VLDB’97), Athens, Greek, pp 186–195
go back to reference Webb GI (2000) Multiboosting: a technique for combining boosting and wagging. Mach Learn 40(2):159–196CrossRef Webb GI (2000) Multiboosting: a technique for combining boosting and wagging. Mach Learn 40(2):159–196CrossRef
go back to reference Xu R, Wunsch DC (2009) Clustering. Oxford, Wiley Xu R, Wunsch DC (2009) Clustering. Oxford, Wiley
go back to reference Yan X, Zhu Y, Zou W, Wang L (2012) A new approach for data clustering using hybrid artificial bee colony algorithm. Neuro Comput 97:241–250 Yan X, Zhu Y, Zou W, Wang L (2012) A new approach for data clustering using hybrid artificial bee colony algorithm. Neuro Comput 97:241–250
go back to reference Yang Y, Kamel MS (2006) An aggregated clustering approach using multi-ant colonies algorithms. Pattern Recognit 39(7):1278–1289MATHCrossRef Yang Y, Kamel MS (2006) An aggregated clustering approach using multi-ant colonies algorithms. Pattern Recognit 39(7):1278–1289MATHCrossRef
go back to reference Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases. In: Proceedings of the ACM SIGMOD conference on management of data, pp 103–114 Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases. In: Proceedings of the ACM SIGMOD conference on management of data, pp 103–114
go back to reference Zhou H, Yonghuai L (2008) Accurate integration of multi-view range images using k-means clustering. Pattern Recognit 41(1):152–175MATHCrossRef Zhou H, Yonghuai L (2008) Accurate integration of multi-view range images using k-means clustering. Pattern Recognit 41(1):152–175MATHCrossRef
Metadata
Title
Hybridization of magnetic charge system search and particle swarm optimization for efficient data clustering using neighborhood search strategy
Authors
Y. Kumar
G. Sahoo
Publication date
05-06-2015
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 12/2015
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-015-1719-0

Other articles of this Issue 12/2015

Soft Computing 12/2015 Go to the issue

Premium Partner