{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:04Z","timestamp":1763468164273},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,10,24]],"date-time":"2013-10-24T00:00:00Z","timestamp":1382572800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10844-013-0285-0","type":"journal-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T06:15:34Z","timestamp":1382508934000},"page":"289-308","source":"Crossref","is-referenced-by-count":7,"title":["A scalable approach to spectral clustering with SDD solvers"],"prefix":"10.1007","volume":"44","author":[{"given":"Nguyen Lu Dang","family":"Khoa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Chawla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,24]]},"reference":[{"key":"285_CR1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1145\/375551.375608","volume-title":"Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART symposium on Principles of Database Systems, PODS \u201901","author":"D Achlioptas","year":"2001","unstructured":"Achlioptas, D. (2001). Database-friendly random projections. In Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART symposium on Principles of Database Systems, PODS \u201901 (pp. 274\u2013281). New\u00a0York: ACM."},{"key":"285_CR2","doi-asserted-by":"crossref","unstructured":"Chen, X., & Cai, D. (2011). Large scale spectral clustering with landmark-based representation. In\u00a0Twenty-Fifth AAAI Conference on Artificial Intelligence (pp. 313\u2013318).","DOI":"10.1609\/aaai.v25i1.7900"},{"issue":"3","key":"285_CR3","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1109\/TPAMI.2010.88","volume":"33","author":"WY Chen","year":"2011","unstructured":"Chen, W.Y., Song, Y., Bai, H., Lin, C.J., Chang, E.Y. (2011). Parallel spectral clustering in distributed systems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(3), 568\u2013586.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"285_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10115-011-0430-4","volume":"32","author":"T Vries de","year":"2012","unstructured":"de Vries, T., Chawla, S., Houle, M.E. (2012). Density-preserving projections for large-scale local anomaly detection. Knowledge and Information Systems, 32(1), 25\u201352.","journal-title":"Knowledge and Information Systems"},{"key":"285_CR5","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"WE Donath","year":"1973","unstructured":"Donath, W.E., & Hoffman, A.J. (1973). Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17, 420\u2013425.","journal-title":"IBM Journal of Research and Development"},{"key":"285_CR6","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9781614440222","volume-title":"Random walks and electric networks","author":"PG Doyle","year":"1984","unstructured":"Doyle, P.G., & Snell, J.L. (1984). Random walks and electric networks. Washington, DC: Mathematical Association of America."},{"key":"285_CR7","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M. (1973). Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23, 298\u2013305.","journal-title":"Czechoslovak Mathematical Journal"},{"issue":"3","key":"285_CR8","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss, F., & Renders, J.M. (2007). Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transaction on Knowledge and Data Engineering, 19(3), 355\u2013369.","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"285_CR9","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/TPAMI.2004.1262185","volume":"26","author":"C Fowlkes","year":"2004","unstructured":"Fowlkes, C., Belongie, S., Chung, F., Malik, J. (2004). Spectral grouping using the Nystr\u00f6m method. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26, 214\u2013225.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"285_CR10","unstructured":"Frank, A., & Asuncion, A. (2010). UCI machine learning repository. URL: http:\/\/archive.ics.uci.edu\/ml . Accessed 31 Jan 2013"},{"key":"285_CR11","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., & Van Loan, C.F. (1996). Matrix computations (3rd edn.). Baltimore: Johns Hopkins University Press.","edition":"3"},{"key":"285_CR12","doi-asserted-by":"crossref","unstructured":"Johnson, W., & Lindenstrauss, J. (1984). Extensions of Lipschitz mappings into a Hilbert space. In\u00a0Conference in modern analysis and probability (New Haven, Conn., 1982), Contemporary Mathematics (Vol.\u00a026, pp.\u00a0189\u2013206). American Mathematical Society.","DOI":"10.1090\/conm\/026\/737400"},{"key":"285_CR13","unstructured":"Jolliffe, I.T. (2002). Principal component analysis (2nd\u00a0edn.). Springer."},{"key":"285_CR14","unstructured":"Koutis, I., Miller, G.L., Tolliver, D. (2009). Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing. In Proceedings of the 5th international symposium on advances in visual computing: Part I, ISVC\u00a0\u201909 (pp.\u00a01067\u20131078). Berlin, Heidelberg: Springer."},{"key":"285_CR15","doi-asserted-by":"crossref","unstructured":"Koutis, I., Miller, G., Peng, R. (2010). Approaching optimality for solving sdd linear systems. In 2010 51st annual IEEE symposium on Foundations of Computer Science (FOCS) (pp. 235\u2013244).","DOI":"10.1109\/FOCS.2010.29"},{"key":"285_CR16","unstructured":"Koutis, I., Miller, G.L., Peng, R. (2011). A nearly-m log n time solver for sdd linear systems. In\u00a0Proceedings of the 2011 IEEE 52nd annual symposium on Foundations of Computer Science, FOCS \u201911 (pp.\u00a0590\u2013598). Washington, DC: IEEE Computer Society."},{"issue":"4","key":"285_CR17","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg","year":"2007","unstructured":"Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17(4), 395\u2013416.","journal-title":"Statistics and Computing"},{"key":"285_CR18","doi-asserted-by":"crossref","unstructured":"Luxburg, U.V., Bousquet, O., Belkin, M. (2004). On the convergence of spectral clustering on random samples: The normalized case. In\u00a0Proceedings of the 17th annual Conference on Learning Theory (COLT) (pp.\u00a0457\u2013471). Springer.","DOI":"10.1007\/978-3-540-27819-1_32"},{"key":"285_CR19","unstructured":"von\u00a0Luxburg, U., Radl, A., Hein, M. (2010). Getting lost in space: Large sample analysis of the resistance distance. In\u00a0NIPS (pp.\u00a02622\u20132630)."},{"key":"285_CR20","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10618-010-0191-9","volume":"21","author":"D Mavroeidis","year":"2010","unstructured":"Mavroeidis, D. (2010). Accelerating spectral clustering with partial supervision. Data Mining and Knowledge Discovery, 21, 241\u2013258.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"285_CR21","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. In\u00a0Advances in neural information processing systems (pp.\u00a0849\u2013856). MIT Press."},{"issue":"11","key":"285_CR22","doi-asserted-by":"crossref","first-page":"1873","DOI":"10.1109\/TPAMI.2007.1103","volume":"29","author":"H Qiu","year":"2007","unstructured":"Qiu, H., & Hancock, E. (2007). Clustering and embedding using commute times. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(11), 1873\u20131890.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"285_CR23","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22, 888\u2013905.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"285_CR24","unstructured":"Spielman, D.A., & Srivastava, N. (2008). Graph sparsification by effective resistances. In\u00a0Proceedings of the 40th annual ACM Symposium on Theory of Computing, STOC\u00a0\u201908 (pp.\u00a0563\u2013568). New\u00a0York: ACM."},{"key":"285_CR25","unstructured":"Spielman, D.A., & Teng, S.H. (2004). Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In\u00a0Proceedings of the 36th annual ACM Symposium on Theory of Computing, STOC\u00a0\u201904 (pp.\u00a081\u201390). New York: ACM."},{"key":"285_CR26","unstructured":"Spielman, D.A., & Teng, S.H. (2006). Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. CoRR abs\/cs\/0607105."},{"key":"285_CR27","unstructured":"Vaidya, P. (1991). Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners. A Talk Based on this Manuscript was Presented at the IMA Workshop on Graph Theory and Sparse Matrix Computation, October 1991, Minneapolis."},{"key":"285_CR28","doi-asserted-by":"crossref","unstructured":"Venkatasubramanian, S., & Wang, Q. (2011). The Johnson\u2013Lindenstrauss transform: An empirical study. In\u00a0M.\u00a0M\u00fcller-Hannemann, R.F.F. Werneck (Eds.), ALENEX (pp.\u00a0164\u2013173). SIAM.","DOI":"10.1137\/1.9781611972917.16"},{"key":"285_CR29","unstructured":"Wang, L., Leckie, C., Ramamohanarao, K., Bezdek, J. (2009). Approximate spectral clustering. In\u00a0Proceedings of the 13th Pacific-Asia conference on advances in knowledge discovery and data mining, PAKDD\u00a0\u201909 (pp.\u00a0134\u2013146). Berlin Heidelberg: Springer."},{"key":"285_CR30","unstructured":"Yan, D., Huang, L., Jordan, M.I. (2009). Fast approximate spectral clustering. In\u00a0Proceedings of the 15th ACM SIGKDD international conference on Knowledge Discovery and Data mining, KDD\u00a0\u201909 (pp. 907\u2013916). New\u00a0York: ACM."}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0285-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-013-0285-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0285-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T21:26:28Z","timestamp":1716067588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-013-0285-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,24]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["285"],"URL":"https:\/\/doi.org\/10.1007\/s10844-013-0285-0","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,24]]}}}