Approximation algorithms for tensor clustering

DOI10.1007/978-3-642-04414-4_30MaRDI QIDQ3648764zbMATH OpenOpenAlexFDO

Authors Stefanie Jegelka, Suvrit Sra, Arindam Banerjee

Publication date 1 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04414-4_30

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Recommendations

• Dynamic tensor clustering
• scientific article; zbMATH DE number 6351476
• Clustering Boolean tensors
• Approximate clustering without the approximation
• Low-rank approximation and completion of positive tensors

Cites work

• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
• A generalized maximum entropy approach to Bregman co-clustering and matrix approximation
• An approximation ratio for biclustering
• Approximation algorithms for tensor clustering
• Clustering with Bregman divergences.
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 6351476 (Why is no real title available?)
• scientific article; zbMATH DE number 5764820 (Why is no real title available?)
• scientific article; zbMATH DE number 1950576 (Why is no real title available?)
• scientific article; zbMATH DE number 1382772 (Why is no real title available?)
• Tensor Decompositions and Applications
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem

Cited in

(12)

• Clustering Boolean tensors
• Co-clustering under the maximum norm
• Flow-based dissimilarity measures for reservoir models: a spatial-temporal tensor approach
• Co-clustering under the maximum norm
• Approximation algorithms for tensor clustering
• Multi-way set enumeration in weight tensors
• scientific article; zbMATH DE number 7306902 (Why is no real title available?)
• A sharp blockwise tensor perturbation bound for orthogonal iteration
• Dynamic tensor clustering
• A parameter-less algorithm for tensor co-clustering
• A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering
• Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual

Describes a project that uses

Uses Software

• k-means++

This page was built for publication: Approximation algorithms for tensor clustering

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