Affiliations: [a]
Zhejiang Guangsha Vocational and Technical University of Construction, Dongyang, China
| [b]
Zhejiang Ruiao Testing Technology Service Co., Ltd., Hangzhou, China
Correspondence:
[*]
Corresponding author. Jinya Cai, Zhejiang Guangsha Vocational and Technical University of Construction, Dongyang, 322100, China. E-mail: caijinya123@163.com.
Abstract: The modified bee colony algorithm is one of the excellent methods that has been proposed in recent years for data clustering. This MBCO algorithm randomly values the primary centers of the cluster by selecting a number of data from the data set, which makes the algorithm sensitive to the presence of noise and outgoing data in the data set and reduces its performance. Therefore, to solve this problem, the proposed method used three approaches to quantify the initial centers of the clusters. In the proposed method, first the initial centers of the clusters are generated by chaos methods, KMeans++algorithm and KHM algorithm to determine the optimal position for the centers. Then the MBCO algorithm starts working with these centers. The performance of the proposed method compared to a number of other clustering methods was evaluated on 7 UCI datasets based on 6 clustering evaluation criteria. For example, in the iris data set, the proposed method with chaos approaches, KHM and KMeans++with accuracy of 0.8725, 0.8737 and 0.8725, respectively, and the MBCO method with accuracy of 0.8678, and in terms of CH criteria, the proposed method with chaotic approaches, KHM and KMeans++reached values of 0.3901, 0.54848, 0.5147 and MBCO method of 0.3620, respectively. Better achieved. In general, the results of the experiments according to the 6 evaluation criteria showed better performance of the proposed method compared to other methods in most data sets according to the 6 evaluation criteria.
