返回
Two-step multi-view data classification based on dynamic Graph-ELM
DOI:10.1016/j.patrec.2023.11.015.png)
摘要
En 中文
This paper focuses on the classification problem of multi-view data, aiming to improve the classification accuracy of current algorithms on multi-view data. Previous multi-view classification algorithms are usually based on exploiting the complementarity of different views and fusing features from different views. A representative category is the graph-based method, which builds a graph matrix for each view, and then fuses the graph matrices of different views to obtain a unified graph. These methods have the following problems: firstly, the graph matrix is simply based on sample similarity usually; secondly, the learned graph matrix does not change dynamically; thirdly, the weight of the graph representation matrix for a single view cannot be learned in the unified graph matrix. Therefore, this paper designs a Two-step classification algorithm based on Dynamic GraphELM, called TSDGELM. In the TSDGELM, the dynamic Graph-ELM is used to obtain the graph representation matrix of each view to save the local neighbor information of the data, and then a joint graph learning algorithm is designed based on the GBS (Graph-Based System) mechanism to fuse the graph matrix of the single-view, and finally the united graph is input into the classifier. To evaluate the effectiveness of the proposed method in this work, we conduct a series of experiments on eight datasets, and the results demonstrate the superiority of the proposed method.
Keyword:
Multi-view data
Classification
Graph learning
GBS
期刊
IF:
3.3
论文数:
8.0K
被引数:
2.0W
机构
引用论文
Interpretable learning based Dynamic Graph Convolutional Networks for Alzheimer's Disease analysis基于可解释学习的动态图卷积网络用于阿尔茨海默病分析
INFORMATION FUSION
IF15.5
Brain segmentation based on multi-atlas and diffeomorphism guided 3D fully convolutional network ensembles
PATTERN RECOGNITION
IF7.6

