Deep Multi-View Clustering Based on Reconstructed Self-Expressive Matrix

نویسندگان

چکیده

Deep Multi-view Subspace Clustering is a powerful unsupervised learning technique for clustering multi-view data, which has achieved significant attention during recent decades. However, most current methods rely on self-expressive layers to obtain the ultimate results, where size of matrix increases quadratically with number input data points, making it difficult handle large-scale datasets. Moreover, since multiple views are rich in information, both consistency and specificity images need be considered. To solve these problems, we propose novel deep approach based reconstructed (DCRSM). We use reconstruction module approximate coefficients using only small training samples, while conventional model must train network entire also shared specific integrate consistent information features fuse between views. The proposed DCRSM extensively evaluated datasets, including Fashion-MNIST, COIL-20, COIL-100, YTF. experimental results demonstrate its superiority over several existing methods, achieving an improvement 1.94% 4.2% accuracy maximum 4.5% NMI across different Our yields competitive even when trained by 50% samples whole

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-Expressive Decompositions for Matrix Approximation and Clustering

Data-aware methods for dimensionality reduction and matrix decomposition aim to find low-dimensional structure in a collection of data. Classical approaches discover such structure by learning a basis that can efficiently express the collection. Recently, “self expression”, the idea of using a small subset of data vectors to represent the full collection, has been developed as an alternative to...

متن کامل

High-Rank Matrix Completion and Clustering under Self-Expressive Models

We propose efficient algorithms for simultaneous clustering and completion of incomplete high-dimensional data that lie in a union of low-dimensional subspaces. We cast the problem as finding a completion of the data matrix so that each point can be reconstructed as a linear or affine combination of a few data points. Since the problem is NP-hard, we propose a lifting framework and reformulate ...

متن کامل

Multi-view Self-Paced Learning for Clustering

Exploiting the information from multiple views can improve clustering accuracy. However, most existing multi-view clustering algorithms are nonconvex and are thus prone to becoming stuck into bad local minima, especially when there are outliers and missing data. To overcome this problem, we present a new multi-view self-paced learning (MSPL) algorithm for clustering, that learns the multi-view ...

متن کامل

Multi-View Clustering via Joint Nonnegative Matrix Factorization

Many real-world datasets are comprised of different representations or views which often provide information complementary to each other. To integrate information from multiple views in the unsupervised setting, multiview clustering algorithms have been developed to cluster multiple views simultaneously to derive a solution which uncovers the common latent structure shared by multiple views. In...

متن کامل

Clinical Document Clustering using Multi-view Non-Negative Matrix Factorization

Clinical document contains vital information like symptom names, medication names, age, gender and some demographical information. These information can be used for giving quick relief from a disease. In existing system, they had built a system for clustering symptom names and medication names using Multi-View Non-Negative Matrix Factorization. While considering the clinical documents the facto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app13158791