Spectral analysis of data
暂无分享,去创建一个
Anna R. Karlin | J. Saia | Y. Azar | A. Fiat | Frank McSherry | Jared Saia
[1] M. KleinbergJon. Authoritative sources in a hyperlinked environment , 1999 .
[2] Susan T. Dumais,et al. Using Linear Algebra for Intelligent Information Retrieval , 1995, SIAM Rev..
[3] Ravi B. Boppana,et al. Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[4] G. W. Stewart,et al. Matrix Algorithms: Volume 1, Basic Decompositions , 1998 .
[5] Santosh S. Vempala,et al. Latent semantic indexing: a probabilistic analysis , 1998, PODS '98.
[6] Gene H. Golub,et al. Matrix computations (3rd ed.) , 1996 .
[7] Christos Faloutsos,et al. Ratio Rules: A New Paradigm for Fast, Quantifiable Data Mining , 1998, VLDB.
[8] János Komlós,et al. The eigenvalues of random symmetric matrices , 1981, Comb..
[9] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[10] Pattie Maes,et al. Social information filtering: algorithms for automating “word of mouth” , 1995, CHI '95.
[11] Ravi Kumar,et al. Recommendation Systems , 2001 .
[12] William W. Cohen,et al. Recommendation as Classification: Using Social and Content-Based Information in Recommendation , 1998, AAAI/IAAI.
[13] Gene H. Golub,et al. Matrix computations , 1983 .
[14] Mark Rosenstein,et al. Recommending and evaluating choices in a virtual community of use , 1995, CHI '95.
[15] Elizabeth R. Jessup,et al. Matrices, Vector Spaces, and Information Retrieval , 1999, SIAM Rev..
[16] Santosh S. Vempala,et al. On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.