Seeking commonness and inconsistencies: A jointly smoothed approach to multi-view subspace clustering

نویسندگان

چکیده

Multi-view subspace clustering aims to discover the hidden structures from multiple views for robust clustering, and has been attracting considerable attention in recent years. Despite significant progress, most of previous multi-view algorithms are still faced with two limitations. First, they usually focus on consistency (or commonness) views, yet often lack ability capture cross-view inconsistencies representations. Second, many them overlook local cannot jointly leverage enhance representation learning. To address these limitations, this paper, we propose a smoothed (JSMC) approach. Specifically, simultaneously incorporate commonness into The view-consensus grouping effect is presented exploit regularize view-commonness representation, which further associated low-rank constraint via nuclear norm strengthen its cluster structure. Thus inconsistencies, effect, seamlessly incorporated unified objective function, upon an alternating optimization algorithm performed achieve clustering. Experimental results variety real-world datasets confirm superiority our Code available: https://github.com/huangdonghere/JSMC.

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

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

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

منابع مشابه

Robust Localized Multi-view Subspace Clustering

In multi-view clustering, different views may have different confidence levels when learning a consensus representation. Existing methods usually address this by assigning distinctive weights to different views. However, due to noisy nature of realworld applications, the confidence levels of samples in the same viewmay also vary. Thus considering a unified weight for a view may lead to suboptim...

متن کامل

Multi-view low-rank sparse subspace clustering

Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view data. This paper presents an approach to multi-view subspace clustering that learns a joint subspace representation by constructing affinity matrix shared among all views. Relyi...

متن کامل

A Multi-Objective Approach to Fuzzy Clustering using ITLBO Algorithm

Data clustering is one of the most important areas of research in data mining and knowledge discovery. Recent research in this area has shown that the best clustering results can be achieved using multi-objective methods. In other words, assuming more than one criterion as objective functions for clustering data can measurably increase the quality of clustering. In this study, a model with two ...

متن کامل

A subspace co-training framework for multi-view clustering

0167-8655/$ see front matter 2013 Elsevier B.V. All rights reserved. http://dx.doi.org/10.1016/j.patrec.2013.12.003 q This paper has been recommended for acceptance by Jesús Ariel Carrasco Ochoa. ⇑ Corresponding author. Tel.: +358 41 4996553. E-mail addresses: [email protected], [email protected] (X. Zhao), [email protected] (N. Evans), [email protected] (J.-L. Dugelay). Xuran Zhao ⇑, Nichol...

متن کامل

Multi-view clustering via pairwise sparse subspace representation

Multi-view clustering, which aims to cluster datasets with multiple sources of information, has a wide range of applications in the communities of data mining and pattern recognition. Generally, it makes use of the complementary information embedded in multiple views to improve clustering performance. Recent methods usually find a low-dimensional embedding of multi-view data, but often ignore s...

متن کامل

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


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

ژورنال

عنوان ژورنال: Information Fusion

سال: 2023

ISSN: ['1566-2535', '1872-6305']

DOI: https://doi.org/10.1016/j.inffus.2022.10.020