| Spectral analysis of data |
| Full text |
Pdf
(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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 19, Downloads (12 Months): 101, Citation Count: 51
|
|
|
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
|
Rakesh Agrawal , Tomasz Imieliński , Arun Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, p.207-216, May 25-28, 1993, Washington, D.C., United States
|
| |
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
|
Will Hill , Larry Stead , Mark Rosenstein , George Furnas, Recommending and evaluating choices in a virtual community of use, Proceedings of the SIGCHI conference on Human factors in computing systems, p.194-201, May 07-11, 1995, Denver, Colorado, United States
[doi> 10.1145/223904.223929]
|
| |
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
|
|
Baruch Awerbuch , Boaz Patt-Shamir , David Peleg , Mark Tuttle, Collaboration of untrusting peers with changing interests, Proceedings of the 5th ACM conference on Electronic commerce, May 17-20, 2004, New York, NY, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Christian Borgs , Jennifer Chayes , Mohammad Mahdian , Amin Saberi, Exploring the community structure of newsgroups, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Allan Borodin , Gareth O. Roberts , Jeffrey S. Rosenthal , Panayiotis Tsaparas, Link analysis ranking: algorithms, theory, and experiments, ACM Transactions on Internet Technology (TOIT), v.5 n.1, p.231-297, February 2005
|
|
|
Baruch Awerbuch , Yossi Azar , Zvi Lotker , Boaz Patt-Shamir , Mark R. Tuttle, Collaborate with strangers to find own preferences, Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, July 18-20, 2005, Las Vegas, Nevada, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sheng Zhang , Yi Ouyang , James Ford , Fillia Makedon, Analysis of a low-dimensional linear model under recommendation attacks, Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, August 06-11, 2006, Seattle, Washington, USA
|
|
|
|
|
|
Noga Alon , Baruch Awerbuch , Yossi Azar , Boaz Patt-Shamir, Tell me who I am: an interactive recommendation system, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, July 30-August 02, 2006, Cambridge, Massachusetts, USA
|
|
|
Robert Jenssen , Deniz Erdogmus , Kenneth E. Hild, II , Jose C. Principe , Torbjørn Eltoft, Information cut for clustering using a gradient descent approach, Pattern Recognition, v.40 n.3, p.796-806, March, 2007
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Anirban Dasgupta , John Hopcroft , Ravi Kannan , Pradipta Mitra, Spectral clustering with limited independence, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, p.1036-1045, January 07-09, 2007, New Orleans, Louisiana
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|