Skip navigation
Logo
User training | Reference and search service

Library catalog

Retrievo
EDS
b-on
More
resources
Content aggregators
Please use this identifier to cite or link to this item:

acessibilidade

http://hdl.handle.net/10071/17017
acessibilidade
Title: 3D fast convex-hull-based evolutionary multiobjective optimization algorithm
Authors: Zhao, J.
Jiao, L.
Liu, F.
Basto-Fernandes, V.
Yevseyeva, I.
Xia, S.
Emmerichd, M. T. M.
Keywords: Convex hull
Area under ROC
Indicator-based evolutionary algorithm
Multiobjective optimization
ROC analysis
Issue Date: 2018
Publisher: Elsevier
Abstract: The receiver operating characteristic (ROC) and detection error tradeoff (DET) curves have been widely used in the machine learning community to analyze the performance of classifiers. The area (or volume) under the convex hull has been used as a scalar indicator for the performance of a set of classifiers in ROC and DET space. Recently, 3D convex-hull-based evolutionary multiobjective optimization algorithm (3DCH-EMOA) has been proposed to maximize the volume of convex hull for binary classification combined with parsimony and three-way classification problems. However, 3DCH-EMOA revealed high consumption of computational resources due to redundant convex hull calculations and a frequent execution of nondominated sorting. In this paper, we introduce incremental convex hull calculation and a fast replacement for non-dominated sorting. While achieving the same high quality results, the computational effort of 3DCH-EMOA can be reduced by orders of magnitude. The average time complexity of 3DCH-EMOA in each generation is reduced from to per iteration, where n is the population size. Six test function problems are used to test the performance of the newly proposed method, and the algorithms are compared to several state-of-the-art algorithms, including NSGA-III, RVEA, etc., which were not compared to 3DCH-EMOA before. Experimental results show that the new version of the algorithm (3DFCH-EMOA) can speed up 3DCH-EMOA for about 30 times for a typical population size of 300 without reducing the performance of the method. Besides, the proposed algorithm is applied for neural networks pruning, and several UCI datasets are used to test the performance.
Description: WOS:000431913000024
Peer reviewed: yes
URI: https://ciencia.iscte-iul.pt/id/ci-pub-47370
http://hdl.handle.net/10071/17017
DOI: 10.1016/j.asoc.2018.03.005
ISSN: 1568-4946
Appears in Collections:ISTAR-RI - Artigos em revistas científicas internacionais com arbitragem científica

Files in This Item:
acessibilidade
File Description SizeFormat 
3DF-CHEMOA.pdfPós-print6.54 MBAdobe PDFView/Open    Request a copy


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Currículo DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.