Modified bee colony optimization with opposition learning algorithm on use of medical data clustering

被引:0
作者
Sahoo, Srikanta Kumar [1 ]
Pattanaik, Priyabrata [1 ]
Mohanty, Mihir Narayan [1 ]
机构
[1] Siksha O Anusandhan, ITER, Bhubaneswar, Odisha, India
来源
INTELLIGENT DECISION TECHNOLOGIES-NETHERLANDS | 2023年 / 17卷 / 03期
关键词
Bee colony optimization; BCO based clustering; data clustering; k-medoid; opposition based learning; PARTICLE SWARM OPTIMIZATION; ANT COLONY; K-MEANS; SELECTION;
D O I
10.3233/IDT-230123
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Clustering has gained popularity in the data mining field as one of the primary approaches for obtaining data distribution and data analysis. The medical data analysis for different diseases is a great challenge in current research. The benefits of opposition based learning such as faster convergence rate and better approximate result in finding global optimum can be helpful in this area. To achieve faster convergence and better clustering results for medical data, in this work, the authors have proposed an approach utilising modified bee colony optimization with opposition based learning and k-medoids technique. The initial centroid plays an important role in the bee colony optimization based clustering. The proposed approach uses k-medoids algorithm for this task. In order to facilitate faster convergence, it adds the opposite bees which are located at exactly the opposite location of the initial bees. The exploration task is performed by both of these kinds of bees to find potential solutions. This increases the algorithm's capacity for exploration and, consequently, the rate of convergence. Five distinct medical datasets collected from the UCI library are investigated to demonstrate the algorithm's efficacy. The implementation results demonstrate that the algorithm gives better convergence rate and clustering quality compared to some the existing algorithms.
引用
收藏
页码:853 / 868
页数:16
相关论文
共 50 条
  • [1] Abualigah L.M.Q., 2019, FEATURE SELECTION EN
  • [2] A novel Clustering based Genetic Algorithm for route optimization
    Aibinu, A. M.
    Salau, H. Bello
    Rahman, Najeeb Arthur
    Nwohu, M. N.
    Akachukwu, C. M.
    [J]. ENGINEERING SCIENCE AND TECHNOLOGY-AN INTERNATIONAL JOURNAL-JESTECH, 2016, 19 (04): : 2022 - 2034
  • [3] A MapReduce-based artificial bee colony for large-scale data clustering
    Banharnsakun, Anan
    [J]. PATTERN RECOGNITION LETTERS, 2017, 93 : 78 - 84
  • [4] A hybrid PSO-SVM model based on clustering algorithm for short-term atmospheric pollutant concentration forecasting
    Chen, Shuixia
    Wang, Jian-qiang
    Zhang, Hong-yu
    [J]. TECHNOLOGICAL FORECASTING AND SOCIAL CHANGE, 2019, 146 : 41 - 54
  • [5] A social learning particle swarm optimization algorithm for scalable optimization
    Cheng, Ran
    Jin, Yaochu
    [J]. INFORMATION SCIENCES, 2015, 291 : 43 - 60
  • [6] A New Class Topper Optimization Algorithm with an Application to Data Clustering
    Das, Pranesh
    Das, Dushmanta Kumar
    Dey, Shouvik
    [J]. IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2020, 8 (04) : 948 - 959
  • [7] A modified Bee Colony Optimization (MBCO) and its hybridization with k-means for an application to data clustering
    Das, Pranesh
    Das, Dushmanta Kumar
    Dey, Shouvik
    [J]. APPLIED SOFT COMPUTING, 2018, 70 : 590 - 603
  • [8] Dorigo M., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1470, DOI 10.1109/CEC.1999.782657
  • [9] Comparison of Hybrid ACO-k-means algorithm and Grub cut for MRI images segmentation
    El-Khatib, S. A.
    Skobtsov, Y. A.
    Rodzin, S., I
    [J]. 14TH INTERNATIONAL SYMPOSIUM INTELLIGENT SYSTEMS, 2021, 186 : 316 - 322
  • [10] Grey wolf optimization based clustering algorithm for vehicular ad-hoc networks
    Fahad, Muhammad
    Aadil, Farhan
    Zahoor-ur-Rehman
    Khan, Salabat
    Shah, Peer Azmat
    Muhammad, Khan
    Lloret, Jaime
    Wang, Haoxiang
    Lee, Jong Weon
    Mehmood, Irfan
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 2018, 70 : 853 - 870