ACM Home Page
Please provide us with feedback. Feedback
Spectral analysis of data
Full text PdfPdf (260 KB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirty-third annual ACM symposium on Theory of computing table of contents
Hersonissos, Greece
Pages: 619 - 626  
Year of Publication: 2001
ISBN:1-58113-349-9
Authors
Yossi Azar  Dept. of Computer Science, Tel Aviv University, Tel-Aviv 69978, Israel
Amos Fiat  Dept. of Computer Science, Tel Aviv University, Tel-Aviv 69978, Israel
Anna Karlin  Dept. of Computer Science, University of Washington at Seattle
Frank McSherry  Dept. of Computer Science, University of Washington at Seattle
Jared Saia  Dept. of Computer Science, University of Washington at Seattle
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 101,   Citation Count: 51
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/380752.380859
What is a DOI?

ABSTRACT

Experimental evidence suggests that spectral techniques are valuable for a wide range of applications. A partial list of such applications include (i) semantic analysis of documents used to cluster documents into areas of interest, (ii) collaborative filtering --- the reconstruction of missing data items, and (iii) determining the relative importance of documents based on citation/link structure. Intuitive arguments can explain some of the phenomena that has been observed but little theoretical study has been done. In this paper we present a model for framing data mining tasks and a unified approach to solving the resulting data mining problems using spectral analysis. These results give strong justification to the use of spectral techniques for latent semantic indexing, collaborative filtering, and web site ranking.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
 
5
R.B. Boppana. Eigenvalues and Graph Bisection: An Average-Case Analysis. In Proc. of 28th Annual FOCS, pp. 280-285, 1987.
 
6
Z. Furedi and J. Komlos. The eigenvalues of random symmetric matrices. Combinatorica 1:3, pp. 233-241, 1981.
 
7
 
8
 
9
Jester shadow.ieor.berkeley.edu/humor
 
10
 
11
 
12
 
13
 
14
C. Papadimitriou, P. Raghavan, H. Tamaki, and S. Vempala. Latent Semantic Indexing: A Probabilistic Analysis. In Proceedings of ACM Symposium on Principles of Database Systems, 1997.
 
15
 
16
Sleeper www.pmetrics.com/sleeper
 
17
G.W. Stewart. Matrix Algorithms, Volume 1: Basic Decompositions. Society for Industrial and Applied Mathematics, 1998.

CITED BY  51

Collaborative Colleagues:
Yossi Azar: colleagues
Amos Fiat: colleagues
Anna Karlin: colleagues
Frank McSherry: colleagues
Jared Saia: colleagues