3D fast convex-hull-based evolutionary multiobjective optimization algorithm
| dc.cclicence | CC-BY-NC-ND | en |
| dc.contributor.author | Zhao, Jiaqi | en |
| dc.contributor.author | Jiao, Licheng | en |
| dc.contributor.author | Liu, Fang | en |
| dc.contributor.author | Fernandes, Vitor Basto | en |
| dc.contributor.author | Yevseyeva, Iryna | en |
| dc.contributor.author | Xia, Shixong | en |
| dc.contributor.author | Emmerich, Michael T. M. | en |
| dc.date.acceptance | 2018-03-03 | en |
| dc.date.accessioned | 2018-04-11T09:54:49Z | |
| dc.date.available | 2018-04-11T09:54:49Z | |
| dc.date.issued | 2018-06 | |
| dc.description.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 O ( n 2 log n ) to O ( n log n ) 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. | en |
| dc.funder | N/A | en |
| dc.identifier.citation | Jiaqi Zhao, Licheng Jiao, Fang Liu, Vitor Basto Fernandes, Iryna Yevseyeva, Shixiong Xia, Michael T.M. Emmerich, (2018) 3D fast convex-hull-based evolutionary multiobjective optimization algorithm, Applied Soft Computing, Volume 67, June 2018, Pages 322-336. | en |
| dc.identifier.doi | https://doi.org/10.1016/j.asoc.2018.03.005 | |
| dc.identifier.uri | http://hdl.handle.net/2086/15932 | |
| dc.language.iso | en_US | en |
| dc.peerreviewed | Yes | en |
| dc.projectid | N/A | en |
| dc.publisher | Elsevier | en |
| dc.researchgroup | Cyber Technology Institute (CTI) | en |
| dc.researchinstitute | Cyber Technology Institute (CTI) | en |
| dc.subject | Convex hull; Area under ROC; Indicator-based evolutionary algorithm; Multiobjective optimization; ROC analysis | en |
| dc.title | 3D fast convex-hull-based evolutionary multiobjective optimization algorithm | en |
| dc.type | Article | en |