A fast algorithm for computing the contribution of a point to the hypervolume

被引:0
|
作者
Zhou, XiuLing [1 ]
Mao, Ning [1 ]
Li, WenJuan [1 ]
Sun, ChengYi [1 ]
机构
[1] Beijing City Univ, Artificial Intelligence Inst, Mid Rd 269 N Loop-4, Beijing 100083, Peoples R China
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A fast algorithm, called the contribution of a point to the hypervolume by Slicing Objective (CHSO) algorithm, is presented for computing the contribution of a point to the hypervolume directly. It is based on the same idea as HSO algorithm by processing the objectives in a front one at a time, rather than the points one at a time as in LAHC algorithm. It is shown that CHSO is much faster than LAHC for randomly generated data and benchmark data in three to eight objectives. So CHSO will enable the use of hypervolume as a diversity mechanism with larger population in more objectives.
引用
收藏
页码:415 / +
页数:2
相关论文
共 50 条
  • [41] FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES
    HUNT, JW
    SZYMANSKI, TG
    COMMUNICATIONS OF THE ACM, 1977, 20 (05) : 350 - 353
  • [42] A Fast Algorithm for Computing the Number of Magic Series
    Yukimasa Sugizaki
    Daisuke Takahashi
    Annals of Combinatorics, 2022, 26 : 511 - 532
  • [43] Fast algorithm for computing discrete cosine transform
    Kok, CW
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1997, 45 (03) : 757 - 760
  • [44] A FAST ALGORITHM FOR COMPUTING A HISTOGRAM ON RECONFIGURABLE MESH
    JANG, JW
    PARK, H
    PRASANNA, VK
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1995, 17 (02) : 97 - 106
  • [45] A fast algorithm for computing the pseudospectra of Toeplitz matrices
    Wang, Zhengsheng
    Liu, Chuntao
    Li, Yuanjun
    APPLIED MATHEMATICS LETTERS, 2013, 26 (02) : 184 - 188
  • [46] A Fast and Simple Algorithm for Computing Market Equilibria
    Fleischer, Lisa
    Garg, Rahul
    Kapoor, Sanjiv
    Khandekar, Rohit
    Saberi, Amin
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2008, 5385 : 19 - +
  • [47] A Fast Algorithm for Computing the p-Curvature
    Bostan, Alin
    Caruso, Xavier
    Schost, Eric
    PROCEEDINGS OF THE 2015 ACM ON INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC'15), 2015, : 69 - 76
  • [48] A fast algorithm for computing large Fibonacci numbers
    Takahashi, D
    INFORMATION PROCESSING LETTERS, 2000, 75 (06) : 243 - 246
  • [49] Fast algorithm for computing cosine number transform
    Lima, J. B.
    ELECTRONICS LETTERS, 2015, 51 (20) : 1570 - 1571
  • [50] An Updated Algorithm for Fast Computing Positive Region
    Ye Jun
    Tian Xiu Mei
    2012 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING (GRC 2012), 2012, : 216 - 219