Approximation Algorithms for Tensor Clustering

DOI10.1007/978-3-642-04414-4_30zbMath1262.68151OpenAlexW1758773383MaRDI QIDQ3648764

Suvrit Sra, Arindam Banerjee, Stefanie Jegelka

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)

Related Items (9)

Flow-based dissimilarity measures for reservoir models: a spatial-temporal tensor approach ⋮ Co-Clustering Under the Maximum Norm ⋮ Multi-way set enumeration in weight tensors ⋮ A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering ⋮ Clustering Boolean tensors ⋮ Co-clustering under the maximum norm ⋮ Approximation Algorithms for Tensor Clustering ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• k-means++

Cites Work

• Tensor Decompositions and Applications
• An approximation ratio for biclustering
• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
• Approximation Algorithms for Tensor Clustering
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation Algorithms for Tensor Clustering