{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T20:54:09Z","timestamp":1792529649288,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642136719","type":"print"},{"value":"9783642136726","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13672-6_42","type":"book-chapter","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T14:38:17Z","timestamp":1274193497000},"page":"435-448","source":"Crossref","is-referenced-by-count":79,"title":["EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs"],"prefix":"10.1007","author":[{"given":"B. Aditya","family":"Prakash","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashwin","family":"Sridharan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mukund","family":"Seshadri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sridhar","family":"Machiraju","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. In: Proc. of the Ninth Annual ACM-SIAM SODA (1998)","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.3.CO;2-K"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Papadimitrou, S., Modha, D., Faloutsos, C.: Fully automatic cross-associations. In: Proc. of the tenth ACM SIGKDD (2004)","DOI":"10.21236\/ADA459025"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding Community Structure in Very Large Networks. Physical Review (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-44816-0_11","volume-title":"Advances in Intelligent Data Analysis","author":"C. Cortes","year":"2001","unstructured":"Cortes, C., Pregibon, D., Volinsky, C.: Communities of interest. In: Hoffmann, F., Adams, N., Fisher, D., Guimar\u00e3es, G., Hand, D.J. (eds.) IDA 2001. LNCS, vol.\u00a02189, pp. 105\u2013114. Springer, Heidelberg (2001)"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Guan, Y., Kullis, B.: Weighted Graph Cuts without EigenVectors: A Multilevel Approach. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1944\u20131957 (November 2007)","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Mallela, S., Modha, D.: Information-theoretic co-clustering. In: Proc. of the ninth ACM SIGKDD (2003)","DOI":"10.1145\/956750.956764"},{"key":"42_CR7","unstructured":"Flake, G., Lawrence, S., Giles, L.: Efficient identification of web communities. In: Proc. of Sixth ACM KDD (2003)"},{"issue":"1","key":"42_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Jnl. on Sci. Comp.\u00a020(1), 359\u2013392 (1999)","journal-title":"SIAM Jnl. on Sci. Comp."},{"key":"42_CR9","unstructured":"Lang, K.: Fixing two weaknesses of the spectral method. In: Proc. of NIPS (2006)"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: WWW (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"42_CR11","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 call graphs: findings and implications. In: Proc. of 15th ACM CIKM, pp. 435\u2013444 (2006)","DOI":"10.1145\/1183614.1183678"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E\u00a074(036104) (2006)","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Onnela, J.-P., Sarama\u00e4ki, J., Hyv\u00f6ven, J., Szab\u00f3, G., de Menezes, M.A., Kaski, K., Barab\u00e1si, A.-L.: Structure and Tie Strengths in Mobile Communication Networks. New Journal of Physics\u00a09 (2007)","DOI":"10.1073\/pnas.0610245104"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Palla, G., Barabasi, A.-L., Vicsek, T.: Quantifying social group evolution. Nature\u00a0446(664) (2007)","DOI":"10.1038\/nature05670"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Pei, J., Jiang, D., Zhang, A.: On mining cross-graph quasi-cliques. In: Proc. of the eleventh ACM SIGKDD (2005)","DOI":"10.1145\/1081870.1081898"},{"key":"42_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/BFb0055696","volume-title":"Computer Vision - ECCV\u201998","author":"P. Perona","year":"1998","unstructured":"Perona, P., Freeman, W.T.: A factorization approach to grouping. In: Burkhardt, H.-J., Neumann, B. (eds.) ECCV 1998. LNCS, vol.\u00a01406, pp. 655\u2013670. Springer, Heidelberg (1998)"},{"key":"42_CR17","unstructured":"Prakash, B.A., Sridharan, A., Seshadri, M., Machiraju, S., Faloutsos, C.: Patterns and community extraction in large graphs. TR CMU-CS-09-176 (2009)"},{"key":"42_CR18","unstructured":"Resig, J., Dawara, S., Homan, C., Teredesai, A.: Extracting social networks from instant messaging populations. In: Proc. of ACM SIGKDD (2004)"},{"issue":"1","key":"42_CR19","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/cviu.1997.0637","volume":"71","author":"S. Sarkar","year":"1998","unstructured":"Sarkar, S., Boyer, K.L.: Quantitative measures of changed based on feature organization: Eigenvalues and eigenvectors. Computer Vision and Image Understanding\u00a071(1), 110\u2013136 (1998)","journal-title":"Computer Vision and Image Understanding"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Satuluri, V., Parthasarathy, S.: Scalable graph clustering using stochastic flows: applications to community discovery. In: Proc. of ACM SIGKDD (2009)","DOI":"10.1145\/1557019.1557101"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Seshadri, M., Machiraju, S., Sridharan, A., Bolot, J., Faloutsos, C., Leskovec, J.: Mobile call graphs: Beyond power-law and lognormal distributions. In: KDD (2008)","DOI":"10.1145\/1401890.1401963"},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Shi, T., Belkin, M., Yu, B.: Data Spectroscopy: Learning Mixture Models using Eigenspaces of Convolution Operators. In: Proc. of ICML (2008)","DOI":"10.1145\/1390156.1390274"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Strang, G.: Introduction to Linear Algebra. Wellesley-Cambridge Press (2003)","DOI":"10.1007\/978-3-642-55631-9"},{"issue":"4","key":"42_CR24","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U. Luxburg von","year":"2007","unstructured":"von Luxburg, U.: A tutorial on spectral clustering. Statistics and Computing\u00a017(4), 395\u2013416 (2007)","journal-title":"Statistics and Computing"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"White, S., Smyth, P.: A spectral clustering approach to finding communities in graphs. In: Proc. of SDM (2005)","DOI":"10.1137\/1.9781611972757.25"},{"key":"42_CR26","doi-asserted-by":"crossref","unstructured":"Ying, X., Wu, X.: On randomness measures for social networks. In: SDM (2009)","DOI":"10.1137\/1.9781611972795.61"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13672-6_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T00:00:22Z","timestamp":1635379222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13672-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136719","9783642136726"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13672-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}