Sparse convex biclustering

DOI10.1007/S11222-026-10977-8MaRDI QIDQ7391784zbMATH OpenFDO

Authors Jiakun Jiang, Dewei Xiang, Binhuan Wang, Chenliang Gu

Publication date 2026

Published in Statistics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11222-026-10977-8

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25)

Cites work

• A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
• Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
• Biclustering in data mining
• Biclustering via sparse clustering
• Biclustering via sparse singular value decomposition
• Biclustering with heterogeneous variance
• Convex biclustering
• Direct methods for matrix Sylvester and Lyapunov equations
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• scientific article; zbMATH DE number 720689 (Why is no real title available?)
• scientific article; zbMATH DE number 1750182 (Why is no real title available?)
• Improved biclustering of microarray data demonstrated through systematic performance tests
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Selection of the number of clusters via the bootstrap method
• Solution of the Equation AX + XB = C by Inversion of an M \times M or N \times N Matrix
• Sparse Convex Clustering

This page was built for publication: Sparse convex biclustering

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