Skip to main content
Erschienen in: Soft Computing 2/2015

01.02.2015 | Methodologies and Application

A fast particle swarm optimization for clustering

verfasst von: Chun-Wei Tsai, Ko-Wei Huang, Chu-Sing Yang, Ming-Chao Chiang

Erschienen in: Soft Computing | Ausgabe 2/2015

Einloggen

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

search-config
loading …

Abstract

This paper presents a high-performance method to reduce the time complexity of particle swarm optimization (PSO) and its variants in solving the partitional clustering problem. The proposed method works by adding two additional operators to the PSO-based algorithms. The pattern reduction operator is aimed to reduce the computation time, by compressing at each iteration patterns that are unlikely to change the clusters to which they belong thereafter while the multistart operator is aimed to improve the quality of the clustering result, by enforcing the diversity of the population to prevent the proposed method from getting stuck in local optima. To evaluate the performance of the proposed method, we compare it with several state-of-the-art PSO-based methods in solving data clustering, image clustering, and codebook generation problems. Our simulation results indicate that not only can the proposed method significantly reduce the computation time of PSO-based algorithms, but it can also provide a clustering result that matches or outperforms the result PSO-based algorithms by themselves can provide.

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

Fußnoten
1
That is, \(X=\cup _{i=1}^k\pi _i\) and \(\forall i\ne j, \pi _i\cap \pi _j=\emptyset \).
 
2
In other words, the modified acceleration coefficients \(a_1\) and \(a_2\) begin with the value \(\dot{a}_{\cdot }\), increase or decrease linearly proportional to the difference between \(\ddot{a}_{\cdot }\) and \(\dot{a}_{\cdot }\) as the number of iterations grows, and end with the value \(\ddot{a}_{\cdot }\).
 
3
The approach is fast because no sorting is required.
 
4
Since no confusion is possible, throughout the rest of the paper, we will use MPREPSO and \(\text {MPR}_2\) interchangeably to mean the proposed algorithm using both detection methods and the multistart operator from time to time.
 
5
These datasets are available for download at http://​archive.​ics.​uci.​edu/​ml/​datasets.​html.
 
7
The number of clusters is set equal to 8.
 
