A High-Dimensional Particle Swarm Optimization Based on Similarity Measurement

被引:0
|
作者
Feng, Jiqiang [1 ]
Lai, Guixiang [1 ]
Cheng, Shi [2 ]
Zhang, Feng [3 ]
Sun, Yifei [4 ]
机构
[1] Shenzhen Univ, Inst Intelligent Comp Sci, Shenzhen, Peoples R China
[2] Shaanxi Normal Univ, Sch Comp Sci, Xian, Shaanxi, Peoples R China
[3] Xi An Jiao Tong Univ, Sch Elect Engn, Xian, Shaanxi, Peoples R China
[4] Shaanxi Normal Univ, Sch Phys & Informat Technol, Xian, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
High-dimensional particle swarm optimization; Data similarity measure function; Lclose distance;
D O I
10.1007/978-3-319-61824-1_20
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Particle Swarm Optimization (PSO) is a kind of classical population-based intelligent optimization methods that widely used in solving various optimization problems. With the increase of the dimensions of the optimized problem, the high-dimensional particle swarm optimization becomes an urgent, practical and popular issue. Based on data similarly measurement, a high-dimensional PSO algorithm is proposed to solve the high-dimensional problems. The study primarily defines a new distance paradigm based on the existing similarity measurement of high-dimensional data. This is followed by proposes a PSO variant under the new distance paradigm, namely the LPSO algorithm, which is extended from the classical Euclidean space to the metric space. Finally, it is showed that LPSO could obtain better solution at higher convergence speed in high-dimensional search space.
引用
收藏
页码:180 / 188
页数:9
相关论文
共 50 条
  • [31] Frequent item sets mining from high-dimensional dataset based on a novel binary particle swarm optimization
    张中杰
    黄健
    卫莹
    [J]. Journal of Central South University, 2016, 23 (07) : 1700 - 1708
  • [32] Frequent item sets mining from high-dimensional dataset based on a novel binary particle swarm optimization
    Zhong-jie Zhang
    Jian Huang
    Ying Wei
    [J]. Journal of Central South University, 2016, 23 : 1700 - 1708
  • [33] Frequent item sets mining from high-dimensional dataset based on a novel binary particle swarm optimization
    Zhang Zhong-jie
    Huang Jian
    Wei Ying
    [J]. JOURNAL OF CENTRAL SOUTH UNIVERSITY, 2016, 23 (07) : 1700 - 1708
  • [34] Enhanced particle swarm optimization with multi-swarm and multi-velocity for optimizing high-dimensional problems
    Ning, Yong
    Peng, Zishun
    Dai, Yuxing
    Bi, Daqiang
    Wang, Jun
    [J]. APPLIED INTELLIGENCE, 2019, 49 (02) : 335 - 351
  • [35] Enhanced particle swarm optimization with multi-swarm and multi-velocity for optimizing high-dimensional problems
    Yong Ning
    Zishun Peng
    Yuxing Dai
    Daqiang Bi
    Jun Wang
    [J]. Applied Intelligence, 2019, 49 : 335 - 351
  • [36] New particle swarm optimization algorithm based on similarity
    Liu, Jian-Hua
    Fan, Xiao-Ping
    Qu, Zhi-Hua
    [J]. Kongzhi yu Juece/Control and Decision, 2007, 22 (10): : 1155 - 1159
  • [37] An improved particle swarm optimization with mutation based on similarity
    Liu, Jianhua
    Fan, Xiaoping
    Qu, Zhihua
    [J]. ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 4, PROCEEDINGS, 2007, : 824 - +
  • [38] Particle Swarm Optimization in High Dimensional Spaces
    Fernandez-Martinez, Juan L.
    Mukerji, Tapan
    Garcia-Gonzalo, Esperanza
    [J]. SWARM INTELLIGENCE, 2010, 6234 : 496 - +
  • [39] Surrogate Sample-Assisted Particle Swarm Optimization for Feature Selection on High-Dimensional Data
    Song, Xianfang
    Zhang, Yong
    Gong, Dunwei
    Liu, Hui
    Zhang, Wanqiu
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2023, 27 (03) : 595 - 609
  • [40] Heterogeneous Cooperative Bare-Bones Particle Swarm Optimization with Jump for High-Dimensional Problems
    Lee, Joonwoo
    Kim, Won
    [J]. ELECTRONICS, 2020, 9 (09) : 1 - 20