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

DOI10.1016/J.INS.2019.09.079MaRDI QIDQ1999151zbMATH OpenOpenAlexWikidataFDO

Authors Shudong Huang, Zenglin Xu, 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)

Recommendations

• Low-rank tensor constrained co-regularized multi-view spectral clustering
• Multiple graphs learning with a new weighted tensor nuclear norm
• Adaptive structure concept factorization for multiview clustering
• Multi-view kernel construction
• Multi-view spectral clustering via common structure maximization of local and global representations

Cites work

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

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1999151)