An Effective Clustering Algorithm With Ant Colony

被引:32
|
作者
Liu, Xiaoyong [1 ,2 ,3 ]
Fu, Hui [1 ]
机构
[1] Guangdong Polytech Normal Univ, Dept Comp Sci, Guangzhou 510665, Guangdong, Peoples R China
[2] Chinese Acad Sci, Natl Sci Lib, Beijing 100190, Peoples R China
[3] Chinese Acad Sci, Grad Univ, Beijing 100049, Peoples R China
关键词
Ant colony optimization; Clustering Analysis; Clustering Algorithm; Clustering Validity Analysis;
D O I
10.4304/jcp.5.4.598-605
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper proposes a new clustering algorithm based on ant colony to solve the unsupervised clustering problem. Ant colony optimization (ACO) is a population-based meta-heuristic that can be used to find approximate solutions to difficult combinatorial optimization problems. Clustering Analysis, which is an important method in data mining, classifies a set of observations into two or more mutually exclusive unknown groups. This paper presents an effective clustering algorithm with ant colony which is based on stochastic best solution kept--ESacc. The algorithm is based on Sacc algorithm that was proposed by P.S. Shelokar. It's mainly virtue that best values iteratively are kept stochastically. Moreover, the new algorithm using Jaccard index to identify the optimal cluster number. The results of several times experiments in three datasets show that the new algorithm-ESacc is less in running time, is better in clustering effect and more stable than Sacc. Experimental results validate the novel algorithm's efficiency. In addition, Three indices of clustering validity analysis are selected and used to evaluate the clustering solutions of ESacc and Sacc.
引用
收藏
页码:598 / 605
页数:8
相关论文
共 50 条
  • [1] An ant colony clustering algorithm
    Zao, Bao-Jiang
    [J]. PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2007, : 3933 - 3938
  • [2] An adaptive ant colony clustering algorithm
    Chen, L
    Xu, XH
    Chen, YX
    [J]. PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 1387 - 1392
  • [3] A novel ant colony optimization algorithm for clustering
    Zhang, Xin
    Peng, Hong
    Zheng, Qilun
    [J]. 2006 8TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, VOLS 1-4, 2006, : 1931 - +
  • [4] Ant colony algorithm for clustering in portfolio optimization
    Subekti, R.
    Sari, E. R.
    Kusumawati, R.
    [J]. INTERNATIONAL CONFERENCE ON MATHEMATICS, SCIENCE AND EDUCATION 2017 (ICMSE2017), 2018, 983
  • [5] Ant colony clustering algorithm for underdetermined BSS
    [J]. He, X. (hxs2010@hnu.edu.cn), 1600, Chinese Institute of Electronics (22):
  • [6] DOCUMENT CLUSTERING USING ANT COLONY ALGORITHM
    Nagarajan, E.
    Saritha, Keshetty
    MadhuGayathri, G.
    [J]. PROCEEDINGS OF THE 2017 INTERNATIONAL CONFERENCE ON BIG DATA ANALYTICS AND COMPUTATIONAL INTELLIGENCE (ICBDAC), 2017, : 459 - 463
  • [7] A Novel Clustering Algorithm With Ant Colony Optimization
    Fu, Hui
    [J]. PACIIA: 2008 PACIFIC-ASIA WORKSHOP ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION, VOLS 1-3, PROCEEDINGS, 2008, : 1037 - 1040
  • [8] A new ant colony algorithm for a general clustering
    Jiang Huifeng
    Chen Senfa
    [J]. PROCEEDINGS OF 2007 IEEE INTERNATIONAL CONFERENCE ON GREY SYSTEMS AND INTELLIGENT SERVICES, VOLS 1 AND 2, 2007, : 1158 - 1162
  • [9] An improved ant colony optimization algorithm for clustering
    Zhang, Xin
    Peng, Hong
    Zheng, Qi-lun
    Zhang, Xin
    [J]. PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE: 50 YEARS' ACHIEVEMENTS, FUTURE DIRECTIONS AND SOCIAL IMPACTS, 2006, : 725 - 728
  • [10] Ant Colony Clustering Algorithm for Underdetermined BSS
    He Xuansen
    Wang Fang
    Chai Wenbiao
    Wu Liangmin
    [J]. CHINESE JOURNAL OF ELECTRONICS, 2013, 22 (02) : 319 - 324