Auto-weighted multi-view co-clustering with bipartite graphs

DOI10.1016/j.ins.2019.09.079zbMath1456.68151OpenAlexW2977506081WikidataQ127193079 ScholiaQ127193079MaRDI QIDQ1999151

Zenglin Xu, Shudong Huang, Ivor W. Tsang, Zhao Kang

Publication date: 18 March 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.09.079

zbMATH Keywords

co-clusteringmulti-view learningauto-weighted strategybipartite graph learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (9)

Fast spectral clustering with self-weighted features ⋮ Multiple partitions alignment via spectral rotation ⋮ Robust multi-view graph clustering in latent energy-preserving embedding space ⋮ Shared and individual representation learning with feature diversity for deep multiview clustering ⋮ A survey on model-based co-clustering: high dimension and estimation challenges ⋮ Low-rank tensor approximation with local structure for multi-view intrinsic subspace clustering ⋮ Multi-view clustering with adaptive procrustes on Grassmann manifold ⋮ Target redirected regression with dynamic neighborhood structure ⋮ Possibility degree-based interval-valued \(q\)-rung orthopair fuzzy graphs

Cites Work

• Multi-view clustering based on graph-regularized nonnegative matrix factorization for object recognition
• Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
• Multiple view semi-supervised dimensionality reduction
• Iteratively reweighted least squares minimization for sparse recovery
• Modeling the shape of the scene: A holistic representation of the spatial envelope

This page was built for publication: Auto-weighted multi-view co-clustering with bipartite graphs