Auvolat, Alex, and Pascal Vincent. 2015.
“Clustering Is Efficient for Approximate Maximum Inner Product Search.” arXiv:1507.05910 [Cs, Stat], July.
Bach, Francis R., and Michael I. Jordan. 2006.
“Learning Spectral Clustering, with Application to Speech Separation.” Journal of Machine Learning Research 7 (Oct): 1963–2001.
Batson, Joshua, Daniel A. Spielman, and Nikhil Srivastava. 2008.
“Twice-Ramanujan Sparsifiers.” arXiv:0808.0163 [Cs], August.
Bauckhage, Christian. 2015.
“K-Means Clustering Is Matrix Factorization.” arXiv:1512.07548 [Stat], December.
Belkin, Mikhail, and Partha Niyogi. 2003.
“Laplacian Eigenmaps for Dimensionality Reduction and Data Representation.” Neural Computation 15 (6): 1373–96.
Clauset, Aaron. 2005. “Finding Local Community Structure in Networks.”
Clauset, Aaron, Mark E J Newman, and Cristopher Moore. 2004.
“Finding Community Structure in Very Large Networks.” Physical Review E 70 (6): 066111.
Ding, C., X. He, and H. Simon. 2005.
“On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering.” In
Proceedings of the 2005 SIAM International Conference on Data Mining, 606–10. Proceedings. Society for Industrial and Applied Mathematics.
Donoho, David L., and Carrie Grimes. 2003.
“Hessian Eigenmaps: Locally Linear Embedding Techniques for High-Dimensional Data.” Proceedings of the National Academy of Sciences 100 (10): 5591–96.
Dueck, Delbert, Quaid D. Morris, and Brendan J. Frey. 2005.
“Multi-Way Clustering of Microarray Data Using Probabilistic Sparse Matrix Factorization.” Bioinformatics 21 (suppl 1): i144–51.
Elhamifar, E., and R. Vidal. 2013.
“Sparse Subspace Clustering: Algorithm, Theory, and Applications.” IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (11): 2765–81.
Fung, Wai Shing, Ramesh Hariharan, Nicholas J.A. Harvey, and Debmalya Panigrahi. 2011.
“A General Framework for Graph Sparsification.” In
Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, 71–80. STOC ’11. New York, NY, USA: ACM.
Hallac, David, Jure Leskovec, and Stephen Boyd. 2015.
“Network Lasso: Clustering and Optimization in Large Graphs.” arXiv:1507.00280 [Cs, Math, Stat], July.
He, Xiaofei, and Partha Niyogi. 2003.
“Locality Preserving Projections.” In
Proceedings of the 16th International Conference on Neural Information Processing Systems, 16:153–60. NIPS’03. Cambridge, MA, USA: MIT Press.
Huang, G., M. Kaess, and J. J. Leonard. 2013.
“Consistent Sparsification for Graph Optimization.” In
2013 European Conference on Mobile Robots (ECMR), 150–57.
Luxburg, Ulrike von. 2007. “A Tutorial on Spectral Clustering.”
Masuda, Naoki, Mason A. Porter, and Renaud Lambiotte. 2016.
“Random Walks and Diffusion on Networks.” arXiv:1612.03281 [Cond-Mat, Physics:physics], December.
Mixon, Dustin G., Soledad Villar, and Rachel Ward. 2016.
“Clustering Subgaussian Mixtures by Semidefinite Programming.” arXiv:1602.06612 [Cs, Math, Stat], February.
Newman, Mark E J. 2004.
“Detecting Community Structure in Networks.” The European Physical Journal B - Condensed Matter and Complex Systems 38 (2): 321–30.
Peng, J., and Y. Wei. 2007.
“Approximating K‐means‐type Clustering via Semidefinite Programming.” SIAM Journal on Optimization 18 (1): 186–205.
Pourkamali-Anaraki, Farhad, and Stephen Becker. 2016a.
“A Randomized Approach to Efficient Kernel Clustering.” arXiv:1608.07597 [Stat], August.
Schaeffer, S E. 2007.
“Graph Clustering.” Computer Science Review 1 (1): 27–64.
Schölkopf, Bernhard, Phil Knirsch, Alex Smola, and Chris Burges. 1998.
“Fast Approximation of Support Vector Kernel Expansions, and an Interpretation of Clustering as Approximation in Feature Spaces.” In
Mustererkennung 1998, edited by Paul Levi, Michael Schanz, Rolf-Jürgen Ahlers, and Franz May, 125–32. Informatik Aktuell. Springer Berlin Heidelberg.
Shamir, Ohad, and Naftali Tishby. 2011.
“Spectral Clustering on a Budget.” Journal of Machine Learning Research.
Singh, Ajit P., and Geoffrey J. Gordon. 2008.
“A Unified View of Matrix Factorization Models.” In
Machine Learning and Knowledge Discovery in Databases, 358–73. Springer.
Slonim, Noam, Gurinder S Atwal, Gašper Tkačik, and William Bialek. 2005.
“Information-Based Clustering.” Proceedings of the National Academy of Sciences of the United States of America 102: 18297–302.
Spielman, Daniel A., and Shang-Hua Teng. 2004.
“Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems.” In
Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, 81–90. STOC ’04. New York, NY, USA: ACM.
Spielman, D., and N. Srivastava. 2011.
“Graph Sparsification by Effective Resistances.” SIAM Journal on Computing 40 (6): 1913–26.
Tschannen, Michael, and Helmut Bölcskei. 2016.
“Noisy Subspace Clustering via Matching Pursuits.” arXiv:1612.03450 [Cs, Math, Stat], December.
Yan, Donghui, Ling Huang, and Michael I. Jordan. 2009.
“Fast Approximate Spectral Clustering.” In
Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 907–16. KDD ’09. New York, NY, USA: ACM.
Zass, Ron, and Amnon Shashua. 2005.
“A Unifying Approach to Hard and Probabilistic Clustering.” In
Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV’05) Volume 1 - Volume 01, 294–301. ICCV ’05. Washington, DC, USA: IEEE Computer Society.
Zhang, Zhongyuan, Chris Ding, Tao Li, and Xiangsun Zhang. 2007.
“Binary Matrix Factorization with Applications.” In
Seventh IEEE International Conference on Data Mining, 2007. ICDM 2007, 391–400. IEEE.
No comments yet. Why not leave one?