Spectral analysis of data
Authors:
Open Access
- 6 July 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 619-626
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.Keywords
This publication has 9 references indexed in Scilit:
- Matrices, Vector Spaces, and Information RetrievalSIAM Review, 1999
- Latent semantic indexing1998
- Matrix Algorithms1998
- Using Linear Algebra for Intelligent Information RetrievalSIAM Review, 1995
- Recommending and evaluating choices in a virtual community of use1995
- Social information filtering1995
- Mining association rules between sets of items in large databases1993
- Eigenvalues and graph bisection: An average-case analysis1987
- The eigenvalues of random symmetric matricesCombinatorica, 1981