Journal Article10.1007/S10844-011-0158-3
Data clustering using bacterial foraging optimization
Miao Wan,Lixiang Li,Jinghua Xiao,Cong Wang,Yixian Yang +4 more
- 01 Apr 2012
- Vol. 38, Iss: 2, pp 321-341
70
TL;DR: Experimental results show that the proposed algorithm is an effective clustering technique and can be used to handle data sets with various cluster sizes, densities and multiple dimensions.
read more
Abstract: Clustering divides data into meaningful or useful groups (clusters) without any prior knowledge. It is a key technique in data mining and has become an important issue in many fields. This article presents a new clustering algorithm based on the mechanism analysis of Bacterial Foraging (BF). It is an optimization methodology for clustering problem in which a group of bacteria forage to converge to certain positions as final cluster centers by minimizing the fitness function. The quality of this approach is evaluated on several well-known benchmark data sets. Compared with the popular clustering method named k-means algorithm, ACO-based algorithm and the PSO-based clustering technique, experimental results show that the proposed algorithm is an effective clustering technique and can be used to handle data sets with various cluster sizes, densities and multiple dimensions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey on nature inspired metaheuristic algorithms for partitional clustering
TL;DR: An up-to-date review of all major nature inspired metaheuristic algorithms employed till date for partitional clustering and key issues involved during formulation of various metaheuristics as a clustering problem and major application areas are discussed.
536
Automatic clustering using nature-inspired metaheuristics
Adán José-García,Wilfrido Gómez-Flores +1 more
- 01 Apr 2016
TL;DR: An up-to-date review of all major nature-inspired metaheuristic algorithms used thus far for automatic clustering, with a strong tendency in using multiobjective and hybrid algorithms to address non-linearly separable problems.
219
A Clustering Approach for the -Diversity Model in Privacy Preserving Data Mining Using Fractional Calculus-Bacterial Foraging Optimization Algorithm
Pawan R. Bhaladhare,Devesh C. Jinwala +1 more
- 16 Sep 2014
TL;DR: An approach that uses fractional calculus (FC) in the chemotaxis step of the BFO algorithm to boost the computational performance of the algorithm and shows that the proposed FC-BFO algorithm derives an optimal cluster as compared to the original B FO algorithm and existing clustering algorithms.
A comprehensive survey of image segmentation: clustering methods, performance parameters, and benchmark datasets.
TL;DR: In this paper, a survey of clustering based image segmentation methods is presented, which includes hierarchical and partitional based clustering methods, as well as meta-heuristic based methods.
Advances in Meta-Heuristic Optimization Algorithms in Big Data Text Clustering
Laith Abualigah,Amir H. Gandomi,Mohamed Abd Elaziz,Husam Al Hamad,Mahmoud Omari,Mohammad Alshinwan,Ahmad M. Khasawneh +6 more
TL;DR: This paper presents a comprehensive survey of the meta-heuristic optimization algorithms on the text clustering applications and highlights its main procedures, its advantages and disadvantages, and recommends potential future research paths.
References
Particle swarm optimization
James Kennedy,Russell C. Eberhart +1 more
- 06 Aug 2002
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
44.1K
Particle Swarm Optimization.
James Kennedy
- 01 Jan 2017
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
35K
Some methods for classification and analysis of multivariate observations
James B. MacQueen
- 01 Jan 1967
TL;DR: The k-means algorithm as mentioned in this paper partitions an N-dimensional population into k sets on the basis of a sample, which is a generalization of the ordinary sample mean, and it is shown to give partitions which are reasonably efficient in the sense of within-class variance.
•Book
Pattern Recognition with Fuzzy Objective Function Algorithms
James C. Bezdek
- 31 Jul 1981
TL;DR: Books, as a source that may involve the facts, opinion, literature, religion, and many others are the great friends to join with, becomes what you need to get.
17.9K
Related Papers (5)
Dervis Karaboga,Celal Ozturk +1 more
- 01 Jan 2011
K. Krishna,M. Narasimha Murty +1 more
- 01 Jun 1999