Improving and extending the HV4D algorithm for calculating hypervolume exactly

Wesley Cox, Lyndon While

    Research output: Chapter in Book/Conference paperConference paper

    3 Citations (Scopus)

    Abstract

    We describe extensions to the 4D hypervolume algorithm HV4D that greatly improve its performance in 4D, and that enable an extension of the algorithm to 5D. We add a facility to cope with dominated points, reducing the number of contribution calculations required; and a new representation of the front between slices, eliminating significant repeated work. The former also allows the algorithm to work efficiently with 5D data. The new algorithms can process sets containing 1,000 points in around 1ms in 4D, and around 5–10 ms in 5D. They make a significant contribution to the state-of-the-art.

    Original languageEnglish
    Title of host publicationAI 2016: Advances in Artificial Intelligence
    EditorsByeong Ho Kang, Quan Bai
    PublisherSpringer-Verlag London Ltd.
    Pages243-254
    Number of pages12
    Volume9992 LNAI
    ISBN (Print)9783319501260
    DOIs
    Publication statusPublished - 2016
    Event29th Australasian Joint Conference on Artificial Intelligence, AI 2016 - Hobart, Australia
    Duration: 5 Dec 20168 Dec 2016

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume9992 LNAI
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Conference

    Conference29th Australasian Joint Conference on Artificial Intelligence, AI 2016
    CountryAustralia
    CityHobart
    Period5/12/168/12/16

    Fingerprint Dive into the research topics of 'Improving and extending the HV4D algorithm for calculating hypervolume exactly'. Together they form a unique fingerprint.

    Cite this