TY - GEN
T1 - Evolutionary multi-objective optimization for multi-view clustering
AU - Jiang, Bo
AU - Qiu, Feiyue
AU - Yang, Shipin
AU - Wang, Liping
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/11/14
Y1 - 2016/11/14
N2 - In some real-world applications, multiple measuring methods are often employed to extract multiple feature groups of data, yielding multi-view data. The main challenge of multiview clustering is to find a suitable way of simultaneously exploiting the complementary information of all views, considering the view conflicts arose by different measures. For perspective of optimization, previous multi-view clustering studies applied weighted sum method to represent degree of conflict and treated it as a weighted sum single-objective optimization problem. In this work, we formatted multi-view clustering as a multi-objective optimization problem, in which each view is regarded as a totally independent feature subset. The clustering objective function in each view is one of the multiple objectives. Five popular multi-objective evolutionary algorithms (MOEAs), i.e., NSGA-II, SPEA2, MOEA/D, SMS-EMOA and NSGA-III, were used to solve the induced multi-objective problem. Six real-world multi-view datasets were used to evaluate the proposed method and the experimental results showed that SPEA2 significantly outperformed the other MOEAs according to three performance evaluation indices.
AB - In some real-world applications, multiple measuring methods are often employed to extract multiple feature groups of data, yielding multi-view data. The main challenge of multiview clustering is to find a suitable way of simultaneously exploiting the complementary information of all views, considering the view conflicts arose by different measures. For perspective of optimization, previous multi-view clustering studies applied weighted sum method to represent degree of conflict and treated it as a weighted sum single-objective optimization problem. In this work, we formatted multi-view clustering as a multi-objective optimization problem, in which each view is regarded as a totally independent feature subset. The clustering objective function in each view is one of the multiple objectives. Five popular multi-objective evolutionary algorithms (MOEAs), i.e., NSGA-II, SPEA2, MOEA/D, SMS-EMOA and NSGA-III, were used to solve the induced multi-objective problem. Six real-world multi-view datasets were used to evaluate the proposed method and the experimental results showed that SPEA2 significantly outperformed the other MOEAs according to three performance evaluation indices.
UR - https://www.scopus.com/pages/publications/85008253045
U2 - 10.1109/CEC.2016.7744208
DO - 10.1109/CEC.2016.7744208
M3 - 会议稿件
AN - SCOPUS:85008253045
T3 - 2016 IEEE Congress on Evolutionary Computation, CEC 2016
SP - 3308
EP - 3315
BT - 2016 IEEE Congress on Evolutionary Computation, CEC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE Congress on Evolutionary Computation, CEC 2016
Y2 - 24 July 2016 through 29 July 2016
ER -