Nelder-Mead based Marriage in Honey Bees Optimization C-means (NM-MBOC) algorithm for Clustering and it's Convergence Analysis

DOI

10.2991/icence-16.2016.82How to use a DOI?

Keywords

Marriage in honey bees optimization (MBO); C-means, Nelder-Mead method; Markov chain

Abstract

Clustering is the method to partition unlabeled data, whitch is very important in bioinformatics. To overcome the difficult of balancing between different cluster criteria, we use multi-objective optimization to solve the problem. In this paper, we propose an Nelder-Mead based Marriage in Honey Bees Optimization C-means (NM-MBOC) algorithm for clustering. The pareto-optimal front that gives the optimal number of clusters as a solution set is obtained by NM-MBOC. The convergence is proven by Markov Chain Theory. In the end, tested with the UCI datasets, the effectiveness of the proposed approach is shown.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Chenguang Yang
AU  - QiaogeLiu Li
PY  - 2016/09
DA  - 2016/09
TI  - Nelder-Mead based Marriage in Honey Bees Optimization C-means (NM-MBOC) algorithm for Clustering and it's Convergence Analysis
BT  - Proceedings of the 2nd International Conference on Electronics, Network and Computer Engineering (ICENCE 2016)
PB  - Atlantis Press
SP  - 428
EP  - 437
SN  - 2352-538X
UR  - https://doi.org/10.2991/icence-16.2016.82
DO  - 10.2991/icence-16.2016.82
ID  - Yang2016/09
ER  -