A charged system search approach for data clustering
Progress in Artificial IntelligencePublished 6 April 2014Open access
Yugal Kumar, G. Sahoo
Citations34
SJR quartileQ3
SJR score0.48
SNIP1.17
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
From the experimental results, it is found that the proposed algorithm provides more accurate and effective results than other methods being compared.
Abstract
This paper presents a charged system search optimization method for finding the optimal cluster centers in a given dataset. CSS algorithm utilizes the Coulomb and Gauss laws from electrostatics to initiate the local search, and Newton second law of motion from mechanics is employed for global search. The efficiency and capability of the proposed algorithm are evaluated on seven datasets and compared with existing $$K$$ -means, GA, PSO and ACO algorithms. From the experimental results, it is found that the proposed algorithm provides more accurate and effective results than other methods being compared.
Keywords
Computer Science
Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)Some methods for classification and analysis of multivariate observations
22,787 Citations1967James B. MacQueen
ACM Computing SurveysData clustering
13,184 Citations1999Anil K. Jain, M. Narasimha Murty +1 more
An overview of pattern clustering methods from a statistical pattern recognition perspective is presented, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Ant system: optimization by a colony of cooperating agents
11,908 Citations1996Marco Dorigo, Vittorio Maniezzo +1 more
A discrete binary version of the particle swarm algorithm
4,683 Citations2002James Kennedy, R.C. Eberhart
The paper reports a reworking of the particle swarm algorithm to operate on discrete binary variables, where trajectories are changes in the probability that a coordinate will take on a zero or one value.
Image Processing, Analysis and Machine Vision
3,719 Citations1993Milan Sonka, Václav Hlaváč +1 more
The digitized image and its properties are studied, including shape representation and description, and linear discrete image transforms, and texture analysis.
A Survey of Clustering Data Mining Techniques
2,791 Citations2006Pavel Berkhin
This survey concentrates on clustering algorithms from a data mining perspective as a data modeling technique that provides for concise summaries of the data.
Data Mining and Knowledge Discovery Handbook
2,202 Citations2010Oded Maimon, Lior Rokach
Information Visualization in Data Mining and Knowledge DiscoveryMagnetic Bubble TechnologyStatistical Data AnalyticsUrban InformaticsAdvances in Knowledge Discovery and Data Mining data mining and knowledge discovery technologies.
Statistical Pattern Recognition
1,754 Citations2001
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Genetic K-means algorithm
1,712 Citations1999K. Krishna, M. Narasimha Murty
A novel hybrid genetic algorithm that finds a globally optimal partition of a given data into a specified number of clusters using a classical gradient descent algorithm used in clustering, viz.
Series in machine perception and artificial intelligenceIntroduction to Machine Learning
1,654 Citations2019
Introduction to Machine Learning is a comprehensive textbook on the subject, covering a broad array of topics not usually included in introductory machine learning texts, and discusses many methods from different fields, including statistics, pattern recognition, neural networks, artificial intelligence, signal processing, control, and data mining.
Pattern RecognitionGenetic algorithm-based clustering technique
1,447 Citations2000Ujjwal Maulik, Sanghamitra Bandyopadhyay
The superiority of the GA-clustering algorithm over the commonly used K-means algorithm is extensively demonstrated for four artificial and three real-life data sets.
Acta MechanicaA novel heuristic optimization method: charged system search
1,348 Citations2010A. Kaveh, Siamak Talatahari
A comparison of the results with those of other evolutionary algorithms shows that the proposed algorithm outperforms its rivals.
IEEE Transactions on Pattern Analysis and Machine IntelligenceK-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
1,194 Citations1984Shokri Z. Selim, Mohamed A. Ismail
It is shown that under certain conditions the K-means algorithm may fail to converge to a local minimum, and that it converges under differentiability conditions to a Kuhn-Tucker point.
Applied Soft ComputingA novel clustering approach: Artificial Bee Colony (ABC) algorithm
1,077 Citations2009Derviş Karaboğa, Celal Öztürk
Simulation results indicate that ABC algorithm can efficiently be used for multivariate data clustering and is compared with Particle Swarm Optimization (PSO) algorithm and other nine classification techniques from the literature.
Data clustering using particle swarm optimization
801 Citations2003D.W. van der Merwe, Andries P. Engelbrecht
This paper proposes two new approaches to using PSO to cluster data, one which basically usesPSO to refine the clusters formed by K-means, and the other which uses PSO in a different way to seed the initial swarm.
IEEE Transactions on Signal ProcessingAn adaptive clustering algorithm for image segmentation
586 Citations1992Thrasyvoulos N. Pappas
Analytica Chimica ActaAn ant colony approach for clustering
506 Citations2004Prakash Shelokar, Vaidyanathan Jayaraman +1 more
This paper presents an ant colony optimization methodology for optimally clustering N objects into K clusters which employs distributed agents which mimic the way real ants find a shortest path from their nest to food source and back.
Pattern RecognitionA simulated annealing algorithm for the clustering problem
455 Citations1991Shokri Z. Selim, K. S. Al-Sultan
The simulated annealing approach for solving optimization problems is described and is proposed for solving the clustering problem and the parameters of the algorithm are discussed in detail and it is shown that the algorithm converges to a global solution of the clustered problem.
Applied Soft ComputingAn efficient hybrid approach based on PSO, ACO and k-means for cluster analysis
425 Citations2009Taher Niknam, Babak Amiri
A new hybrid evolutionary algorithm to solve nonlinear partitional clustering problem is presented, called FAPSO-ACO-K, which can find better cluster partition and is better than other algorithms such as PSO, ACO, simulated annealing (SA), combination of PSO and SA (PSO-SA).
Expert Systems with ApplicationsA hybridized approach to data clustering
333 Citations2007Yi-Tung Kao, Erwie Zahara +1 more
The new K-NM-PSO algorithm, a hybrid technique based on combining the K-means algorithm, Nelder-Mead simplex search, and particle swarm optimization, is proposed and tested, showing that it is both robust and suitable for handling data clustering.
Grouping Multidimensional Data
320 Citations2006
Pattern RecognitionA Tabu search approach to the clustering problem
301 Citations1995Khaled S. Al‐Sultan
A new algorithm for solving the problem of clustering m objects into c clusters based on a tabu search technique is developed that compares favorably with both the k-means and the simulated annealing algorithms.
Pattern Recognition LettersIn search of optimal clusters using genetic algorithms
300 Citations1996C.A. Murthy, Nirmalya Chowdhury
Genetic Algorithms have been used in an attempt to optimize a specified objective function related to a clustering problem and it is shown that the proposed method may improve the final output of K-Means where an improvement is possible.
Applied Mathematics and ComputationApplication of honey-bee mating optimization algorithm on clustering
260 Citations2007Mohammad Fathian, Babak Amiri +1 more
This paper compared HBMK-means with other heuristics algorithm in clustering, such as GA, SA, TS, and ACO, by implementing them on several well-known datasets and shows that the proposed algorithm works than the best one.
A survey of Clustering Algorithms
239 Citations2009Lior Rokach
This chapter presents a tutorial overview of the main clustering methods used in Data Mining, divided into: hierarchical, partitioning, density- based, model-based, grid-based; and soft-computing methods.
Pattern RecognitionA genetic approach to the automatic clustering problem
207 Citations2001Lin‐Yu Tseng, Shiueng Bien Yang
A genetic algorithm is proposed for clustering the data with compact spherical clusters that can be used in two ways, the user-controlled and an automatic clustering, where a heuristic strategy is applied to find a good clustering.
Swarm and Evolutionary ComputationA combined approach for clustering based on K-means and gravitational search algorithms
199 Citations2012Abdolreza Hatamlou, Salwani Abdullah +1 more
The GSA-KM algorithm helps the k-means algorithm to escape from local optima and also increases the convergence speed of the GSA algorithm, which uses the advantages of both algorithms.
Computers & Mathematics with ApplicationsA genetic algorithm approach to cluster analysis
172 Citations1999Marcus Charles Cowgill, Richard J. Harvey +1 more
Monte Carlo results showed that in some conditions the genetic clustering algorithm did indeed surpass the performance of conventional clustering techniques (Ward''s and K-means) in terms of an internal (VR) criterion.
Pattern RecognitionA tabu-search-based heuristic for clustering
129 Citations2000Chang Sup Sung, Hongtao Jin
This paper considers a clustering problem where a given data set is partitioned into a certain number of natural and homogeneous subsets such that each subset is composed of elements similar to one another but different from those of any other subset.
Journal of Zhejiang University. Science AAn efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering
113 Citations2009Taher Niknam, Babak Amiri +2 more
Simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.
Research Explorer (The University of Manchester)On the performance of ant-based clustering
102 Citations2003Julia Handl, Joshua Knowles +1 more
This work proposes a scheme that enables unbiased interpretation of the clustering solutions obtained, and uses this to conduct a full evaluation of the algorithm, finding evidence that ant-based clustering is a robust and viable alternative.
Pattern Recognition LettersComputational experience on four algorithms for the hard clustering problem
97 Citations1996Khaled S. Al-Sultana, M. Maroof Khan
This paper studies the four algorithms for clustering m objects in c clusters and compares their computational performance, and test these algorithms on several clustering problems from the literature as well as several random problems.
Lecture notes in computer scienceAn ACO-Based Clustering Algorithm
92 Citations2006Yu‐Cheng Kao, Kevin C. Cheng
A new clustering algorithm based on ant colony optimization, called Ant Colony Optimization for Clustering (ACOC), which uses both the accumulated pheromone and the heuristic information, the distances between data objects and cluster centers of ants, to guide artificial ants to group data objects into proper clusters.
Pattern RecognitionAccurate integration of multi-view range images using k-means clustering
80 Citations2007Hong Zhou, Yonghuai Liu
The k-means clustering approach (from the pattern recognition and machine learning literatures) is employed to minimize the integration error and to optimize the fused point locations, resulting in more efficient and effective integration of data.
Chemometrics and Intelligent Laboratory SystemsAdaptive Fuzzy C-Means clustering in process monitoring
78 Citations1999Pekka Teppola, Satu-Pia Mujunen +1 more
Modifications are proposed and a simple strategy for updating the cluster centers is given for the adaptive and the flexible FCM algorithms, which were compared to the basic non-adaptive FCM.
Studies in computational intelligenceReview of Clustering Algorithms
77 Citations2009Wesam Ashour Barbakh, Ying Wu +1 more
Clustering can be considered the most important unsupervised learning problem; as with every other problem of this kind, it deals with finding structure in a collection of unlabeled data.
Journal of Systems and SoftwareACODF: a novel data clustering approach for data mining in large databases
73 Citations2004Cheng-Fa Tsai, Chun‐Wei Tsai +2 more
Journal of Systems and SoftwareACODF: a novel data clustering approach for data mining in large databases
71 Citations2003Cheng-Fa Tsai, Cheng-Fa Tsai +4 more
Simulation results indicate that the proposed novel clustering method (called ant colony optimization with different favor algorithm) performs better than the fast self-organizing map (SOM) combines K-means approach (FSOM+K-me means) and genetic K-Means algorithm (GKA).
Lecture notes in computer scienceApplication of Gravitational Search Algorithm on Data Clustering
71 Citations2011Abdolreza Hatamlou, Salwani Abdullah +1 more
A data clustering algorithm based on the gravitational search algorithm (GSA), in which some candidate solutions for clustering problem are created randomly and then interact with one another via Newton's gravity law to search the problem space, is proposed.
Machine Learning for Audio, Image and Video Analysis
61 Citations2007Francesco Camastra, Alessandro Vinciarelli
This book offers both introductory and advanced material in the combined fields of machine learning and image/video processing and provides an extensive survey of most relevant machine learning techniques for media processing.
Information Processing & ManagementTowards effective document clustering: A constrained K-means based approach
60 Citations2008Guobiao Hu, Shuigeng Zhou +2 more
This work integrates the constraints of cluster membership of a small number of documents into the trace formulation of the sum of square Euclidean distance function of K-means, and transforms into trace maximization, which is further optimized by eigen-decomposition.
Communications in computer and information scienceData Clustering Using Big Bang–Big Crunch Algorithm
60 Citations2011Abdolreza Hatamlou, Salwani Abdullah +1 more
The simulation results indicate the applicability and potential of this algorithm on data clustering and the proposed novel approach is a novel approach based on the Big Bang–Big Crunch algorithm.
Lecture notes in computer scienceRough Sets and Knowledge Technology
53 Citations2009Peng Wen, Yuefeng Li +22 more
Journal of Medicinal ChemistryUse of cluster analysis in the development of structure-activity relations for antitumor triazenes
51 Citations1976William J. Dunn, Michael J. Greenberg +1 more
A series of antitumor triazenes in which the members of the series are physicochemically distinct was designed using the cluster analysis approach as proposed by Hansch and his co-workers and tested against Sarcoma 180 in the mouse.
Adaptation of the F-measure to cluster based lexicon quality evaluation
47 Citations2003Angelo Dalli
An external lexicon quality measure called the L-me measure is derived from the F-measure (Rijsbergen, 1979) and large-scale evaluation results for the Maltilex Corpus are presented.
Studies in computational intelligenceNon-Standard Parameter Adaptation for Exploratory Data Analysis
37 Citations2009Wesam Ashour Barbakh, Ying Wu +1 more
This book first lays the groundwork by reviewing some standard clustering algorithms and projection algorithms before presenting various non-standard criteria for clustering, and considers extensions of the basic mappings which maintain some topology of the original data space.
Computational Statistics & Data AnalysisCluster analysis using multivariate normal mixture models to detect differential gene expression with microarray data
33 Citations2006Yi He, Wei Pan +1 more
The results suggest that multivariate normal mixture models can be useful alternatives to univariate methods to detect differential gene expression in exploratory data analysis.
Lecture notes in computer scienceRough Sets and Knowledge Technology
32 Citations2011Yao, JingTao, RSKT 2011 Banff, Alberta
This book constitutes the refereed proceedings of the 6th International Conference on Rough Sets and Knowledge Technology, RSKT 2011, held in Banff, Canada, in September 2011.
Proceedings of International Conference on Neural Networks (ICNN'97)Genetic algorithms for clustering, feature selection and classification
26 Citations2002Lin‐Yu Tseng, Shiueng Bien Yang
A genetic algorithm is proposed that can automatically cluster the data according to their similarities and automatically find the proper number of clusters and find the weight of each feature such that the application of these features associated with their weights to the classification problem will achieve a good classification rate.
Clustering
7 Citations2002Andrew R. Webb