×

zbMATH — the first resource for mathematics

Application of honey-bee mating optimization algorithm on clustering. (English) Zbl 1117.92059
Summary: Cluster analysis is one of attractive data mining techniques used in many fields. One popular class of data clustering algorithms is the center based clustering algorithm K-means used as a popular clustering method due to its simplicity and high speed in clustering large datasets. However, K-means has two shortcomings: dependency on the initial state and convergence to local optima and global solutions of large problems cannot be found with reasonable amount of computational effort. In order to overcome local optima problem lots of studies done in clustering.
Over the last decade, modeling the behavior of social insects, such as ants and bees, for the purpose of search and problem solving has been the context of the emerging area of swarm intelligence. Honey-bees are among the most closely studied social insects. Honey-bee mating may also be considered as a typical swarm-based approach to optimization, in which the search algorithm is inspired by the process of marriage in real honey-bees. Honey-bee has been used to model agent-based systems. We proposed application of honeybee mating optimization in clustering (HBMK-means). We compared HBMK-means with other heuristic algorithms in clustering, such as GA, SA, TS, and ACO, by implementing them on several well-known data sets. Our finding shows that the proposed algorithm works as the best one.

MSC:
92D50 Animal behavior
90C59 Approximation methods and heuristics in mathematical programming
91C20 Clustering in the social and behavioral sciences
Software:
UCI-ml
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] A. Perez-Uribe, B. Hirsbrunner, Learning and foraging in robot-bees, in: SAB 2000 Proceedings Supplement Book, International Society for Adaptive Behavior, Honolulu, Hawaii, (2000) pp. 185-194.
[2] Afshar, A.; Bozog Haddad, O.; Marino, M.A.; Adams, B.J., Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation, Journal of the franklin institute, (2006) · Zbl 1269.90142
[3] Murthy, C.A.; Chowdhury, N., Pattern recogn. lett., 17, 825-832, (1996)
[4] C.L. Blake, C.J. Merz, UCI repository of machine learning databases. Available from: <http://www.ics.uci.edu/-mlearn/MLRepository.html>.
[5] Sung, C.S.; Jin, H.W., A tabu-search-based heuristic for clustering, Pattern recogn., 33, 849-858, (2000)
[6] Forgy, E.W., Cluster analysis of multivariate data: efficiency versus interpretability of classifications, Biometrics, 21, 3, 768-769, (1965)
[7] Spath, H., Clustering analysis algorithms, (1989), Ellis Horwood Chichester, UK
[8] H.A. Abbass, A monogenous MBO approach to satisfiability, in: Proceeding of the International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA’2001, Las Vegas, NV, USA, 2001.
[9] H.A. Abbass, Marriage in honey-bee optimization (MBO): a haplometrosis polygynous swarming approach, in: The Congress on Evolutionary Computation (CEC2001), Seoul, Korea, May 2001, (2001) pp. 207-214.
[10] Laidlaw, H.H.; Page, R.E., Mating designs, (), 323-341
[11] Krishna, K.; Murty, Genetic k-means algorithm, IEEE trans. syst. man cybernet. B cybernet., 29, 433-439, (1999)
[12] Al-Sultan, K.S., Tabu-search-based heuristic for clustering, Pattern recogn., 28, 1443-1451, (1995)
[13] Garey, M.R.; Johnson, D.S.; Witsenhausen, H.S., The complexity of the generalized lloyd – max problem, IEEE trans. inform. theory, 28, 2, 255-256, (1982) · Zbl 0476.94009
[14] O. Bozorg Haddad, A. Afshar, M.A. Marin˜ o, Honey bees mating optimization algorithm (HBMO); a new heuristic approach for engineering optimization, in: Proceeding of the First International Conference on Modeling, Simulation and Applied Optimization (ICMSA0/05), Sharjah, UAE, 1-3 February (2005).
[15] O. Bozorg Haddad, A. Afshar, MBO (Marriage Bees Optimization), A new heuristic approach in hydro systems design and operation, in: Proceedings of 1st International Conference On Managing Rivers In The 21st Century: Issues and Challenges, Penang, Malaysia, 21-23 September 2004, pp. 499-504.
[16] Shelokar, P.S.; Jayaraman, V.K.; Kulkarni, B.D., An ant colony approach for clustering, Anal. chim. acta, 509, 187-195, (2004)
[17] kuo, R.I.; Wang, H.S.; Hu, Tung-Lai; Chou, S.H., Application of ant K-means on clustering analysis, Comput. math. appl., 50, 1709-1724, (2005) · Zbl 1085.68633
[18] Page, R.E., The evolution of multiple mating behaviors by honey-bee queens (apis mellifera L.), J. genet., 96, 263-273, (1980)
[19] Moritz, R.F.A.; Southwick, E.E., Bees as super organisms, (1992), Springer Berlin, Germany
[20] Selim, S.Z.; Ismail, M.A., K-means type algorithms: a generalized convergence theorem and characterization of local optimality, IEEE trans. pattern anal. Mach. intell., 6, 81-87, (1984) · Zbl 0546.62037
[21] Selim, Shokri Z.; Al-Sultan, K., A simulated annealing algorithm for the clustering problem, Pattern recogn., 24, 10, 1003-1008, (1991)
[22] Mualik, Ujjwal; Bandyopadhyay, Sanghamitra, Genetic algorithm-based clustering technique, Pattern recogn., 33, 1455-1465, (2000)
[23] Gungor, Zulal; Unler, Alper, K-harmonic means data clustering with simulated annealing heuristic, Appl. math. comput., (2006) · Zbl 1114.65009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.