Yossi Azar
Amos Fiat
Anna Karlin
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.
- 1.R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules Between Sets of Items in Large Databases. In Proc. of the 1993 ACM SIGMOD Conference, pp. 207-216, 1993. Google Scholar
Digital Library
- 2.C. Basu, H. Hirsh and W. Cohen. Recommendation as Classiffication: Using Social and Content-Based Information in Recommendation. In Proceedings of AAAI, 1998. Google ScholarDigital Library
- 3.M. Berry, Z. Drmac, and E. Jessup. Matrices, Vector Spaces and Information Retrieval. In SIAM Review Volume 41, Number 2, pp. 335-362, 1999. Google ScholarDigital Library
- 4.M. Berry, S. Dumais, and G. O'Brien. Using linear algebra for intelligent information retrieval. In SIAM Review 37(4), pp. 573-595, 1995. Google ScholarDigital Library
- 5.R.B. Boppana. Eigenvalues and Graph Bisection: An Average-Case Analysis. In Proc. of 28th Annual FOCS, pp. 280-285, 1987.Google ScholarDigital Library
- 6.Z. Furedi and J. Komlos. The eigenvalues of random symmetric matrices. Combinatorica 1:3, pp. 233-241, 1981.Google ScholarCross Ref
- 7.G.H. Golub and C. F. Van Loan. Matrix Computations, third Edition, the John Hopkins University Press, 1996. Google ScholarDigital Library
- 8.W. Hill, L. Stead, M. Rosenstein and G. Furnas Recommending and Evaluating Choices in A Virtual Community of Use. In Proceedings of the CHI-95 Conference. Google ScholarDigital Library
- 9.Jester shadow.ieor.berkeley.edu/humorGoogle Scholar
- 10.R. Kannan, S. Vempala, A. Vetta, On Clusterings | Good, Bad and Spectral, Proceedings of 41st Annual IEEE Symposium on Foundations on Computer Science, 2000. Google ScholarDigital Library
- 11.J. Kleinberg. Authoritative Sources in a Hyperlinked Environment. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 668-677, 1998 Google ScholarDigital Library
- 12.F. Korn, A. Labrinidis, Y. Kotidis, and C. Faloutsos. Ratio Rules: A New Paradigm for Fast, Quantiffiable Data Mining. In VLDB New York, NY, 1998. Google ScholarDigital Library
- 13.S. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Recommendation Systems: A Probabilistic Analysis. In Foundations of Computer Science, pp. 664-673, 1998. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 15.U. Shardanand and P. Maes Social Information Filtering: Algorithms for Automating "Word of Mouth". . In Proceedings of the CHI-95 Conference. Google ScholarDigital Library
- 16.Sleeper www.pmetrics.com/sleeperGoogle Scholar
- 17.G.W. Stewart. Matrix Algorithms, Volume 1: Basic Decompositions. Society for Industrial and Applied Mathematics, 1998.Google Scholar
Index Terms
- Spectral analysis of data
Recommendations
Spectral collaborative filtering
RecSys '18: Proceedings of the 12th ACM Conference on Recommender SystemsDespite the popularity of Collaborative Filtering (CF), CF-based methods are haunted by the cold-start problem, which has a significantly negative impact on users' experiences with Recommender Systems (RS). In this paper, to overcome the aforementioned ...
Spectral Analysis for Data Mining
ALENEX '01: Revised Papers from the Third International Workshop on Algorithm Engineering and ExperimentationExperimental 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 ...
Analysis of Association rule in Data Mining
ICTCS '16: Proceedings of the Second International Conference on Information and Communication Technology for Competitive StrategiesMining the information from large databases has been predictable by many researchers as a main study in diverse system. Researchers in many fields have given away huge interest in data mining. In recent years, Association rule Discovery has become a ...
Comments