Distributed user Profiling via Spectral Methods
Published Online:19 Feb 2014https://doi.org/10.1287/11-SSY036
References
- , I like it… i like it not: Evaluating user ratings noise in recommender systems. Volume 5535 of Lecture Notes in Computer Science, pages 247–258. Springer Berlin/Heidelberg, 2009. 10.1007/978-3-642-02247-0_24.Google Scholar
- , Oja’s algorithm for graph clustering and markov spectral decomposition. In ValueTools’08: Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools, pages 1–7, ICST, Brussels, Belgium, Belgium, 2008. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).Google Scholar
- , Randomized gossip algorithms. IEEE/ACM Transactions on Networking, 14(SI):2508–2530, 2006. MR2238556Google Scholar
- , Learning Mixtures of Product Distributions Using Correlations and Independence. In R. A. Servedio and T. Zhang, editors, COLT, pages 9–20. Omnipress, 2008.Google Scholar
- , A spectral heuristic for bisecting random graphs. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’05, pages 850–859, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics. MR2298340Google Scholar
- , Spectral clustering by recursive partitioning. In ESA’06: Proceedings of the 14th Conference on Annual European Symposium, pages 2561–267, London, UK, 2006. Springer-Verlag. MR2347148Google Scholar
- , Spectral Clustering with Limited Independence, 2005.Google Scholar
- , Méthodes récursives aléatoires. Techniques stochastiques. Masson, Paris, Milan, Barcelone, 1990. MR1082344Google Scholar
- , Spectral techniques applied to sparse random graphs. Random Struct. Algorithms, 27(2):251–275, 2005. MR2155709Google Scholar
- , A decentralized algorithm for spectral analysis. In STOC, pages 561–568, 2004. MR2121643Google Scholar
- , Matrix completion from noisy entries. Journal of Machine Learning Research, 11:2057–2078, August 2010. MR2678022Google Scholar
- , Gossip PCA. In Proceedings of the ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS’11, pages 209–220, New York, NY, USA, 2011. ACM.Google Scholar
- , The BellKor Solution to the Netflix Grand Prize, 2009.Google Scholar
- , Clustering with Spectral Norm and the k-Means Algorithm. In FOCS, pages 299–308. IEEE Computer Society, 2010. MR3025203Google Scholar
- , Spectral partitioning of random graphs. Proceedings FOCS, pages 529–537, 2001. MR1948742Google Scholar
- , Comparison Methods for Stochastic Models and Risks. J. Wiley and Sons, 2002. MR1889865Google Scholar
- , Netflix prize. http://www.netflixprize.com.Google Scholar
- , On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14, pages 849–856. MIT Press, 2001.Google Scholar
- , On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix. Journal of Math. An. and App., 106(1), 1985. MR0780319Google Scholar
- , Data spectroscopy: Learning mixture models using eigenspaces of convolution operators. In ICML, pages 936–943, 2008.Google Scholar
- , Maximum-margin matrix factorization. In Advances in Neural Information Processing Systems 17, pages 1329–1336. MIT Press, 2005.Google Scholar
- , On the early history of the singular value decomposition. SIAM Review, 35(4):551–566, 1993. MR1247916Google Scholar
- , Distributed user profiling via spectral methods. SIGMETRICS Perform. Eval. Rev., 38:383–384, June 2010.Google Scholar

