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
来源：
ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 4, PROCEEDINGS | 2007年
关键词：
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 条
  • [21] On a Fast Algorithm for Computing the Fourier Transform
    A. A. Aleksashkina
    A. N. Kostromin
    Yu. V. Nesterenko
    Moscow University Mathematics Bulletin, 2021, 76 : 123 - 128
  • [22] A Fast Algorithm for Computing the Digamma Function
    Karatsuba, E. A.
    AUTOMATION AND REMOTE CONTROL, 2022, 83 (10) : 1576 - 1589
  • [23] A fast algorithm for computing transitive relation
    Liao, PS
    Chen, TS
    Chung, PC
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1999, 70 (03) : 495 - 504
  • [24] FAST ALGORITHM FOR COMPUTING COLOR GAMUTS
    INUI, M
    COLOR RESEARCH AND APPLICATION, 1993, 18 (05): : 341 - 348
  • [25] A Fast Algorithm for Computing Prefix Probabilities
    Nowak, Franz
    Cotterell, Ryan
    61ST CONFERENCE OF THE THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, ACL 2023, VOL 2, 2023, : 57 - 69
  • [26] On a Fast Algorithm for Computing the Fourier Transform
    Aleksashkina, A. A.
    Kostromin, A. N.
    Nesterenko, Yu, V
    MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2021, 76 (03) : 123 - 128
  • [27] A Fast Algorithm for Computing the Digamma Function
    E. A. Karatsuba
    Automation and Remote Control, 2022, 83 : 1576 - 1589
  • [28] A fast algorithm for computing distance correlation
    Chaudhuri, Arin
    Hu, Wenhao
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2019, 135 : 15 - 24
  • [29] A fast algorithm for computing multilocus recombination
    Chasnov, J. R.
    THEORETICAL POPULATION BIOLOGY, 2010, 77 (04) : 270 - 278
  • [30] A FAST ALGORITHM FOR COMPUTING SAMPLE ENTROPY
    Jiang, Ying
    Mao, Dong
    Xu, Yuesheng
    ADVANCES IN DATA SCIENCE AND ADAPTIVE ANALYSIS, 2011, 3 (1-2) : 167 - 186
12345