Abstract
Cluster ensembles combine different clustering outputs to obtain a better partition of the data. There are two distinct steps in cluster ensembles, generating a set of initial partitions that are different from one another, and combining the partitions via a consensus functions to generate the final partition. Most of the previous consensus functions require the number of clusters to be specified a priori to obtain a good final partition. In this paper we introduce a new consensus function based on the Ant Colony Algorithms, which can automatically determine the number of clusters and produce highly competitive final clusters. In addition, the proposed method provides a natural way to determine outlier and marginal examples in the data. Experimental results on both synthetic and real-world benchmark data sets are presented to demonstrate the effectiveness of the proposed method in predicting the number of clusters and generating the final partition as well as detecting outlier and marginal examples from data.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Strehl, A., Ghosh, J.: Cluster ensembles-a knowledge reuse framework for combining partitioning. In: IJCAI, Edmonton, Alberta, Canada, pp. 93–98 (2002)
Barthelemy, J.P., Leclerc, B.: The median procedure for partition. Partitioning Data Sets, AMS DIMACS Series in Discrete Mathematics, 3–34 (1995)
Kennedy, J., Russell, S.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)
Fern, X.Z.: Brodley: Random projection for high dimensional data clustering: a cluster ensemble approach. In: ICML, Washington, DC, pp. 186–193 (2003)
Weingessel, A., Dimitriadou, E., Hornik, K.: An ensemble method for clustering. Working paper (2003), http://www.ci.tuwien.ac.at/Conferences/DSC-2003
Topchy, A., Jain, A.K., Punch, W.: A mixture model for clustering ensembles. In: Proceedings of SIAM Conference on Data Mining, pp. 379–390 (2004)
Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. John Wiley and Sons Inc., New York (2001)
Topchy, A., Minaei-Bidgoli, B., Jain, A.K., Punch, W.: Adaptive Clustering ensembles. In: International Conference on Pattern Recognition, Cambridge, UK, pp. 272–275 (2004)
Fern, X.Z., Brodley, C.E.: Solving cluster ensemble problems by bipartite graph partitioning. In: 21th International Conference on Machine Learning, pp. 281–288 (2004)
Monmarch’e, N., Silmane, M., Venturini, G.: AntClass: discovery of clusters in numeric data by an hybridization of an ant colony with k-means algorithm. Internal Report no. 213, Laboratoire Informatique de l’Universite (1999)
Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: A review. ACM Comp. Surveys 31(3), 264–323 (1999)
Blake, C., Merz, C.: UCI repository of machine learning databases (1998), http://archive.ics.uci.edu/ml/
Gose, E., Johnsbaugh, R., Jost, S.: Pattern Recognition and Image Analysis. Prentice Hall, Englewood Cliffs (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azimi, J., Cull, P., Fern, X. (2009). Clustering Ensembles Using Ants Algorithm. In: Mira, J., Ferrández, J.M., Álvarez, J.R., de la Paz, F., Toledo, F.J. (eds) Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira’s Scientific Legacy. IWINAC 2009. Lecture Notes in Computer Science, vol 5601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02264-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-02264-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02263-0
Online ISBN: 978-3-642-02264-7
eBook Packages: Computer ScienceComputer Science (R0)