An evolutionary many-objective approach to multiview clustering using feature and relational data

被引:18
作者
Jose-Garcia, Adan [1 ]
Handl, Julia [1 ]
Gomez-Flores, Wilfrido [2 ]
Garza-Fabre, Mario [2 ]
机构
[1] Univ Manchester, Manchester Business Sch, Decis & Cognit Sci Res Ctr, Manchester M15 6PB, Lancs, England
[2] Ctr Invest & Estudios Avanzados IPN, Unidad Tamaulipas, Victoria 87130, Tamaulipas, Mexico
基金
英国工程与自然科学研究理事会;
关键词
Data clustering; Multiview clustering; Evolutionary clustering; Evolutionary multiobjective clustering; ALGORITHM; OPTIMIZATION; MOEA/D;
D O I
10.1016/j.asoc.2021.107425
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many application domains involve the consideration of multiple data sources. Typically, each of these data views provides a different perspective of a given set of entities. Inspired by early work on multiview (supervised) learning, multiview algorithms for data clustering offer the opportunity to consider and integrate all this information in an unsupervised setting. In practice, some complex real-world problems may give rise to a handful or more data views, each with different reliability levels. However, existing algorithms are often limited to the consideration of two views only, or they assume that all the views have the same level of importance. Here, we describe the design of an evolutionary algorithm for the problem of multiview cluster analysis, exploiting recent advances in the field of evolutionary optimization to address settings with a larger number of views. The method is capable of considering views that are represented in the form of distinct feature sets, or distinct dissimilarity matrices, or a combination of the two. Our experimental results on standard (including real-world) benchmark datasets confirm that the adoption of a many-objective evolutionary algorithm addresses limitations of previous work, and can easily scale to settings with four or more data views. The final highlight of our paper is an illustration of the potential of the approach in an application to breast lesion classification. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:15
相关论文
共 38 条
[1]   NP-hardness of Euclidean sum-of-squares clustering [J].
Aloise, Daniel ;
Deshpande, Amit ;
Hansen, Pierre ;
Popat, Preyas .
MACHINE LEARNING, 2009, 75 (02) :245-248
[2]  
[Anonymous], 2013, COMPUTER SCI
[3]  
[Anonymous], 2013, P 23 INT JOINT C ART
[4]   How Many Clusters: A Validation Index for Arbitrary-Shaped Clusters [J].
Baya, Ariel E. ;
Granitto, Pablo M. .
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2013, 10 (02) :401-414
[5]   Hybrid system of ART and RBF neural networks for online clustering [J].
Bielecki, Andrzej ;
Wojcik, Mateusz .
APPLIED SOFT COMPUTING, 2017, 58 :1-10
[6]  
Chao Guoqing, 2018, ARXIV171206246
[7]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[8]  
de Carvalho F., 2014, ADV KNOWLEDGE DISCOV, P37, DOI [10.1007/978-3-319-02999-3_3, DOI 10.1007/978-3-319-02999-3_3]
[9]   A multi-view relational fuzzy c-medoid vectors clustering algorithm [J].
de Carvalho, Francisco de A. T. ;
de Melo, Filipe M. ;
Lechevallier, Yves .
NEUROCOMPUTING, 2015, 163 :115-123
[10]   Partitioning hard clustering algorithms based on multiple dissimilarity matrices [J].
de Carvalho, Francisco de A. T. ;
Lechevallier, Yves ;
de Melo, Filipe M. .
PATTERN RECOGNITION, 2012, 45 (01) :447-464