Multi-View Clustering Meets Heterogenous Data: A Fusion Regularized Method

TL;DR

This paper introduces a novel multi-view clustering method that effectively handles heterogeneous and redundant data by using fusion regularization and adaptive group sparsity, improving clustering accuracy and feature selection.

Contribution

It proposes a new fusion regularized clustering approach with adaptive group sparsity for heterogeneous multi-view data, addressing redundancy and heterogeneity challenges.

Findings

Outperforms existing methods in clustering accuracy on real datasets.

Effectively eliminates redundant features through group sparsity.

Demonstrates robustness and efficiency with closed-form solutions in ADMM.

Abstract

Multi-view clustering leverages consistent and complementary information across multiple views to provide more comprehensive insights than single-view analysis. However, the heterogeneity and redundancy of multi-view data pose significant challenges to the existing clustering techniques. To tackle these challenges effectively, this paper proposes a novel multi-view fusion regularized clustering method with adaptive group sparsity, enabling discriminative clustering while capturing informative features. Technically, for heterogeneous multi-view data with mixed-type feature sets, different losses or divergence metrics are considered with a joint fusion penalty to obtain consistent cluster structures. Moreover, the non-convex group sparsity consisting of inter-group sparsity and intra-group sparsity is utilized to eliminate redundant features, thereby enhancing the robustness. Furthermore, we develop an effective alternating direction method of multipliers (ADMM), where all subproblems can be solved in closed form. Extensive numerical experiments on real data validate the superior performance of our presented method in clustering accuracy and feature selection.