Literatur
Zurück zum Zitat Abraham A, Das S, Konar A (2007) Kernel based automatic clustering using modified particle swarm optimization algorithm, In: Proceedings of the Annual Conference on Genetic and Evolutionary Computation, pp 2–9 Abraham A, Das S, Konar A (2007) Kernel based automatic clustering using modified particle swarm optimization algorithm, In: Proceedings of the Annual Conference on Genetic and Evolutionary Computation, pp 2–9
Zurück zum Zitat Ahmadi A, Karray F, Kamel M (2007a) Cooperative swarms for clustering phoneme data, In: Proceedings of the IEEE/SP Workshop on Statistical, Signal Processing, pp 606–610 Ahmadi A, Karray F, Kamel M (2007a) Cooperative swarms for clustering phoneme data, In: Proceedings of the IEEE/SP Workshop on Statistical, Signal Processing, pp 606–610
Zurück zum Zitat Ahmadi A, Karray F, Kamel M (2007b) Multiple cooperating swarms for data clustering, In: Proceedings of the IEEE Swarm Intelligence Symposium, pp 206–212 Ahmadi A, Karray F, Kamel M (2007b) Multiple cooperating swarms for data clustering, In: Proceedings of the IEEE Swarm Intelligence Symposium, pp 206–212
Zurück zum Zitat Ahmadyfard A, Modares H (2008) Combining PSO and \(k\)-means to enhance data clustering, In: Proceedings of the International Symposium on Telecommunications, pp 688–691 Ahmadyfard A, Modares H (2008) Combining PSO and \(k\)-means to enhance data clustering, In: Proceedings of the International Symposium on Telecommunications, pp 688–691
Zurück zum Zitat Bagirov AM, Ugon J, Webb D (2011) Fast modified global \(k\)-means algorithm for incremental cluster construction. Patt Recogn 44(4):866–876CrossRefMATH Bagirov AM, Ugon J, Webb D (2011) Fast modified global \(k\)-means algorithm for incremental cluster construction. Patt Recogn 44(4):866–876CrossRefMATH
Zurück zum Zitat Banks A, Vincent J, Anyakoha C (2008) A review of particle swarm optimization. part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat Comput 7(1):109–124CrossRefMATHMathSciNet Banks A, Vincent J, Anyakoha C (2008) A review of particle swarm optimization. part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat Comput 7(1):109–124CrossRefMATHMathSciNet
Zurück zum Zitat Bradley PS, Fayyad UM (1998) Refining initial points for \(k\)-means clustering, In: Proceedings of the International Conference on Machine Learning, pp 91–99 Bradley PS, Fayyad UM (1998) Refining initial points for \(k\)-means clustering, In: Proceedings of the International Conference on Machine Learning, pp 91–99
Zurück zum Zitat Bradley PS, Fayyad UM, Reina C (1998) Scaling clustering algorithms to large databases, In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp 9–15 Bradley PS, Fayyad UM, Reina C (1998) Scaling clustering algorithms to large databases, In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp 9–15
Zurück zum Zitat Bratton D, Kennedy J (2007) Defining a standard for particle swarm optimization, In: Proceedings of the IEEE Swarm Intelligence Symposium, pp 120–127 Bratton D, Kennedy J (2007) Defining a standard for particle swarm optimization, In: Proceedings of the IEEE Swarm Intelligence Symposium, pp 120–127
Zurück zum Zitat Buzo A, Gray AH Jr, Gray RM, Markel JD (1980) Speech coding based upon vector quantization. IEEE Trans Acoust Speech Signal Proc 28(5):562–574CrossRefMATHMathSciNet Buzo A, Gray AH Jr, Gray RM, Markel JD (1980) Speech coding based upon vector quantization. IEEE Trans Acoust Speech Signal Proc 28(5):562–574CrossRefMATHMathSciNet
Zurück zum Zitat Cai W, Chen S, Zhang D (2007) Fast and robust fuzzy \(c\)-means clustering algorithms incorporating local information for image segmentation. Patt Recogn 40(3):825–838CrossRefMATH Cai W, Chen S, Zhang D (2007) Fast and robust fuzzy \(c\)-means clustering algorithms incorporating local information for image segmentation. Patt Recogn 40(3):825–838CrossRefMATH
Zurück zum Zitat Chen CY, Ye F (2004) Particle swarm optimization algorithm and its application to clustering analysis, In: Proceedings of the IEEE International Conference on Networking, Sensing & Control, 2:789– 794 Chen CY, Ye F (2004) Particle swarm optimization algorithm and its application to clustering analysis, In: Proceedings of the IEEE International Conference on Networking, Sensing & Control, 2:789– 794
Zurück zum Zitat Chen CY, Feng HM, Ye F (2006) Automatic particle swarm optimization clustering algorithm. Intern J Electr Eng 13(4):379–387 Chen CY, Feng HM, Ye F (2006) Automatic particle swarm optimization clustering algorithm. Intern J Electr Eng 13(4):379–387
Zurück zum Zitat Cheng TW, Goldgof DB, Hall LO (1998) Fast fuzzy clustering. Fuzzy sets and systems 93(1):49–56 Cheng TW, Goldgof DB, Hall LO (1998) Fast fuzzy clustering. Fuzzy sets and systems 93(1):49–56
Zurück zum Zitat Chen Q, Yang J, Gou J (2005) Image compression method using improved PSO vector quantization, In: Proceedings of the Advances in Natural Computation, pp 490–495 Chen Q, Yang J, Gou J (2005) Image compression method using improved PSO vector quantization, In: Proceedings of the Advances in Natural Computation, pp 490–495
Zurück zum Zitat Chiang MC, Tsai CW, Yang CS (2011) A time-efficient pattern reduction algorithm for \(k\)-means clustering. Info Sci 181(4):716–731CrossRef Chiang MC, Tsai CW, Yang CS (2011) A time-efficient pattern reduction algorithm for \(k\)-means clustering. Info Sci 181(4):716–731CrossRef
Zurück zum Zitat Cohen SCM, de Castro LN (2006) Data clustering with particle swarms, In: Proceedings of the IEEE Congress on Evolutionary Computation, pp 1792–1798 Cohen SCM, de Castro LN (2006) Data clustering with particle swarms, In: Proceedings of the IEEE Congress on Evolutionary Computation, pp 1792–1798
Zurück zum Zitat Das S, Abraham A, Konar A (2008) Automatic kernel clustering with a multi-elitist particle swarm optimization algorithm. Patt Recogn Lett 29(5):688–699CrossRef Das S, Abraham A, Konar A (2008) Automatic kernel clustering with a multi-elitist particle swarm optimization algorithm. Patt Recogn Lett 29(5):688–699CrossRef
Zurück zum Zitat 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
Zurück zum Zitat Ding C, He X (2004) \(K\)-means clustering via principal component analysis, In: Proceedings of the International Conference on Machine Learning, 69:225–232 Ding C, He X (2004) \(K\)-means clustering via principal component analysis, In: Proceedings of the International Conference on Machine Learning, 69:225–232
Zurück zum Zitat Elkan C (2003) Using the triangle inequality to accelerate \(k\)-means, In: Proceedings of the International Conference on Machine Learning, pp 147–153 Elkan C (2003) Using the triangle inequality to accelerate \(k\)-means, In: Proceedings of the International Conference on Machine Learning, pp 147–153
Zurück zum Zitat Engelbrecht AP (2006) Fundamentals of computational swarm intelligence. Wiley, West Sussex, England Engelbrecht AP (2006) Fundamentals of computational swarm intelligence. Wiley, West Sussex, England
Zurück zum Zitat Eschrich S, Ke J, Hall LO, Goldgof DB (2003) Fast accurate fuzzy clustering through data reduction. IEEE Trans Fuzzy Syst 11(2):262–270CrossRef Eschrich S, Ke J, Hall LO, Goldgof DB (2003) Fast accurate fuzzy clustering through data reduction. IEEE Trans Fuzzy Syst 11(2):262–270CrossRef
Zurück zum Zitat Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise, In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp 226–231 Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise, In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp 226–231
Zurück zum Zitat Feng HM, Chen CY, Ye F (2007) Evolutionary fuzzy particle swarm optimization vector quantization learning scheme in image compression. Exp Syst Appl 32(1):213–222CrossRef Feng HM, Chen CY, Ye F (2007) Evolutionary fuzzy particle swarm optimization vector quantization learning scheme in image compression. Exp Syst Appl 32(1):213–222CrossRef
Zurück zum Zitat Getz G, Gal H, Kela I, Notterman DA, Domany E (2003) Coupled two-way clustering analysis of breast cancer and colon cancer gene expression data. Bioinformatics 19(9):1079–1089CrossRef Getz G, Gal H, Kela I, Notterman DA, Domany E (2003) Coupled two-way clustering analysis of breast cancer and colon cancer gene expression data. Bioinformatics 19(9):1079–1089CrossRef
Zurück zum Zitat Guha S, Meyerson A, Mishra N, Motwani R, O’Callaghan L (2003) Clustering data streams: theory and practice. IEEE Trans Knowl Data Eng 15(3):515–528CrossRef Guha S, Meyerson A, Mishra N, Motwani R, O’Callaghan L (2003) Clustering data streams: theory and practice. IEEE Trans Knowl Data Eng 15(3):515–528CrossRef
Zurück zum Zitat Hammouda KM, Kamel MS (2004) Efficient phrase-based document indexing for web document clustering. IEEE Trans Knowl Data Eng 16(10):1279–1296CrossRef Hammouda KM, Kamel MS (2004) Efficient phrase-based document indexing for web document clustering. IEEE Trans Knowl Data Eng 16(10):1279–1296CrossRef
Zurück zum Zitat Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264–323CrossRef Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264–323CrossRef
Zurück zum Zitat Jarboui B, Cheikh M, Siarry P, Rebai A (2007) Combinatorial particle swarm optimization (CPSO) for partitional clustering problem. Appl Math Comput 192(2):337–345CrossRefMATHMathSciNet Jarboui B, Cheikh M, Siarry P, Rebai A (2007) Combinatorial particle swarm optimization (CPSO) for partitional clustering problem. Appl Math Comput 192(2):337–345CrossRefMATHMathSciNet
Zurück zum Zitat Karthi R, Arumugam S, RameshKumar K (2009) A novel discrete particle swarm clustering algorithm for data clustering, In: Proceedings of the Bangalore Annual Compute Conference, pp 16:1–16:4 Karthi R, Arumugam S, RameshKumar K (2009) A novel discrete particle swarm clustering algorithm for data clustering, In: Proceedings of the Bangalore Annual Compute Conference, pp 16:1–16:4
Zurück zum Zitat Kaukoranta T, Fränti P, Nevalainen O (2000) A fast exact GLA based on code vector activity detection. IEEE Trans Image Proc 9(8):1337–1342CrossRef Kaukoranta T, Fränti P, Nevalainen O (2000) A fast exact GLA based on code vector activity detection. IEEE Trans Image Proc 9(8):1337–1342CrossRef
Zurück zum Zitat Kekre HB, Sarode TK (2009) Fast codebook search algorithm for vector quantization using sorting technique, In: Proceedings of the International Conference on Advances in Computing, Communication and Control, pp 317–325 Kekre HB, Sarode TK (2009) Fast codebook search algorithm for vector quantization using sorting technique, In: Proceedings of the International Conference on Advances in Computing, Communication and Control, pp 317–325
Zurück zum Zitat Kogan J (2007) Introduction to clustering large and high-dimensional data. Cambridge University Press, New YorkMATH Kogan J (2007) Introduction to clustering large and high-dimensional data. Cambridge University Press, New YorkMATH
Zurück zum Zitat Kulkarni RV, Venayagamoorthy GK (2011) Particle swarm optimization in wireless-sensor networks: a brief survey. IEEE Trans Syst Man Cybernet Part C 41(2):262–267CrossRef Kulkarni RV, Venayagamoorthy GK (2011) Particle swarm optimization in wireless-sensor networks: a brief survey. IEEE Trans Syst Man Cybernet Part C 41(2):262–267CrossRef
Zurück zum Zitat Kuo RJ, Wang MJ, Huang TW (2011) An application of particle swarm optimization algorithm to clustering analysis. Soft Comput 15(3):533–542CrossRef Kuo RJ, Wang MJ, Huang TW (2011) An application of particle swarm optimization algorithm to clustering analysis. Soft Comput 15(3):533–542CrossRef
Zurück zum Zitat Lai JZC, Liaw YC, Liu J (2008) A fast VQ codebook generation algorithm using codeword displacement. Patt Recogn 41(1):315– 319 Lai JZC, Liaw YC, Liu J (2008) A fast VQ codebook generation algorithm using codeword displacement. Patt Recogn 41(1):315– 319
Zurück zum Zitat Lai JZC, Huang TJ, Liaw YC (2009) A fast \(k\)-means clustering algorithm using cluster center displacement. Patt Recogn 42(11):2551–2556CrossRefMATH Lai JZC, Huang TJ, Liaw YC (2009) A fast \(k\)-means clustering algorithm using cluster center displacement. Patt Recogn 42(11):2551–2556CrossRefMATH
Zurück zum Zitat Leuski A (2001) Evaluating document clustering for interactive information retrieval, In: Proceedings of the International Conference on Information and Knowledge Management, pp 33–40 Leuski A (2001) Evaluating document clustering for interactive information retrieval, In: Proceedings of the International Conference on Information and Knowledge Management, pp 33–40
Zurück zum Zitat Li C, Zhou J, Kou P, Xiao J (2012) A novel chaotic particle swarm optimization based fuzzy clustering algorithm. Neurocomputing 83:98–109CrossRef Li C, Zhou J, Kou P, Xiao J (2012) A novel chaotic particle swarm optimization based fuzzy clustering algorithm. Neurocomputing 83:98–109CrossRef
Zurück zum Zitat Lughofer E (2008) Extensions of vector quantization for incremental clustering. Patt Recogn 41(3):995–1011CrossRefMATH Lughofer E (2008) Extensions of vector quantization for incremental clustering. Patt Recogn 41(3):995–1011CrossRefMATH
Zurück zum Zitat 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
Zurück zum Zitat Marinakis Y, Marinaki M, Matsatsinis N (2008) A stochastic nature inspired metaheuristic for clustering analysis. Intern J Bus Intel Data Mining 3(1):30–44CrossRef Marinakis Y, Marinaki M, Matsatsinis N (2008) A stochastic nature inspired metaheuristic for clustering analysis. Intern J Bus Intel Data Mining 3(1):30–44CrossRef
Zurück zum Zitat Miranda V, Keko H, Duque AJ (2008) Stochastic star communication topology in evolutionary particle swarms (EPSO). Intern J Comput Intel Res 4(2):105–116MathSciNet Miranda V, Keko H, Duque AJ (2008) Stochastic star communication topology in evolutionary particle swarms (EPSO). Intern J Comput Intel Res 4(2):105–116MathSciNet
Zurück zum Zitat Ng RT, Han J (2002) CLARANS: a method for clustering objects for spatial data mining. IEEE Trans Knowl Data Eng 14(5):1003–1016CrossRef Ng RT, Han J (2002) CLARANS: a method for clustering objects for spatial data mining. IEEE Trans Knowl Data Eng 14(5):1003–1016CrossRef
Zurück zum Zitat Niknam T, Amiri B, Olamaei J, Arefi A (2009) An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering. J Zhejiang Univ SCI A 10(4):512–519CrossRefMATH Niknam T, Amiri B, Olamaei J, Arefi A (2009) An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering. J Zhejiang Univ SCI A 10(4):512–519CrossRefMATH
Zurück zum Zitat Omran MGH, Salman AA, Engelbrecht AP (2002) Image classification using particle swarm optimization, In: Proceedings of the Asia-Pacific Conference on Simulated Evolution and Learning, pp 370–374 Omran MGH, Salman AA, Engelbrecht AP (2002) Image classification using particle swarm optimization, In: Proceedings of the Asia-Pacific Conference on Simulated Evolution and Learning, pp 370–374
Zurück zum Zitat Omran MGH, Engelbrecht AP, Salman AA (2005a) Particle swarm optimization method for image clustering. Intern J Patt Recogn Artif Intel 19(3):297–321 Omran MGH, Engelbrecht AP, Salman AA (2005a) Particle swarm optimization method for image clustering. Intern J Patt Recogn Artif Intel 19(3):297–321
Zurück zum Zitat Omran MGH, Engelbrecht AP, Salman AA (2005b) Dynamic clustering using particle swarm optimization with application in unsupervised image segmentation. Proc World Acad Sci Eng Technol 2005:199–204 Omran MGH, Engelbrecht AP, Salman AA (2005b) Dynamic clustering using particle swarm optimization with application in unsupervised image segmentation. Proc World Acad Sci Eng Technol 2005:199–204
Zurück zum Zitat Omran MGH, Salman AA, Engelbrecht AP (2006) Dynamic clustering using particle swarm optimization with application in image segmentation. Patt Anal Appl 8(4):332–344CrossRefMathSciNet Omran MGH, Salman AA, Engelbrecht AP (2006) Dynamic clustering using particle swarm optimization with application in image segmentation. Patt Anal Appl 8(4):332–344CrossRefMathSciNet
Zurück zum Zitat Ordonez C, Omiecinski E (2004) Efficient disk-based \(k\)-means clustering for relational databases. IEEE Trans Knowl Data Eng 16(8):909–921 Ordonez C, Omiecinski E (2004) Efficient disk-based \(k\)-means clustering for relational databases. IEEE Trans Knowl Data Eng 16(8):909–921
Zurück zum Zitat Parsopoulos KE, Vrahatis MN (2010) Particle swarm optimization and intelligence: advances and applications. IGI Global Snippet Parsopoulos KE, Vrahatis MN (2010) Particle swarm optimization and intelligence: advances and applications. IGI Global Snippet
Zurück zum Zitat Paterlini S, Krink T (2006) Differential evolution and particle swarm optimisation in partitional clustering. Comput Stat Data Anal 50(5):1220–1247CrossRefMathSciNet Paterlini S, Krink T (2006) Differential evolution and particle swarm optimisation in partitional clustering. Comput Stat Data Anal 50(5):1220–1247CrossRefMathSciNet
Zurück zum Zitat Ratnaweera A, Halgamuge SK, Watson HC (2004) Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans Evol Comput 8(3):240–255CrossRef Ratnaweera A, Halgamuge SK, Watson HC (2004) Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans Evol Comput 8(3):240–255CrossRef
Zurück zum Zitat Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization, In: Proceedings of the Congress on Evolutionary Computation, 3:1945–1950 Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization, In: Proceedings of the Congress on Evolutionary Computation, 3:1945–1950
Zurück zum Zitat Theodoridis S, Koutroumbas K (2009) Chapter 16: cluster validity, in pattern recognition, 4th edn. Academic Press, Boston Theodoridis S, Koutroumbas K (2009) Chapter 16: cluster validity, in pattern recognition, 4th edn. Academic Press, Boston
Zurück zum Zitat Tillett JC, Rao RM, Sahin F, Rao TM (2003) Particle swarm optimization for the clustering of wireless sensors, In: Proceedings of SPIE 5100:73–83 Tillett JC, Rao RM, Sahin F, Rao TM (2003) Particle swarm optimization for the clustering of wireless sensors, In: Proceedings of SPIE 5100:73–83
Zurück zum Zitat Tsai CW, Yang CS, Chiang MC (2007) A time efficient pattern reduction algorithm for \(k\)-means based clustering, In: Proceeding of the IEEE International Conference on Systems, Man and Cybernetics, pp 504–509 Tsai CW, Yang CS, Chiang MC (2007) A time efficient pattern reduction algorithm for \(k\)-means based clustering, In: Proceeding of the IEEE International Conference on Systems, Man and Cybernetics, pp 504–509
Zurück zum Zitat Tsai CW, Lin CF, Chiang MC, Yang CS (2010) A fast particle swarm optimization algorithm for vector quantization. ICIC Expr Lett Part B 1(2):137–143 Tsai CW, Lin CF, Chiang MC, Yang CS (2010) A fast particle swarm optimization algorithm for vector quantization. ICIC Expr Lett Part B 1(2):137–143
Zurück zum Zitat van der Merwe DW, Engelbrecht AP (2003) Data clustering using particle swarm optimization, In: Proceedings of IEEE Congress on Evolutionary Computation, 1:215–220 van der Merwe DW, Engelbrecht AP (2003) Data clustering using particle swarm optimization, In: Proceedings of IEEE Congress on Evolutionary Computation, 1:215–220
Zurück zum Zitat Xiang S, Nie F, Zhang C (2008) Learning a Mahalanobis distance metric for data clustering and classification. Patt Recogn 41(12):3600–3612CrossRefMATH Xiang S, Nie F, Zhang C (2008) Learning a Mahalanobis distance metric for data clustering and classification. Patt Recogn 41(12):3600–3612CrossRefMATH
Zurück zum Zitat Xiao X, Dow ER, Eberhart R, Miled ZB, Oppelt RJ (2003) Gene clustering using self-organizing maps and particle swarm optimization, In: Proceedings of the International Symposium on Parallel and Distributed Processing Xiao X, Dow ER, Eberhart R, Miled ZB, Oppelt RJ (2003) Gene clustering using self-organizing maps and particle swarm optimization, In: Proceedings of the International Symposium on Parallel and Distributed Processing
Zurück zum Zitat Xu R, Wunsch-II DC (2005) Survey of clustering algorithms. IEEE Trans Neural Netw 16(3):645–678CrossRef Xu R, Wunsch-II DC (2005) Survey of clustering algorithms. IEEE Trans Neural Netw 16(3):645–678CrossRef
Zurück zum Zitat Xu R, Wunsch-II DC (2008) Clustering. Wiley, Hoboken, New Jersey Xu R, Wunsch-II DC (2008) Clustering. Wiley, Hoboken, New Jersey
Zurück zum Zitat Xu W, Liu X, Gong Y (2003) Document clustering based on non-negative matrix factorization, In: Proceedings of the International ACM SIGIR Conference on Research and Development in, Information Retrieval, pp 267–273 Xu W, Liu X, Gong Y (2003) Document clustering based on non-negative matrix factorization, In: Proceedings of the International ACM SIGIR Conference on Research and Development in, Information Retrieval, pp 267–273
Zurück zum Zitat Yang CS, Chuang LY, Ke CH, Yang CH (2008) Comparative particle swarm optimization (CPSO) for solving optimization problems, In: Proceedings of the International Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies, pp 86–90 Yang CS, Chuang LY, Ke CH, Yang CH (2008) Comparative particle swarm optimization (CPSO) for solving optimization problems, In: Proceedings of the International Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies, pp 86–90
Zurück zum Zitat Zhang WF, Liu CC, Yan H (2010) Clustering of temporal gene expression data by regularized spline regression and an energy based similarity measure. Patt Recogn 43(12):3969–3976 Zhang WF, Liu CC, Yan H (2010) Clustering of temporal gene expression data by regularized spline regression and an energy based similarity measure. Patt Recogn 43(12):3969–3976
Zurück zum Zitat Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases, In: Proceedings of the ACM SIGMOD International 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 International Conference on Management of Data, pp 103–114
Metadaten
Titel
A fast particle swarm optimization for clustering
verfasst von
Chun-Wei Tsai
Ko-Wei Huang
Chu-Sing Yang
Ming-Chao Chiang
Publikationsdatum
01.02.2015
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 2/2015
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-014-1255-3

Weitere Artikel der Ausgabe 2/2015

Soft Computing 2/2015 Zur Ausgabe

Premium Partner