{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T06:54:03Z","timestamp":1768028043990,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2001,7,6]],"date-time":"2001-07-06T00:00:00Z","timestamp":994377600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2001,7,6]]},"DOI":"10.1145\/380752.380859","type":"proceedings-article","created":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T16:40:52Z","timestamp":1069778452000},"page":"619-626","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":151,"title":["Spectral analysis of data"],"prefix":"10.1145","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[{"name":"Dept. of Computer Science, Tel Aviv University, Tel-Aviv 69978, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amos","family":"Fiat","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, Tel Aviv University, Tel-Aviv 69978, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Karlin","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, University of Washington at Seattle"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"McSherry","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, University of Washington at Seattle"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, University of Washington at Seattle"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2001,7,6]]},"reference":[{"key":"e_1_3_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_1_2_2","volume-title":"Proceedings of AAAI","author":"Basu C.","year":"1998","unstructured":"C. Basu , H. Hirsh and W. Cohen . Recommendation as Classiffication: Using Social and Content-Based Information in Recommendation . In Proceedings of AAAI , 1998 . C. Basu, H. Hirsh and W. Cohen. Recommendation as Classiffication: Using Social and Content-Based Information in Recommendation. In Proceedings of AAAI, 1998."},{"key":"e_1_3_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347035"},{"key":"e_1_3_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/1037127"},{"key":"e_1_3_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.22"},{"key":"e_1_3_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579329"},{"key":"e_1_3_2_1_7_2","volume-title":"Matrix Computations","author":"Golub G.H.","year":"1996","unstructured":"G.H. Golub and C. F. Van Loan . Matrix Computations , third Edition, the John Hopkins University Press , 1996 . G.H. Golub and C. F. Van Loan. Matrix Computations, third Edition, the John Hopkins University Press, 1996."},{"key":"e_1_3_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/223904.223929"},{"key":"e_1_3_2_1_9_2","unstructured":"Jester shadow.ieor.berkeley.edu\/humor  Jester shadow.ieor.berkeley.edu\/humor"},{"key":"e_1_3_2_1_10_2","volume-title":"Proceedings of 41st Annual IEEE Symposium on Foundations on Computer Science","author":"Kannan R.","year":"2000","unstructured":"R. Kannan , S. Vempala , A. Vetta , On Clusterings | Good, Bad and Spectral , Proceedings of 41st Annual IEEE Symposium on Foundations on Computer Science , 2000 . R. Kannan, S. Vempala, A. Vetta, On Clusterings | Good, Bad and Spectral, Proceedings of 41st Annual IEEE Symposium on Foundations on Computer Science, 2000."},{"key":"e_1_3_2_1_11_2","first-page":"668","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms","author":"Kleinberg J.","year":"1998","unstructured":"J. Kleinberg . Authoritative Sources in a Hyperlinked Environment . In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms , pp. 668 - 677 , 1998 J. Kleinberg. Authoritative Sources in a Hyperlinked Environment. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 668-677, 1998"},{"key":"e_1_3_2_1_12_2","volume-title":"Quantiffiable Data Mining. In VLDB New York","author":"Korn F.","year":"1998","unstructured":"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 . 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."},{"key":"e_1_3_2_1_13_2","first-page":"664","volume-title":"Foundations of Computer Science","author":"Kumar S.","year":"1998","unstructured":"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. 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."},{"key":"e_1_3_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275505"},{"key":"e_1_3_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/223904.223931"},{"key":"e_1_3_2_1_16_2","unstructured":"Sleeper www.pmetrics.com\/sleeper  Sleeper www.pmetrics.com\/sleeper"},{"key":"e_1_3_2_1_17_2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971408","volume-title":"Matrix Algorithms, Volume 1: Basic Decompositions","author":"Stewart G.W.","year":"1998","unstructured":"G.W. Stewart . Matrix Algorithms, Volume 1: Basic Decompositions . Society for Industrial and Applied Mathematics , 1998 . G.W. Stewart. Matrix Algorithms, Volume 1: Basic Decompositions. Society for Industrial and Applied Mathematics, 1998."}],"event":{"name":"STOC01: 33rd ACM Symposium on Theory of Computing","location":"Hersonissos Greece","acronym":"STOC01","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/380752.380859","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/380752.380859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:43:27Z","timestamp":1750272207000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/380752.380859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7,6]]},"references-count":17,"alternative-id":["10.1145\/380752.380859","10.1145\/380752"],"URL":"https:\/\/doi.org\/10.1145\/380752.380859","relation":{},"subject":[],"published":{"date-parts":[[2001,7,6]]},"assertion":[{"value":"2001-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}