Application of Bio-inspired Methods Within Cluster Forest Algorithm

Cluster Forest (CF) is relatively new ensemble clustering method inspired by Random Forest algorithm. The main idea behind of the existing algorithm consists in a construction of a larger number of partial clusterings for feature subsets using K-means algorithm. At the end, these clusterings are aggregated using a method of spectral clustering. This article describes a new application of bio-inspired methods that replaces the K-means algorithm in the computation pipeline. Several bio-inspired methods were tested on eight different datasets and compared with the original CF and others well known clustering methods.

[1]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[2]  Biao Huang,et al.  A Spectral Clustering Algorithm Based on Normalized Cuts , 2008, 2008 International Conference on Computer Science and Software Engineering.

[3]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[4]  Carla E. Brodley,et al.  Random Projection for High Dimensional Data Clustering: A Cluster Ensemble Approach , 2003, ICML.

[5]  T. Soni Madhulatha,et al.  An Overview on Clustering Methods , 2012, ArXiv.

[6]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

[7]  Friedhelm Schwenker,et al.  Pattern classification and clustering: A review of partially supervised learning approaches , 2014, Pattern Recognit. Lett..

[8]  Václav Snásel,et al.  Clustering using artificial bee colony on CUDA , 2014, 2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[9]  Andrew Lewis,et al.  Grey Wolf Optimizer , 2014, Adv. Eng. Softw..

[10]  Miin-Shen Yang,et al.  A robust EM clustering algorithm for Gaussian mixture models , 2012, Pattern Recognit..

[11]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[12]  Leo Breiman,et al.  Random Forests , 2001, Machine Learning.

[13]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[15]  Maria-Iuliana Bocicor,et al.  Dynamic Clustering of Gene Expression Data Using a Fuzzy Approach , 2014, 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[16]  Hans-Peter Kriegel,et al.  OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

[17]  Yiming Cao,et al.  Scalable news recommendation using multi-dimensional similarity and Jaccard-Kmeans clustering , 2014, J. Syst. Softw..

[18]  Nong Sang,et al.  Image segmentation using spectral clustering of Gaussian mixture models , 2014, Neurocomputing.

[19]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[20]  Sandrine Dudoit,et al.  Bagging to Improve the Accuracy of A Clustering Procedure , 2003, Bioinform..

[21]  Michalis Vazirgiannis,et al.  Clustering validity checking methods: part II , 2002, SGMD.

[22]  Xi Chen,et al.  Detecting the migration of mobile service customers using fuzzy clustering , 2015, Inf. Manag..

[23]  Norbert Dojer,et al.  MSARC: Multiple sequence alignment by residue clustering , 2013, Algorithms for Molecular Biology.

[24]  José Carlos Príncipe,et al.  Clustering of time series using a hierarchical linear dynamical system , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[25]  Ana L. N. Fred,et al.  Data clustering using evidence accumulation , 2002, Object recognition supported by user interaction for service robots.