Fetching the paper…
Reading the bibliography…
The non-negative matrix factorization (NMF) model with an additional orthogonality constraint on one of the factor matrices, called the orthogonal NMF (ONMF), has been found a promising clustering model and can outperform the classical K-means.
1906
Earlier work this paper cites.
R. R. Sokal and F. J. Rohlf, “The comparison of dendrograms by objective methods,” Taxon , vol. 11, no. 2, pp. 33–40, 1962
1962
Earlier work this paper cites.
R. T. Rockafellar, Convex Analysis . Princeton, N.J., USA: Princeton University Press, 1970
1970
Earlier work this paper cites.
S. Lloyd, “Least squares quantization in PCM,” IEEE Trans. Info. Theory , vol. 28, no. 2, pp. 129–137, Mar. 1982
1982
Earlier work this paper cites.
D. D. Lee and H. S. Seung, “Algorithms for non-negative matrix factorization,” in Proc. NIPS , Denver, CO, USA, Dec. 2000, pp. 556–562
2000
Earlier work this paper cites.
K. Y. Yeung and W. L. Ruzzo, “Details of the adjusted rand index and clustering algorithms, supplement to the paper an empirical study on principal component analysis for clustering gene expression data,” Bioinformatics , vol. 17, no. 9, pp. 763–774, May 2001
2001
Earlier work this paper cites.
F. Facchinei and J.-S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Vol. I . New York Berlin Heidelberg: Springer-Verlag, 2003
2003
Earlier work this paper cites.
M.-F. F. Balcan, S. Ehrlich, and Y. Liang, “Distributed K-means and K-median clustering on general topologies,” in Proc. NIPS , Lake Tahoe, Nevada, Dec. 05-10 2013, pp. 1995–2003
2003
Earlier work this paper cites.
J.-P. Brunet, P. Tamayo, T. R. Golub, and J. P. Mesirov, “Metagenes and molecular pattern discovery using matrix factorization,” in Proc. Natl. Acad. Sci. USA , Mar. 23 2004, pp. 4164–4169
2004
Earlier work this paper cites.
C. Ding, T. Li, W. Peng, and H. Park, “Orthogonal non-negative matrix t-factorizations for clustering,” in Proc. ACM KDD , Philadelphia, PA, USA, Aug. 20-23 2006, pp. 20–23
2006
Earlier work this paper cites.
J. Nocedal and S. J. Wright, Numerical Optimization . Springer Series in Operations Research and Financial Engineering, Jan. 1 2006
2006
Earlier work this paper cites.
D. Arthur and S. Vassilvitskii, “K-means++: The advantages of careful seeding,” in Proc. SODA , Philadelphia, PA, USA, Jan. 07-08 2007, pp. 1027–1035
2007
Earlier work this paper cites.
U. Luxburg, “A tutorial on spectral clustering,” Statistics and Computing , vol. 17, no. 4, pp. 395–416, Dec. 2007
2007
Earlier work this paper cites.
S. Choi, “Algorithms for orthogonal non-negative matrix factorization,” in Proc. IEEE IJCNN , Hong Kong, China, Jun. 01-08 2008, pp. 1828–1832
2008
Earlier work this paper cites.
R. Mclendon, A. Friedman, D. Bigner et al. , “Comprehensive genomic characterization defines human glioblastoma genes and core pathways,” Nature , vol. 455, No. 7216, pp. 1061–1068, Oct. 2008
2008
Earlier work this paper cites.
L. V. D. Maaten and G. E. Hinton, “Visualizing data using t-SNE,” Journal of Machine Learning Research , pp. 2579–2605, 2008
2008
Earlier work this paper cites.
C.-H. Zheng, D.-S. Huang, L. Zhang, and X.-Z. Kong, “Tumor clustering using nonnegative matrix factorization with gene selection,” IEEE. Transactions on Information Technology in Biomedicine , vol. 13, no. 4, pp. 599–607, Jul. 2009
2009
Cited alongside, same era.
T. Hastie, R. Tibshirani, and J. H. Friedman, The Elements of Statistical Learning: Data Mining, Inference, and Prediction , 2nd ed. Springer, 2009
2009
Cited alongside, same era.
J. Yoo and S. Choi, “Non-negative matrix factorization with orthogonality constraints,” J. Comp. Sci. Eng. , vol. 4, no. 2, pp. 97–109, May 2010
2010
Cited alongside, same era.
C. Ding, T. Li, and M. I. Jordan, “Convex and semi-nonnegative matrix factorizations,” IEEE TPAMI , vol. 32, no. 1, pp. 45–55, Jan. 2010
2010
Cited alongside, same era.
D. Cai, X. He, and J. Han, “Locally consistent concept factorization for document clustering,” IEEE Trans. Knowl. Data Eng. , vol. 23, no. 6, pp. 902–913, Jun. 2011
2015
Later among the works it cites.
K. Kimura, Y. Tanaka, and M. Kudo, “A fast hierarchical alternating least squares algorithm for orthogonal non-negative matrix factorization,” in Proc. ACML , Nha Trang City, Vietnam, Nov. 26-28 2015, pp. 129–141
2015
Later among the works it cites.
M. Asteris, D. Papailiopoulos, and A. G. Dimakis, “Orthogonal NMF through subspace exploration,” in Proc. NIPS , Canada, Dec. 07-12 2015, pp. 343–351
2015
Later among the works it cites.
O. Fercoq and P. Richtarik, “Accelerated, parallel, and proximal coordinate descent,” SIAM J. Optim. , vol. 25, no. 4, pp. 1997–2023, Jul. 2015
2015
Later among the works it cites.
H. Ding, Y. Liu, L. Huang, and J. Li, “K-means clustering with distributed dimensions,” in Proc. ICML , New York, USA, Jun. 19-24 2016, pp. 1339–1348
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
C. Fevotte and J. Idier, “Algorithms for nonnegative matrix factorization with the β \beta -divergence,” Neural Computation , vol. 23, no. 9, pp. 2421–2456, Sept 2011
2011
Cited alongside, same era.
Z. Liu, Z. Yang, and E. Oja, “Selecting beta-divergence for nonnegative matrix factorization by score matching,” in Proc. ICANN , Lausanne, Switzerland, Sept. 11-14 2012, pp. 419–426
2012
Cited alongside, same era.
C. C. Aggarwal and C. K. Reddy, Data Clustering: Algorithms and Applications . Boca Raton, FI, USA: Chapman & Hall/CRC Press, 2013
2013
Cited alongside, same era.
S. Renaud-Deputter, T. Xiong, and S. Wang, “Combining collaborative filtering and clustering for implicit recommender system,” in Proc. IEEE AIAN , Barcelona, Spain, Mar. 25-28 2013, pp. 748–755
2013
Cited alongside, same era.
A. Mirzal, “Nonparametric orthogonal NMF and its application in cancer clustering,” in Proc. DaEng , Kuala Lumpur, Malaysia, Dec. 15 2013, pp. 177–184
2013
Cited alongside, same era.
J. Das, P. Mukherjee, S. Majumder, and P. Gupta, “Clustering-based recommender system using principles of voting theory,” in Proc. IEEE IC3I , Mysore, India, Nov. 27-29 2014, pp. 230–235
2014
Cited alongside, same era.
F. Pompili, N. Gillis, P. A. Absil, and F. Glineur, “Two algorithms for orthogonal non-negative matrix factorization with application to clustering,” Neurocomputing , vol. 141, no. 2, pp. 15–25, Oct. 2014
2014
Cited alongside, same era.
2016
Later among the works it cites.
J. Xie, R. Girshick, and A. Farhadi, “Unsupervised deep embedding for clustering analysis,” in Proc. ICML , New York, NY, USA, Jun. 19-24 2016, pp. 478–487
2016
Later among the works it cites.
C.-S. Chang, W. Liao, Y.-S. Chen, and L. Liou, “A mathematic theory for clustering in metric spaces,” IEEE Transactions on Network Science and Engineering , vol. 3, no. 1, pp. 2–16, 2016
2016
Later among the works it cites.
B. Yang, X. Fu, and N. D. Sidiropoulos, “Learning from hidden traits: Joint factor analysis and latent clustering,” IEEE Trans. Signal Process. , vol. 65, pp. 256–269, Jan. 2017
2017
Later among the works it cites.
B. Yang, X. Fu, N. D. Sidiropoulos, and M. Hong, “Towards K-means-friendly spaces: Simultaneous deep learning and clustering,” in Proc. ICML , Sydney, Australia, Aug. 06-11 2017, pp. 3861–3870
2017
Later among the works it cites.
J.-S. Pang, M. Razaviyayn, and A. Alvarado, “Computing B-Stationary points of non-smooth DC programs,” Math. Ope. Res. , vol. 42, no. 1, pp. 95–118, Jan. 2017
2017
Later among the works it cites.
S. Wang, P. Wu, M. Zhou, T.-H. Chang, and S. Wu, “Cell subclass identification in single-cell RNA-sequencing data using orthogonal non-negative matrix factorization,” in Proc. IEEE ICASSP , Calgary, Canada, Apr. 15-20 2018, pp. 876–880
2018
Later among the works it cites.
D. N. Phan, H. M. Le, and H. A. L. Thi, “Accelerated difference of convex functions algorithm and its application to sparse binary logistic regression,” in Proc. IJCAI , Stockholm, Sweden, Jul. 13-19 2018, pp. 1369–1375
2018
Later among the works it cites.
A. Bhaskara and M. Wijewardena, “Distributed clustering via LSH based data clustering,” in Proc. NIPS , Stockholmsmassan, Stockholm Sweden, Jul. 10-15 2018, pp. 570–579
2018
Later among the works it cites.
S. Wang, T.-H. Chang, Y. Cui, and J.-S. Pang, “Clustering by orthogonal non-negative matrix factorization: A sequential non-convex penalty approach,” in Proc. IEEE ICASSP , Brighton, UK, May 12-17 2019, pp. 5576–5580
2019
Closest in time.
S. Chen, S. M, A. M.-C. So, and T. Zhang, “Proximal gradient method for non-smooth optimization over the Stiefel manifold,” SIAM J. Optim. , vol. 30, no. 1, pp. 210–239, Jan. 2020
2020
Closest in time.
E. F. Figueroa and O. Dalmau, “Transportless conjugate gradient for optimization on Stiefel manifold,” Journal of Computational Mathematics , vol. 39, no. 151, pp. 1–18, May 2020
2020
Closest in time.