{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T05:28:32Z","timestamp":1738992512080,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005275"},{"type":"electronic","value":"9783642005282"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00528-2_1","type":"book-chapter","created":{"date-parts":[[2009,2,16]],"date-time":"2009-02-16T09:31:32Z","timestamp":1234776692000},"page":"1-20","source":"Crossref","is-referenced-by-count":10,"title":["Spectral Clustering in Social Networks"],"prefix":"10.1007","author":[{"given":"Mikl\u00f3s","family":"Kurucz","sequence":"first","affiliation":[]},{"given":"Andr\u00e1s A.","family":"Bencz\u00far","sequence":"additional","affiliation":[]},{"given":"K\u00e1roly","family":"Csalog\u00e1ny","sequence":"additional","affiliation":[]},{"given":"L\u00e1szl\u00f3","family":"Luk\u00e1cs","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), pp. 171\u2013180 (2000)","DOI":"10.1145\/335305.335326"},{"issue":"11","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1109\/43.469661","volume":"14","author":"C.J. Alpert","year":"1995","unstructured":"Alpert, C.J., Kahng, A.B.: Multiway partitioning via geometric embeddings, orderings, and dynamic programming. IEEE Trans. on CAD of Integrated Circuits and Systems\u00a014(11), 1342\u20131358 (1995)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"issue":"1-2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C.J. Alpert","year":"1995","unstructured":"Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: a survey. Integr. VLSI J.\u00a019(1-2), 1\u201381 (1995)","journal-title":"Integr. VLSI J."},{"key":"1_CR4","first-page":"195","volume-title":"DAC 1995: Proceedings of the 32nd ACM\/IEEE conference on Design automation","author":"C.J. Alpert","year":"1995","unstructured":"Alpert, C.J., Yao, S.-Z.: Spectral partitioning: the more eigenvectors, the better. In: DAC 1995: Proceedings of the 32nd ACM\/IEEE conference on Design automation, pp. 195\u2013200. ACM Press, New York (1995)"},{"issue":"6","key":"1_CR5","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1109\/TEVC.2003.819264","volume":"7","author":"W.-H. Au","year":"2003","unstructured":"Au, W.-H., Chan, K.C.C., Yao, X.: A novel evolutionary data mining algorithm with applications to churn prediction. IEEE Trans. Evolutionary Computation\u00a07(6), 532\u2013545 (2003)","journal-title":"IEEE Trans. Evolutionary Computation"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1137\/0603056","volume":"3","author":"E.R. Barnes","year":"1982","unstructured":"Barnes, E.R.: An algorithm for partitioning the nodes of a graph. SIAM Journal on Algebraic and Discrete Methods\u00a03(4), 541\u2013550 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"1_CR7","unstructured":"Bencz\u00far, A.A., Csalog\u00e1ny, K., Kurucz, M., Luk\u00e1cs, A., Luk\u00e1cs, L.: Sociodemographic exploration of telecom communities. In: NSF US-Hungarian Workshop on Large Scale Random Graphs Methods for Modeling Mesoscopic Behavior in Biological and Physical Systems (2006)"},{"key":"1_CR8","unstructured":"Berry, M.W.: SVDPACK: A Fortran-77 software library for the sparse singular value decomposition. Technical report, University of Tennessee, Knoxville, TN, USA (1992)"},{"issue":"8","key":"1_CR9","first-page":"721","volume":"34","author":"P. Boldi","year":"2004","unstructured":"Boldi, P., Codenotti, B., Santini, M., Vigna, S.: Ubicrawler: A scalable fully distributed web crawler. Software: Practice & Experience\u00a034(8), 721\u2013726 (2004)","journal-title":"Software: Practice & Experience"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1145\/157485.165117","volume-title":"DAC 1993: Proceedings of the 30th international conference on Design automation","author":"P.K. Chan","year":"1993","unstructured":"Chan, P.K., Schlag, M.D.F., Zien, J.Y.: Spectral k-way ratio-cut partitioning and clustering. In: DAC 1993: Proceedings of the 30th international conference on Design automation, pp. 749\u2013754. ACM Press, New York (1993)"},{"key":"1_CR11","unstructured":"Cheng, D., Kannan, R., Vempala, S., Wang, G.: On a recursive spectral algorithm for clustering from pairwise similarities. Technical report, MIT LCS Technical Report MIT-LCS-TR-906 (2003)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/1065167.1065192","volume-title":"PODS 2005: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","author":"D. Cheng","year":"2005","unstructured":"Cheng, D., Vempala, S., Kannan, R., Wang, G.: A divide-and-merge methodology for clustering. In: PODS 2005: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 196\u2013205. ACM Press, New York (2005)"},{"issue":"25","key":"1_CR13","doi-asserted-by":"publisher","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F. Chung","year":"2002","unstructured":"Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proceedings of the National Academy of Sciences of the United States of America\u00a099(25), 15879\u201315882 (2002)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Chung, F., Lu, L., Vu, V.: Eigenvalues of random power law graphs. Annals of Combinatorics (2003)","DOI":"10.1007\/s000260300002"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"6313","DOI":"10.1073\/pnas.0937490100","volume":"100","author":"F. Chung","year":"2003","unstructured":"Chung, F., Lu, L., Vu, V.: Spectra of random graphs with given expected degrees. Proceedings of National Academy of Sciences\u00a0100, 6313\u20136318 (2003)","journal-title":"Proceedings of National Academy of Sciences"},{"key":"1_CR16","first-page":"605","volume-title":"ICDE 2002: Proceedings of the 18th International Conference on Data Engineering","author":"G. Cormode","year":"2002","unstructured":"Cormode, G., Indyk, P., Koudas, N., Muthukrishnan, S.: Fast mining of massive tabular data via approximate distance computations. In: ICDE 2002: Proceedings of the 18th International Conference on Data Engineering, p. 605. IEEE Computer Society, Washington (2002)"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1009740009307","volume":"1","author":"K.C. Cox","year":"1997","unstructured":"Cox, K.C., Eick, S.G., Wills, G.J., Brachman, R.J.: Brief application description; visual data mining: Recognizing telephone calling fraud. Data Min. Knowl. Discov.\u00a01(2), 225\u2013231 (1997)","journal-title":"Data Min. Knowl. Discov."},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1103\/PhysRevLett.94.160202","volume":"94","author":"I. Der\u00e9nyi","year":"2005","unstructured":"Der\u00e9nyi, I., Palla, G., Vicsek, T.: Clique percolation in random networks. Physical Review Letters\u00a094, 49\u201360 (2005)","journal-title":"Physical Review Letters"},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1145\/502512.502551","volume-title":"KDD 2001: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining","author":"C.H.Q. Ding","year":"2001","unstructured":"Ding, C.H.Q., He, X., Zha, H.: A spectral method to separate disconnected and nearly-disconnected web graph components. In: KDD 2001: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 275\u2013280. ACM Press, New York (2001)"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/ICDM.2001.989507","volume-title":"ICDM 2001: Proceedings of the 2001 IEEE International Conference on Data Mining","author":"C.H.Q. Ding","year":"2001","unstructured":"Ding, C.H.Q., He, X., Zha, H., Gu, M., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: ICDM 2001: Proceedings of the 2001 IEEE International Conference on Data Mining, pp. 107\u2013114. IEEE Computer Society, Washington (2001)"},{"issue":"5","key":"1_CR21","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"W.E. Donath","year":"1973","unstructured":"Donath, W.E., Hoffman, A.J.: Lower bounds for the partitioning of graphs. IBM Journal of Research and Development\u00a017(5), 420\u2013425 (1973)","journal-title":"IBM Journal of Research and Development"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering large graphs via the singular value decomposition. In: Machine Learning, pp. 9\u201333 (2004)","DOI":"10.1023\/B:MACH.0000033113.59016.96"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Mathematical Journal\u00a023(98) (1973)","DOI":"10.21136\/CMJ.1973.101168"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Frieze, A., Kannan, R., Vempala, S.: Fast Monte-Carlo algorithms for finding low rank approximations. In: Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 370\u2013378 (1998)","DOI":"10.1109\/SFCS.1998.743487"},{"key":"1_CR25","unstructured":"Gorny, E.: Russian livejournal: National specifics in the development of a virtual community. pdf online (May 2004)"},{"key":"1_CR26","unstructured":"Gy\u00f6ngyi, Z., Garcia-Molina, H., Pedersen, J.: Web content categorization using link information. Technical report, Stanford University (2006\u20132007)"},{"issue":"9","key":"1_CR27","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L.W. Hagen","year":"1992","unstructured":"Hagen, L.W., Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE Trans. on CAD of Integrated Circuits and Systems\u00a011(9), 1074\u20131085 (1992)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings \u2014 good, bad and spectral. In: IEEE: 2000: ASF, pp. 367\u2013377 (2000)","DOI":"10.1109\/SFCS.2000.892125"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Karypis, G.: CLUTO: A clustering toolkit, release 2.1. Technical Report 02-017, University of Minnesota, Department of Computer Science (2002)","DOI":"10.21236\/ADA439508"},{"issue":"12","key":"1_CR30","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1035134.1035162","volume":"47","author":"R. Kumar","year":"2004","unstructured":"Kumar, R., Novak, J., Raghavan, P., Tomkins, A.: Structure and evolution of blogspace. Commun. ACM\u00a047(12), 35\u201339 (2004)","journal-title":"Commun. ACM"},{"key":"1_CR31","unstructured":"Lang, K.: Finding good nearly balanced cuts in power law graphs. Technical report, Yahoo! Inc. (2004)"},{"key":"1_CR32","unstructured":"Lang, K.: Fixing two weaknesses of the spectral method. In: NIPS 2005: Advances in Neural Information Processing Systems, vol. 18, Vancouver, Canada (2005)"},{"issue":"1","key":"1_CR33","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1011174803800","volume":"43","author":"J. Malik","year":"2001","unstructured":"Malik, J., Belongie, S., Leung, T., Shi, J.: Contour and texture analysis for image segmentation. Int. J. Comput. Vision\u00a043(1), 7\u201327 (2001)","journal-title":"Int. J. Comput. Vision"},{"key":"1_CR34","unstructured":"Meila, M., Shi, J.: A random walks view of spectral segmentation. In: AISTATS (2001)"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Nanavati, A.A., Gurumurthy, S., Das, G., Chakraborty, D., Dasgupta, K., Mukherjea, S., Joshi, A.: On the structural properties of massive telecom graphs: Findings and implications. In: CIKM (2006)","DOI":"10.1145\/1183614.1183678"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Onnela, J.P., Saramaki, J., Hyvonen, J., Szabo, G., Lazer, D., Kaski, K., Kertesz, J., Barabasi, A.L.: Structure and tie strengths in mobile communication networks (October 2006)","DOI":"10.1073\/pnas.0610245104"},{"key":"1_CR37","unstructured":"Open Directory Project (ODP), http:\/\/www.dmoz.org"},{"key":"1_CR38","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/775047.775057","volume-title":"KDD 2002: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"M. Richardson","year":"2002","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: KDD 2002: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 61\u201370. ACM Press, New York (2002)"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s, T.: Improved approximation algorithms for large matrices via random projections. In: Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS) (2006)","DOI":"10.1109\/FOCS.2006.37"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s, T., Bencz\u00far, A.A., Csalog\u00e1ny, K., Fogaras, D., R\u00e1cz, B.: To randomize or not to randomize: Space optimal summaries for hyperlink analysis. In: Proceedings of the 15th International World Wide Web Conference (WWW), pp. 297\u2013306 (2006)","DOI":"10.1145\/1135777.1135823"},{"key":"1_CR41","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI) (2000)"},{"key":"1_CR42","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/1281192.1281262","volume-title":"KDD 2007: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"M. Shiga","year":"2007","unstructured":"Shiga, M., Takigawa, I., Mamitsuka, H.: A spectral clustering approach to optimally combining numerical vectors with a modular network. In: KDD 2007: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 647\u2013656. ACM Press, New York (2007)"},{"key":"1_CR43","first-page":"857","volume-title":"Limits of spectral clustering","author":"U. Luxburg von","year":"2005","unstructured":"von Luxburg, U., Bousquet, O., Belkin, M.: Limits of spectral clustering, pp. 857\u2013864. MIT Press, Cambridge (2005)"},{"issue":"2","key":"1_CR44","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0957-4174(02)00030-1","volume":"23","author":"C.-P. Wei","year":"2002","unstructured":"Wei, C.-P., Chiu, I.-T.: Turning telecommunications call details to churn prediction: a data mining approach. Expert Syst. Appl.\u00a023(2), 103\u2013112 (2002)","journal-title":"Expert Syst. Appl."},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Weiss, Y.: Segmentation using eigenvectors: A unifying view. In: ICCV (2), pp. 975\u2013982 (1999)","DOI":"10.1109\/ICCV.1999.790354"},{"issue":"2","key":"1_CR46","first-page":"190","volume":"8","author":"G.J. Wills","year":"1999","unstructured":"Wills, G.J.: NicheWorks \u2014 interactive visualization of very large graphs. Journal of Computational and Graphical Statistics\u00a08(2), 190\u2013212 (1999)","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"1_CR47","doi-asserted-by":"crossref","unstructured":"Zakharov, P.: Structure of livejournal social network. In: Proceedings of SPIE, vol. 6601, Noise and Stochastics in Complex Systems and Finance (2007)","DOI":"10.1117\/12.726738"},{"key":"1_CR48","first-page":"1057","volume-title":"NIPS","author":"H. Zha","year":"2001","unstructured":"Zha, H., He, X., Ding, C.H.Q., Gu, M., Simon, H.D.: Spectral relaxation for k-means clustering. In: Dietterich, T.G., Becker, S., Ghahramani, Z. (eds.) NIPS, pp. 1057\u20131064. MIT Press, Cambridge (2001)"}],"container-title":["Lecture Notes in Computer Science","Advances in Web Mining and Web Usage Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00528-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T18:47:25Z","timestamp":1738954045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00528-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005275","9783642005282"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00528-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}