Balanced clustering based on collaborative neurodynamic optimization

被引:4
作者
Dai, Xiangguang [1 ,2 ]
Wang, Jun [3 ,4 ]
Zhang, Wei [1 ,2 ]
机构
[1] Chongqing Three Gorges Univ, Sch Comp Sci & Engn, Sch Three Gorges Artificial Intelligence, Chongqing 404120, Peoples R China
[2] Chongqing Three Gorges Univ, Key Lab Intelligent Informat Proc & Control, Chongqing 404120, Peoples R China
[3] City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
[4] City Univ Hong Kong, Sch Data Sci, Kowloon, Hong Kong, Peoples R China
关键词
Balanced clustering; Combinatorial optimization; Collaborative neurodynamic optimization; Hopfield networks; Boltzmann machines; NEURAL-NETWORKS; COMBINATORIAL OPTIMIZATION; BOLTZMANN MACHINES; NP-HARDNESS; ALGORITHM; MODEL;
D O I
10.1016/j.knosys.2022.109026
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Balanced clustering is a semi-supervised learning approach to data preprocessing. This paper presents a collaborative neurodynamic algorithm for balanced clustering. The balanced clustering problem is formulated as a combinatorial optimization problem and reformulated as an Ising model. A collaborative neurodynamic algorithm is developed to solve the formulated balanced clustering problem based on a population of discrete Hopfield networks or Boltzmann machines reinitialized upon their local convergence by using a particle swarm optimization rule. The algorithm inherits the desirable property of almost-sure convergence of collaborative neurodynamic optimization. Experimental results on six benchmark datasets are elaborated to demonstrate the superior convergence and performance of the proposed algorithm against four existing balanced clustering algorithms in terms of balanced clustering quality. (C) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:12
相关论文
共 83 条
  • [1] BOLTZMANN MACHINES FOR TRAVELING SALESMAN PROBLEMS
    AARTS, EHL
    KORST, JHM
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 39 (01) : 79 - 95
  • [2] AARTS EHL, 1991, ALGORITHMICA, V6, P437, DOI 10.1007/BF01759053
  • [3] NP-hardness of Euclidean sum-of-squares clustering
    Aloise, Daniel
    Deshpande, Amit
    Hansen, Pierre
    Popat, Preyas
    [J]. MACHINE LEARNING, 2009, 75 (02) : 245 - 248
  • [4] Balanced k-means clustering on an adiabatic quantum computer
    Arthur, Davis
    Date, Prasanna
    [J]. QUANTUM INFORMATION PROCESSING, 2021, 20 (09)
  • [5] Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
    Bagirov, Adil M.
    Taheri, Sona
    Ugon, Julien
    [J]. PATTERN RECOGNITION, 2016, 53 : 12 - 24
  • [6] Clustering ensembles of neural network models
    Bakker, B
    Heskes, T
    [J]. NEURAL NETWORKS, 2003, 16 (02) : 261 - 269
  • [7] Frequency-sensitive competitive learning for scalable balanced clustering on high-dimensional hyperspheres
    Banerjee, A
    Ghosh, J
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 2004, 15 (03): : 702 - 719
  • [8] Banerjee A, 2002, SIAM PROC S, P333
  • [9] Bradley P. S., 2000, Constrained k-means clustering, V20
  • [10] Document clustering using locality preserving indexing
    Cai, D
    He, XF
    Han, JW
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (12) : 1624 - 1637