Multi-View Projection Learning via Adaptive Graph Embedding for Dimensionality Reduction
نویسندگان
چکیده
In order to explore complex structures and relationships hidden in data, plenty of graph-based dimensionality reduction methods have been widely investigated extended the multi-view learning field. For reduction, key point is extracting complementary compatible information analyze underlying structure samples, which still a challenging task. We propose novel algorithm that integrates for each view into one framework. Because prespecified graph derived from original noisy high-dimensional data usually low-quality, subspace constructed based on such also low-quality. To obtain optimal we framework learns affinity low-dimensional representation all views performs it jointly. Although noisy, local them valuable. Therefore, process, introduce predefined graphs feature graph. Moreover, assigning weight its importance essential learning, proposed GoMPL automatically allocates an appropriate process. The obtained then adopted learn projection matrix individual by embedding. provide effective alternate update method jointly view. conduct many experiments various benchmark datasets evaluate effectiveness method.
منابع مشابه
Graph Embedding and Dimensionality Reduction - A Survey
Dimension reduction is defined as the process of mapping high-dimensional data to a lowerdimensional vector space. Most machine learning and data mining techniques may not be effective for high-dimensional data. In order to handle this data adequately, its dimensionality needs to be reduced. Dimensionality reduction is also needed for visualization, graph embedding, image retrieval and a variet...
متن کاملGraph Embedding and Nonlinear Dimensionality Reduction
Graph Embedding and Nonlinear Dimensionality Reduction
متن کاملMulti-View Dimensionality Reduction via Canonical Correlation Analysis
We analyze the multi-view regression problem where we have two views X = (X, X) of the input data and a target variable Y of interest. We provide sufficient conditions under which we can reduce the dimensionality of X (via a projection) without loosing predictive power of Y . Crucially, this projection can be computed via a Canonical Correlation Analysis only on the unlabeled data. The algorith...
متن کاملDimensionality Reduction with Adaptive Graph 1
Graph-based dimensionality reduction (DR) methods have 6 been applied successfully in many practical problems such as face 7 recognition, where graph plays a crucial role with the aim of modeling the 8 data distribution or structure. However, the ideal graph is difficult to be 9 known in practice. Usually, one needs to construct graph empirically 10 according to various motivations, priors or a...
متن کاملTransfer Learning via Dimensionality Reduction
Transfer learning addresses the problem of how to utilize plenty of labeled data in a source domain to solve related but different problems in a target domain, even when the training and testing problems have different distributions or features. In this paper, we consider transfer learning via dimensionality reduction. To solve this problem, we learn a low-dimensional latent feature space where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2023
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics12132934