Ji Jinchao, Pang Wei, Zheng Yanlin, Wang Zhe, Ma Zhiqiang
School of Computer Science and Information Technology, Northeast Normal University, Changchun, China; Key Lab of Intelligent Information Processing of Jilin Universities, Northeast Normal University, Changchun, China; Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, China.
School of Natural and Computing Sciences, University of Aberdeen, Aberdeen, United Kingdom.
PLoS One. 2015 May 20;10(5):e0127125. doi: 10.1371/journal.pone.0127125. eCollection 2015.
Data with categorical attributes are ubiquitous in the real world. However, existing partitional clustering algorithms for categorical data are prone to fall into local optima. To address this issue, in this paper we propose a novel clustering algorithm, ABC-K-Modes (Artificial Bee Colony clustering based on K-Modes), based on the traditional k-modes clustering algorithm and the artificial bee colony approach. In our approach, we first introduce a one-step k-modes procedure, and then integrate this procedure with the artificial bee colony approach to deal with categorical data. In the search process performed by scout bees, we adopt the multi-source search inspired by the idea of batch processing to accelerate the convergence of ABC-K-Modes. The performance of ABC-K-Modes is evaluated by a series of experiments in comparison with that of the other popular algorithms for categorical data.
具有分类属性的数据在现实世界中无处不在。然而,现有的用于分类数据的划分聚类算法容易陷入局部最优。为了解决这个问题,在本文中,我们基于传统的k-模式聚类算法和人工蜂群方法,提出了一种新颖的聚类算法,即ABC-K-Modes(基于人工蜂群的K-模式聚类)。在我们的方法中,我们首先引入一个单步k-模式过程,然后将此过程与人工蜂群方法相结合来处理分类数据。在侦察蜂执行的搜索过程中,我们采用受批处理思想启发的多源搜索来加速ABC-K-Modes的收敛。通过一系列实验,将ABC-K-Modes的性能与其他流行的分类数据算法的性能进行了比较评估。