Clustered Matrix Approximation

DOI10.1137/15M1042206zbMath1349.15042OpenAlexW2546081424MaRDI QIDQ2834689

Inderjit S. Dhillon, Berkant Savas

Publication date: 23 November 2016

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/15m1042206

zbMATH Keywords

clusteringprobabilistic algorithmsdimensionality reductionsocial network analysisgraph miningmatrix approximationlow rank matrix approximationcoclustering

Mathematics Subject Classification ID

Related Items (1)

Structured Matrix Approximations via Tensor Decompositions

Uses Software

• Graclus

Cites Work

• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• A survey of kernel and spectral methods for clustering
• Clustered SVD strategies in latent semantic indexing
• Structure and Perturbation Analysis of Truncated SVDs for Column-Partitioned Matrices
• Network Properties Revealed through Matrix Functions
• Emergence of Scaling in Random Networks
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• A Randomized Algorithm for Principal Component Analysis
• Numerical Methods for Computing Angles Between Linear Subspaces
• Numerical Methods in Matrix Computations
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Concept decompositions for large sparse text data using clustering
• Graclus

This page was built for publication: Clustered Matrix Approximation