Skip to main content
Erschienen in: Soft Computing 5/2014

01.05.2014 | Methodologies and Application

A hybrid clustering algorithm based on PSO with dynamic crossover

verfasst von: Jie Zhang, Yuping Wang, Junhong Feng

Erschienen in: Soft Computing | Ausgabe 5/2014

Einloggen

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

search-config
loading …

Abstract

In order to overcome the premature convergence in particle swarm optimization (PSO), we introduce dynamical crossover, a crossover operator with variable lengths and positions, to PSO, which is briefly denoted as CPSO. To get rid of the drawbacks of only finding the convex clusters and being sensitive to the initial points in \(k\)-means algorithm, a hybrid clustering algorithm based on CPSO is proposed. The difference between the work and the existing ones lies in that CPSO is firstly introduced into \(k\)-means. Experimental results performing on several data sets illustrate that the proposed clustering algorithm can get completely rid of the shortcomings of \(k\)-means algorithms, and acquire correct clustering results. The application in image segmentation illustrates that the proposed algorithm gains good performance.

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!

Literatur
Zurück zum Zitat Abdel-Kader RF (2010) Genetically improved PSO algorithm for efficient data clustering. In IEEE international conference on machine learning and, computing, pp 71–75 Abdel-Kader RF (2010) Genetically improved PSO algorithm for efficient data clustering. In IEEE international conference on machine learning and, computing, pp 71–75
Zurück zum Zitat Alsabti K, Ranka S, Singh V (1997) An efficient k-means clustering algorithm. In: IPPS/SPDP workshop on high performance data mining Alsabti K, Ranka S, Singh V (1997) An efficient k-means clustering algorithm. In: IPPS/SPDP workshop on high performance data mining
Zurück zum Zitat Assent I et al (2008) Clustering multidimensional sequences in spatial and temporal databases. Knowl Inf Syst 16(1):29–51CrossRef Assent I et al (2008) Clustering multidimensional sequences in spatial and temporal databases. Knowl Inf Syst 16(1):29–51CrossRef
Zurück zum Zitat Basit HA, Jarzabek S (2009) A data mining approach for detecting higher-level clones in software. IEEE Trans Softw Eng 35(4):497–514CrossRef Basit HA, Jarzabek S (2009) A data mining approach for detecting higher-level clones in software. IEEE Trans Softw Eng 35(4):497–514CrossRef
Zurück zum Zitat Birant D, Kut A (2007) ST-DBSCAN: an algorithm for clustering spatial-temporal data. Data Knowl Eng 60(1):208–221CrossRef Birant D, Kut A (2007) ST-DBSCAN: an algorithm for clustering spatial-temporal data. Data Knowl Eng 60(1):208–221CrossRef
Zurück zum Zitat Chehreghani MH, Abolhassani H, Chehreghani MH (2008) Improving density-based methods for hierarchical clustering of web pages. Data Knowl Eng 67(1):30–50CrossRefMathSciNet Chehreghani MH, Abolhassani H, Chehreghani MH (2008) Improving density-based methods for hierarchical clustering of web pages. Data Knowl Eng 67(1):30–50CrossRefMathSciNet
Zurück zum Zitat Chen S, Zhang D (2004) Robust image segmentation using FCM with spatial constraints based on new kernel-induced distance measure. IEEE Trans Syst Man Cybern Part B Cybern 34(4):1907–1916CrossRef Chen S, Zhang D (2004) Robust image segmentation using FCM with spatial constraints based on new kernel-induced distance measure. IEEE Trans Syst Man Cybern Part B Cybern 34(4):1907–1916CrossRef
Zurück zum Zitat Chen WCS, Zhang D (2007) Fast and robust fuzzy c-means clustering algorithms incorporating local information for image segmentation. Pattern Recogn 40(3):825–838CrossRefMATH Chen WCS, Zhang D (2007) Fast and robust fuzzy c-means clustering algorithms incorporating local information for image segmentation. Pattern Recogn 40(3):825–838CrossRefMATH
Zurück zum Zitat Chuang K et al (2006) Fuzzy c-means clustering with spatial information for image segmentation. Computerized medical imaging and graphics 30(1):9–15CrossRef Chuang K et al (2006) Fuzzy c-means clustering with spatial information for image segmentation. Computerized medical imaging and graphics 30(1):9–15CrossRef
Zurück zum Zitat Clerc M, Kennedy J (2002) The particle swarm: explosion, stability and convergence in a multi-dimensional complex space. IEEE Trans Evol Comput 6(1):58–73CrossRef Clerc M, Kennedy J (2002) The particle swarm: explosion, stability and convergence in a multi-dimensional complex space. IEEE Trans Evol Comput 6(1):58–73CrossRef
Zurück zum Zitat Daqi L, Junyi S, Hongmin C (2008) A fast K-Means clustering algorithm based on grid data reduction. In: IEEE conference on, aerospace, pp 1–6 Daqi L, Junyi S, Hongmin C (2008) A fast K-Means clustering algorithm based on grid data reduction. In: IEEE conference on, aerospace, pp 1–6
Zurück zum Zitat Datta S, Giannella CR, Kargupta H (2009) Approximate distributed K-Means clustering over a peer-to-peer network. IEEE Trans Knowl Data Eng 21(10):1372–1388CrossRef Datta S, Giannella CR, Kargupta H (2009) Approximate distributed K-Means clustering over a peer-to-peer network. IEEE Trans Knowl Data Eng 21(10):1372–1388CrossRef
Zurück zum Zitat David A, Jean P (2002) Computer vision: a modern approach. Prentice-Hall, Englewood Cliffs David A, Jean P (2002) Computer vision: a modern approach. Prentice-Hall, Englewood Cliffs
Zurück zum Zitat Davidson I, Ravi SS (2008) Using instance-level constraints in agglomerative hierarchical clustering theoretical and empirical results. Data Mining Knowl Discov 18(2):257–282CrossRefMathSciNet Davidson I, Ravi SS (2008) Using instance-level constraints in agglomerative hierarchical clustering theoretical and empirical results. Data Mining Knowl Discov 18(2):257–282CrossRefMathSciNet
Zurück zum Zitat Dong J, Qi M (2009) A new algorithm for clustering based on particle swarm optimization and k-means. In: 2009 international conference on artificial intelligence and, computational intelligence, pp 264–268 Dong J, Qi M (2009) A new algorithm for clustering based on particle swarm optimization and k-means. In: 2009 international conference on artificial intelligence and, computational intelligence, pp 264–268
Zurück zum Zitat Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of sixth international symposium micro machine and human science, pp 39–43 Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of sixth international symposium micro machine and human science, pp 39–43
Zurück zum Zitat Gan H et al (2013) Using clustering analysis to improve semi-supervised classification. Neurocomputing 101:290–298CrossRef Gan H et al (2013) Using clustering analysis to improve semi-supervised classification. Neurocomputing 101:290–298CrossRef
Zurück zum Zitat Gou SP et al (2013) Parallel sparse spectral clustering for SAR image segmentation. IEEE J Selected Topics Appl Earth Observ Remote Sens 99:1–15 Gou SP et al (2013) Parallel sparse spectral clustering for SAR image segmentation. IEEE J Selected Topics Appl Earth Observ Remote Sens 99:1–15
Zurück zum Zitat Han J, Kamber M (2006) Data mining: concepts and techniques. Morgan Kaufmann, San Franciso Han J, Kamber M (2006) Data mining: concepts and techniques. Morgan Kaufmann, San Franciso
Zurück zum Zitat Haralick RM, Shapiro LG (1985) Image segmentation techniques. Comput Vision Graphics Image Process 29(1):100–132CrossRef Haralick RM, Shapiro LG (1985) Image segmentation techniques. Comput Vision Graphics Image Process 29(1):100–132CrossRef
Zurück zum Zitat Huber M et al (2009) Data mining based mutation function for engineering problems with mixed continuous-discrete design variables. Struct Multidiscipl Optim 41(4):589–604CrossRef Huber M et al (2009) Data mining based mutation function for engineering problems with mixed continuous-discrete design variables. Struct Multidiscipl Optim 41(4):589–604CrossRef
Zurück zum Zitat Jeon B, Jung Y, Hong K (2006) Image segmentation by unsupervised sparse clustering. Pattern Recogn Lett 27(14):1650–1664CrossRef Jeon B, Jung Y, Hong K (2006) Image segmentation by unsupervised sparse clustering. Pattern Recogn Lett 27(14):1650–1664CrossRef
Zurück zum Zitat Jiang H et al (2011) A new hybrid method based on partitioning-based DBSCAN and ant clustering. Expert Syst Appl 38(8):9373–9381CrossRef Jiang H et al (2011) A new hybrid method based on partitioning-based DBSCAN and ant clustering. Expert Syst Appl 38(8):9373–9381CrossRef
Zurück zum Zitat Karoui L, Aufaure M, Bennacer N (2006) Context-based hierarchical clustering for the ontology learning. In: Proceedings of the 2006 IEEE/WIC/ACM international conference on web, intelligence, pp 420–427 Karoui L, Aufaure M, Bennacer N (2006) Context-based hierarchical clustering for the ontology learning. In: Proceedings of the 2006 IEEE/WIC/ACM international conference on web, intelligence, pp 420–427
Zurück zum Zitat Karthikeyan M, Aruna P (2013) Probability based document clustering and image clustering using content-based image retrieval. Appl Soft Comput 13(2):959–966CrossRef Karthikeyan M, Aruna P (2013) Probability based document clustering and image clustering using content-based image retrieval. Appl Soft Comput 13(2):959–966CrossRef
Zurück zum Zitat Kennedy J, Eberhart R (1995) Particle swarm optimization. IEEE Int Conf Neural Netw 4:1942–1948 Kennedy J, Eberhart R (1995) Particle swarm optimization. IEEE Int Conf Neural Netw 4:1942–1948
Zurück zum Zitat Ladys Law Skarbek W, Koschan A (1994) Colour image segmentation a survey. In: IEEE transactions on circuits and systems for video technology, vol 14, no 7 Ladys Law Skarbek W, Koschan A (1994) Colour image segmentation a survey. In: IEEE transactions on circuits and systems for video technology, vol 14, no 7
Zurück zum Zitat Liu C et al (2013) Clustering tagged documents with labeled and unlabeled documents. Inf Process Manage 49(3):596–606CrossRef Liu C et al (2013) Clustering tagged documents with labeled and unlabeled documents. Inf Process Manage 49(3):596–606CrossRef
Zurück zum Zitat Mahdavi M, Abolhassani H (2008) Harmony K-means algorithm for document clustering. Data Mining Knowl Discov 18(3):370–391CrossRefMathSciNet Mahdavi M, Abolhassani H (2008) Harmony K-means algorithm for document clustering. Data Mining Knowl Discov 18(3):370–391CrossRefMathSciNet
Zurück zum Zitat Ma W, Manjunath BS (1997) Edge flow: a framework of boundary detection and image segmentation. In: IEEE computer society conference on computer vision and, pattern recognition, pp 744–749 Ma W, Manjunath BS (1997) Edge flow: a framework of boundary detection and image segmentation. In: IEEE computer society conference on computer vision and, pattern recognition, pp 744–749
Zurück zum Zitat Martin D et al (2001) A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: The 8th IEEE international conference on computer vision, vol 2, pp 416–423 Martin D et al (2001) A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: The 8th IEEE international conference on computer vision, vol 2, pp 416–423
Zurück zum Zitat Ponce J et al (2011) Computer vision: a modern approach. Computer 16:11 Ponce J et al (2011) Computer vision: a modern approach. Computer 16:11
Zurück zum Zitat Qiu D (2010) A comparative study of the K-means algorithm and the normal mixture model for clustering Bivariate homoscedastic case. J Stat Plan Infer 140(7):1701–1711CrossRefMATH Qiu D (2010) A comparative study of the K-means algorithm and the normal mixture model for clustering Bivariate homoscedastic case. J Stat Plan Infer 140(7):1701–1711CrossRefMATH
Zurück zum Zitat Samma ASB, Salam RA (2009) Adaptation of k-means algorithm for image segmentation. World Acad Sci Eng Technol 50:58–62 Samma ASB, Salam RA (2009) Adaptation of k-means algorithm for image segmentation. World Acad Sci Eng Technol 50:58–62
Zurück zum Zitat Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905CrossRef Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905CrossRef
Zurück zum Zitat Wang X, Huang D, Member S (2009) A novel density-based clustering framework by using level set method. IEEE Trans Knowl Data Eng 21(11):1515–1531CrossRef Wang X, Huang D, Member S (2009) A novel density-based clustering framework by using level set method. IEEE Trans Knowl Data Eng 21(11):1515–1531CrossRef
Zurück zum Zitat Wang L, Dong M (2012) Multi-level low-rank approximation-based spectral clustering for image segmentation. Pattern Recogn Lett 33(16):2206–2215CrossRef Wang L, Dong M (2012) Multi-level low-rank approximation-based spectral clustering for image segmentation. Pattern Recogn Lett 33(16):2206–2215CrossRef
Zurück zum Zitat Xia Y et al (2007) Image segmentation by clustering of spatial patterns. Pattern Recogn Lett 28(12):1548–1555CrossRef Xia Y et al (2007) Image segmentation by clustering of spatial patterns. Pattern Recogn Lett 28(12):1548–1555CrossRef
Zurück zum Zitat Xiong H, Wu J, Chen J (2009) K-means clustering versus validation measures: a data-distribution perspective. IEEE Trans Syst Man Cybern Part B Cybern 39(2):318–331CrossRef Xiong H, Wu J, Chen J (2009) K-means clustering versus validation measures: a data-distribution perspective. IEEE Trans Syst Man Cybern Part B Cybern 39(2):318–331CrossRef
Zurück zum Zitat Yin M et al (2011) A novel hybrid K-harmonic means and gravitational search algorithm approach for clustering. Expert Syst Appl 38(8):9319–9324CrossRef Yin M et al (2011) A novel hybrid K-harmonic means and gravitational search algorithm approach for clustering. Expert Syst Appl 38(8):9319–9324CrossRef
Zurück zum Zitat Yücenur GN, Demirel NÇ (2011) A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Syst Appl 38(9):11859–11865CrossRef Yücenur GN, Demirel NÇ (2011) A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Syst Appl 38(9):11859–11865CrossRef
Zurück zum Zitat Zha H et al (2001) Spectral relaxation for k-means clustering. Adv Neural Inf Process Syst 14:1057–1064 Zha H et al (2001) Spectral relaxation for k-means clustering. Adv Neural Inf Process Syst 14:1057–1064
Zurück zum Zitat Zhang J, Yang Y, Zhang Q (2009) The particle swarm optimization algorithm based on dynamic chaotic perturbations and its application to K-means. In: International conference on computational intelligence and security (CIS 2009), vol 1. Beijing, China, pp 282–286 Zhang J, Yang Y, Zhang Q (2009) The particle swarm optimization algorithm based on dynamic chaotic perturbations and its application to K-means. In: International conference on computational intelligence and security (CIS 2009), vol 1. Beijing, China, pp 282–286
Zurück zum Zitat Zhang J, Wang Y, Feng J (2013) Attribute index and uniform design based multiobjective association rule mining with evolutionary algorithm. Sci World J 16 Zhang J, Wang Y, Feng J (2013) Attribute index and uniform design based multiobjective association rule mining with evolutionary algorithm. Sci World J 16
Zurück zum Zitat Zhang J, Xue X, Wang Y (2012) Class assignment algorithms for performance measure of clustering algorithms. In: The 8th international conference on computational intelligence and security, CIS (2012) Guangzhou. Guangdong, China, pp 103–106 Zhang J, Xue X, Wang Y (2012) Class assignment algorithms for performance measure of clustering algorithms. In: The 8th international conference on computational intelligence and security, CIS (2012) Guangzhou. Guangdong, China, pp 103–106
Metadaten
Titel
A hybrid clustering algorithm based on PSO with dynamic crossover
verfasst von
Jie Zhang
Yuping Wang
Junhong Feng
Publikationsdatum
01.05.2014
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 5/2014
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-013-1115-6

Weitere Artikel der Ausgabe 5/2014

Soft Computing 5/2014 Zur Ausgabe