Sparse Matrix Computational Techniques in Concept Decomposition Matrix Approximation

DOI10.1007/978-1-4020-8919-0_10zbMath1181.68254OpenAlexW1623027918MaRDI QIDQ5302432

Duran Williams, Chi Shen

Publication date: 7 January 2009

Published in: Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4020-8919-0_10

zbMATH Keywords

least-squaressparse matrix approximationconcept decomposition ma trixconcept vectorsterm-document matrix

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Algorithm AS 136: A K-Means Clustering Algorithm
• Explicit preconditioning of systems of linear algebraic equations with dense matrices
• Clustered SVD strategies in latent semantic indexing
• Approximate inverse preconditionings for sparse linear systems
• Printer graphics for clustering
• Parallel Preconditioning with Sparse Approximate Inverses
• Approximate Inverse Preconditioners via Sparse-Sparse Iterations
• MSP: A Class of Parallel Multistep Successive Sparse Approximate Inverse Preconditioning Strategies
• A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
• Concept decompositions for large sparse text data using clustering