Minimum Spanning Tree-based Clustering of Large Pareto Archives

被引：0
|
作者：
Jaszkiewicz, Andrzej [1 ]
机构：
[1] Poznan Univ Tech, Fac Comp, Poznan, Poland
来源：
PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION) | 2019年
关键词：
Multiobjective optimization; clustering;
D O I：
10.1145/3319619.3326883
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper we propose the use of Minimum Spanning Tree-based clustering to recursively cluster large sets of potentially Pareto-optimal solutions. We present preliminary results for the multi-objective traveling salesperson problem. The clustering is based on the distances between solutions defined in the decision space but it generates clusters that correspond to clearly defined regions in the objective space.
引用
收藏
页码：1252 / 1253
页数：2
相关论文
共 50 条
  • [21] CHSMST: a clustering algorithm based on hyper surface and minimum spanning tree
    He, Qing
    Zhao, Weizhong
    Shi, Zhongzhi
    SOFT COMPUTING, 2011, 15 (06) : 1097 - 1103
  • [22] A Neighborhood Density Estimation Clustering Algorithm Based on Minimum Spanning Tree
    Luo, Ting
    Zhong, Caiming
    ROUGH SET AND KNOWLEDGE TECHNOLOGY (RSKT), 2010, 6401 : 557 - 565
  • [23] A Novel Minimum Spanning Tree Clustering Algorithm Based on Density Core
    Gao, Qiang
    Gao, Qin-Qin
    Xiong, Zhong-Yang
    Zhang, Yu-Fang
    Zhang, Min
    COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2022, 2022
  • [24] Handwritten text line extraction based on minimum spanning tree clustering
    Yin, Fei
    Liu, Cheng-Lin
    2007 INTERNATIONAL CONFERENCE ON WAVELET ANALYSIS AND PATTERN RECOGNITION, VOLS 1-4, PROCEEDINGS, 2007, : 1123 - 1128
  • [25] CciMST: A Clustering Algorithm Based on Minimum Spanning Tree and Cluster Centers
    Lv, Xiaobo
    Ma, Yan
    He, Xiaofu
    Huang, Hui
    Yang, Jie
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018
  • [26] Segmentation Region Density Clustering Algorithm Based on Minimum Spanning Tree
    Li J.
    Liang Y.
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2019, 31 (09): : 1628 - 1635
  • [27] Clustering with Local Density Peaks-Based Minimum Spanning Tree
    Cheng, Dongdong
    Zhu, Qingsheng
    Huang, Jinlong
    Wu, Quanwang
    Yang, Lijun
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (02) : 374 - 387
  • [28] CHSMST: a clustering algorithm based on hyper surface and minimum spanning tree
    Qing He
    Weizhong Zhao
    Zhongzhi Shi
    Soft Computing, 2011, 15 : 1097 - 1103
  • [29] A spatial clustering algorithm based on minimum spanning tree-like
    Deng, Min
    Liu, Qiliang
    Li, Guangqiang
    Xiao, Qi
    Wuhan Daxue Xuebao (Xinxi Kexue Ban)/Geomatics and Information Science of Wuhan University, 2010, 35 (11): : 1360 - 1364
  • [30] CHSMST: A Clustering algorithm based on Hyper Surface and Minimum Spanning Tree
    He, Qing
    Zhao, Wei-Zhong
    Shi, Zhong-Zhi
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 2657 - 2662
12345