Fetching the paper…
Reading the bibliography…
We give a 3-pass, polylog-space streaming PTAS for the constrained binary $k$-means problem and a 4-pass, polylog-space streaming PTAS for the binary $\ell_0$-low rank approximation problem.
Applications of weighted Voronoi diagrams and randomization to variance-based k k -clustering: (extended abstract)
Mary Inaba, Naoki Katoh, and Hiroshi Imai · 1994
Earlier work this paper cites.
A microeconomic view of data mining
Jon Kleinberg, Christos Papadimitriou, and Prabhakar Raghavan · 1998
Earlier work this paper cites.
On two segmentation problems
Noga Alon and Benny Sudakov · 1999
Earlier work this paper cites.
Polynomial-time approximation schemes for geometric min-sum median clustering
Rafail Ostrovsky and Yuval Rabani · 2002
Earlier work this paper cites.
A simple algorithm for topic identification in 0–1 data
Jouni K. Seppänen, Ella Bingham, and Heikki Mannila · 2003
Earlier work this paper cites.
Segmentation problems
Jon Kleinberg, Christos Papadimitriou, and Prabhakar Raghavan · 2004
Earlier work this paper cites.
Noisy-OR component analysis and its application to link analysis
Tomas Singliar and Milos Hauskrecth · 2006
Earlier work this paper cites.
Mining discrete patterns via binary matrix factorization
Bao-Hong Shen, Shuiwang Ji, and Jieping Ye · 2009
Earlier work this paper cites.
Discovery of optimal factors in binary data via a novel method of matrix decomposition
Radim Belohlavek and Vilem Vychodil · 2010
Cited alongside, same era.
Ica over finite fields
Harold W. Gutch, Peter Gruber, and Fabian J. Theis · 2010
Cited alongside, same era.
Linear-time approximation schemes for clustering problems in any dimensions
Amit Kumar, Yogish Sabharwal, and Sandeep Sen · 2010
Cited alongside, same era.
Streaming k k -means on well-clusterable data
Vladimir Braverman, Adam Meyerson, Rafail Ostrovsky, Alan Roytman, Michael Shindler, and Brian Tagiku · 2011
Cited alongside, same era.
A simple D 2 D^{2} -sampling based PTAS for k k -means and other clustering problems
Ragesh Jaiswal, Amit Kumar, and Sandeep Sen · 2014
Cited alongside, same era.
A Clustering Approach to Constrained Binary Matrix Factorization
Peng Jiang, Jiming Peng, Michael Heath, and Rui Yang · 2014
Generalized independent component analysis over finite alphabets
A. Painsky, S. Rosset, and M. Feder · 2016
Later among the works it cites.
Approximation algorithms for ℓ 0 \ell_{0} -low rank approximation
Karl Bringmann, Pavel Kolev, and David P. Woodruff · 2017
Later among the works it cites.
Faster algorithms for the constrained k-means problem
Anup Bhattacharya, Ragesh Jaiswal, and Amit Kumar · 2018
Later among the works it cites.
Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations
Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang, and Yuchen Zhou · 2018
Later among the works it cites.
Approximation schemes for low-rank binary matrix approximation problems
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A unified framework for clustering constrained data without locality property
Hu Ding and Jinhui Xu · 2015
Cited alongside, same era.
On the complexity of robust PCA and ℓ 1 \ell_{1} -norm low-rank matrix approximation
Nicolas Gillis and Stephen A. Vavasis · 2015
Cited alongside, same era.
Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, and David P. Woodruff · 2019
Closest in time.
Streaming PTAS for Constrained k k -Means
Dishant Goyal, Ragesh Jaiswal, and Amit Kumar · 2019
Closest in time.