By Topic

A New Objective Reduction Algorithm for Many-Objective Problems: Employing Mutual Information and Clustering Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xiaofang Guo ; Sch. of Comput. Sci. & Technol., Xidian Univ., Xi'an, China ; Xiaoli Wang ; Mingzhao Wang ; Yuping Wang

Many-objective optimization problems involving a large number (more than four) of objectives have aroused extensive attention. It is known that problems with a high number of objectives cause additional difficulties in visualization of the objective space, stagnation in search process and high computational cost. In this paper, a special class of many objective problems, which can be degenerated to a lower dimensional Pareto optimal front, has been investigated. A new objective reduction strategy based on clustering algorithm is proposed, meanwhile, we adopt a new criterion to measure the relationship between pairs of objectives by employing the concept of mutual information. The paper concludes with experimental results that the proposed objective reduction method can accurately eliminate redundant objectives and efficiently obtain essential objective set from original many-objective set on a wide range of test problems.

Published in:

Computational Intelligence and Security (CIS), 2012 Eighth International Conference on

Date of Conference:

17-18 Nov. 2012