A review on particle swarm optimization algorithm and its variants to clustering high-dimensional data
Published 2013 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
A review on particle swarm optimization algorithm and its variants to clustering high-dimensional data
Authors
Keywords
Particle swarm optimization, PSO, PSO variants , Data clustering, High-dimensional data clustering
Journal
ARTIFICIAL INTELLIGENCE REVIEW
Volume 44, Issue 1, Pages 23-45
Publisher
Springer Nature
Online
2013-02-14
DOI
10.1007/s10462-013-9400-4
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Clustering in applications with multiple data sources—A mutual subspace clustering approach
- (2012) Ming Hua et al. NEUROCOMPUTING
- Particle swarm algorithm with hybrid mutation strategy
- (2011) Hao Gao et al. APPLIED SOFT COMPUTING
- A survey: hybrid evolutionary algorithms for cluster analysis
- (2011) Mohamed Jafar Abul Hasan et al. ARTIFICIAL INTELLIGENCE REVIEW
- Chaotic particle swarm optimization for data clustering
- (2011) Li-Yeh Chuang et al. EXPERT SYSTEMS WITH APPLICATIONS
- A comparative analysis of PSO, HPSO, and HPSO-TVAC for data clustering
- (2011) Changyin Sun et al. JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE
- Anomaly detection using a self-organizing map and particle swarm optimization
- (2011) M. Lotfi Shahreza et al. Scientia Iranica
- Stochastic approximation driven particle swarm optimization with simultaneous perturbation – Who will guide the guide?
- (2010) Serkan Kiranyaz et al. APPLIED SOFT COMPUTING
- A hierarchical Mamdani-type fuzzy modelling approach with new training data selection and multi-objective optimisation mechanisms: A special application for the prediction of mechanical properties of alloy steels
- (2010) Qian Zhang et al. APPLIED SOFT COMPUTING
- A review on particle swarm optimization algorithms and their applications to data clustering
- (2010) Sandeep Rana et al. ARTIFICIAL INTELLIGENCE REVIEW
- Finding relevant clustering directions in high-dimensional data using Particle Swarm Optimization
- (2010) Federico Marini et al. JOURNAL OF CHEMOMETRICS
- Using Evidence of Mixed Populations to Select Variables for Clustering Very High-Dimensional Data
- (2010) Yao-ban Chan et al. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION
- A Framework for Feature Selection in Clustering
- (2010) Daniela M. Witten et al. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION
- Fractional Particle Swarm Optimization in Multidimensional Search Space
- (2009) S. Kiranyaz et al. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
- Particle swarm optimizer for variable weighting in clustering high-dimensional data
- (2009) Yanping Lu et al. MACHINE LEARNING
- Identification of surgical practice patterns using evolutionary cluster analysis
- (2009) Manuel Herrera et al. MATHEMATICAL AND COMPUTER MODELLING
- Flocking based approach for data clustering
- (2009) Abbas Ahmadi et al. Natural Computing
- Clustering high-dimensional data
- (2009) Hans-Peter Kriegel et al. ACM Transactions on Knowledge Discovery from Data
- Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
- (2008) Chieh-Yuan Tsai et al. COMPUTATIONAL STATISTICS & DATA ANALYSIS
- Hybrid Particle Swarm Optimization With Wavelet Mutation and Its Industrial Applications
- (2008) S.H. Ling et al. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
- Automatic kernel clustering with a Multi-Elitist Particle Swarm Optimization Algorithm
- (2008) Swagatam Das et al. PATTERN RECOGNITION LETTERS
- Variable Selection for Model-Based High-Dimensional Clustering and Its Application to Microarray Data
- (2007) Sijian Wang et al. BIOMETRICS
- A hybridized approach to data clustering
- (2007) Yi-Tung Kao et al. EXPERT SYSTEMS WITH APPLICATIONS
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationPublish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn More