.png){kind=icon}
.png){kind=icon}
Return
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
Abstract
En 中文
Graph-based multi-view feature learning methods learn a low-dimensional embedding of the data by modeling the affinity correlations with a graph to reduce the dimension. However, the learned low-dimensional representation relies on a fixed graph that is potentially inaccurate and unreliable. Besides, the graph construction and the projection matrix leaning are separated into two independent processes. To tackle the problems, we propose a robust unsupervised multi-view feature learning method with a dynamic graph. The dynamic graph structure is constructed adaptively and the robust projection matrix is learned simultaneously. Specifically, we adaptively learn a dynamic graph which captures the intrinsic multiple view-specific relations of samples. Robust projection matrix learning suppresses the adverse noises and preserves the intrinsic graph structure. Moreover, the assigned weights are learned automatically for each view without any extra parameter. We finally develop an efficient alternative optimization algorithm to solve the objective formulation. The extensive experiments conducted on several multi-view datasets demonstrate the effectiveness of our proposed method.
Keywords:
Dynamic graph
feature learning
multi-view learning
robust projection matrix
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.