{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T23:03:04Z","timestamp":1744153384711},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,9,25]],"date-time":"2009-09-25T00:00:00Z","timestamp":1253836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s10115-009-0251-x","type":"journal-article","created":{"date-parts":[[2009,9,24]],"date-time":"2009-09-24T09:10:29Z","timestamp":1253783429000},"page":"345-369","source":"Crossref","is-referenced-by-count":9,"title":["Partitioning large networks without breaking communities"],"prefix":"10.1007","volume":"25","author":[{"given":"Anand","family":"Narasimhamurthy","sequence":"first","affiliation":[]},{"given":"Derek","family":"Greene","sequence":"additional","affiliation":[]},{"given":"Neil","family":"Hurley","sequence":"additional","affiliation":[]},{"given":"P\u00e1draig","family":"Cunningham","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,25]]},"reference":[{"key":"251_CR1","unstructured":"Paliouras G, Papatheodorou C, Karkaletsis V, Spyropoulos CD (2000) Clustering the users of large web sites into communities. In: Proceedings of seventh international conference on machine learning (ICML\u201900), pp 719\u2013726"},{"key":"251_CR2","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/846183.846188","volume":"1","author":"J Srivastava","year":"2000","unstructured":"Srivastava J, Cooley R, Deshpande M, Tan P (2000) Web usage mining: discovery and applications of usage patterns from Web data. ACM SIGKDD Explor Newslett 1: 12\u201323","journal-title":"ACM SIGKDD Explor Newslett"},{"key":"251_CR3","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/S0306-4573(01)00046-2","volume":"38","author":"Y He","year":"2002","unstructured":"He Y, Cheung Hui S (2002) Mining a Web Citation Database for author co-citation analysis. Inf Process Manag 38: 491\u2013508","journal-title":"Inf Process Manag"},{"key":"251_CR4","first-page":"56","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69: 56\u201368","journal-title":"Phys Rev E"},{"key":"251_CR5","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Derenyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435: 814\u2013818","journal-title":"Nature"},{"key":"251_CR6","doi-asserted-by":"crossref","unstructured":"Gregory S (2007) An algorithm to find overlapping community structure in networks. In: Proceedings of 11th European conference on principles and practice of knowledge discovery in databases (PKDD\u201907), pp 91\u2013102","DOI":"10.1007\/978-3-540-74976-9_12"},{"key":"251_CR7","doi-asserted-by":"crossref","unstructured":"Abello J, Pardalos PM, Resende MGC (1999) On maximum clique problems in very large graphs. In: External memory algorithms. DIMACS series in discrete mathematics and theoretical computer science, pp 119\u2013130","DOI":"10.1090\/dimacs\/050\/06"},{"key":"251_CR8","doi-asserted-by":"crossref","first-page":"1944","DOI":"10.1109\/TPAMI.2007.1115","volume":"29","author":"I Dhillon","year":"2007","unstructured":"Dhillon I, Guan Y, Kulis B (2007) Weighted graph cuts without eigenvectors a multilevel approach. IEEE Trans Pattern Anal Mach Intell 29: 1944\u20131957","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"251_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume":"43","author":"R Karp","year":"1972","unstructured":"Karp R (1972) Reducibility among combinatorial problems. Complex Comput Comput 43: 85\u2013103","journal-title":"Complex Comput Comput"},{"key":"251_CR10","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph. Commun ACM 16: 575\u2013577","journal-title":"Commun ACM"},{"key":"251_CR11","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas E, Yu CS (1986) Finding a maximum clique in an arbitrary graph. SIAM J Comput 15: 1054\u20131068","journal-title":"SIAM J Comput"},{"key":"251_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0167-6377(97)00054-0","volume":"21","author":"DR Wood","year":"1997","unstructured":"Wood DR (1997) An algorithm for finding a maximum clique in a graph. Oper Res Lett 21: 211\u2013217","journal-title":"Oper Res Lett"},{"key":"251_CR13","doi-asserted-by":"crossref","unstructured":"Alon N, Krivelevich M, Sudakov B (1998) Finding a large hidden clique in a random graph. In: 9th symposium on discrete algorithms (SODA), pp 91\u2013102","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"251_CR14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd P (2002) A fast algorithm for the maximum clique problem. Discrete Appl Math 120: 197\u2013207","journal-title":"Discrete Appl Math"},{"key":"251_CR15","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L Freeman","year":"1979","unstructured":"Freeman L (1979) Centrality in social networks: conceptual clarification. Soc Netw 1: 215\u2013239","journal-title":"Soc Netw"},{"key":"251_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.2307\/202051","volume":"1","author":"M Granovetter","year":"1983","unstructured":"Granovetter M (1983) The strength of weak ties: a network theory revisited. Sociol Theory 1: 201\u2013233","journal-title":"Sociol Theory"},{"key":"251_CR17","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman M (2002) Community structure in social and biological networks. PNAS 99: 7821\u20137826","journal-title":"PNAS"},{"key":"251_CR18","unstructured":"Palla G, Dernyi I, Farkas I, Vicsek T (2005) Supplementary information: uncovering the overlapping community structure of complex networks in nature and society. Nature 1\u201312"},{"key":"251_CR19","unstructured":"Shi J, Malik J (1997) Normalized cuts and image segmentation. In: Proceedings of IEEE conference on computer vision and pattern recognition (CVPR \u201997), pp 731\u2013737"},{"key":"251_CR20","unstructured":"Chung FRK (1994) Spectral graph theory. In: CBMS conference on recent advances in spectral graph theory. Regional conference series in mathematics, vol 92, California State University, Fresno"},{"key":"251_CR21","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen A, Simon HD, Liou KP (1990) Partitioning sparse matrices with eigenvectors of graphs. SIAM J Math Anal Appl 11: 430\u2013452","journal-title":"SIAM J Math Anal Appl"},{"key":"251_CR22","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/43.310898","volume":"13","author":"P Chan","year":"1994","unstructured":"Chan P, Schlag M, Zien J (1994) Spectral k-way ratio cut partitioning. IEEE Trans CAD Integr Circuits Syst 13: 1088\u20131096","journal-title":"IEEE Trans CAD Integr Circuits Syst"},{"key":"251_CR23","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1999","unstructured":"Karypis G, Kumar V (1999) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20: 359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"251_CR24","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49: 291\u2013307","journal-title":"Bell Syst Tech J"},{"key":"251_CR25","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1009953814988","volume":"3","author":"A McCallum","year":"2000","unstructured":"McCallum A, Nigam K, Rennie J, Seymore K (2000) Automating the construction of internet portals with machine learning. Inf Retr J 3: 127\u2013163","journal-title":"Inf Retr J"},{"key":"251_CR26","first-page":"343","volume":"38","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s P, R\u00e9nyi A (1961) On the evolution of random graphs. Bull Inst Int Stat 38: 343\u2013347","journal-title":"Bull Inst Int Stat"},{"key":"251_CR27","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286: 509\u2013512","journal-title":"Science"},{"key":"251_CR28","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"S Hakimi","year":"1962","unstructured":"Hakimi S (1962) On the realizability of a set of integers as degrees of the vertices of a graph. SIAM J Appl Math 10: 496\u2013506","journal-title":"SIAM J Appl Math"},{"key":"251_CR29","first-page":"1025","volume":"19","author":"H Narayanan","year":"2007","unstructured":"Narayanan H, Belkin M, Niyogi P (2007) On the relation between low density separation, spectral clustering and graph cuts. Adv Neural Inf Process Syst 19: 1025","journal-title":"Adv Neural Inf Process Syst"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0251-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-009-0251-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0251-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:10:20Z","timestamp":1559110220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-009-0251-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,25]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["251"],"URL":"https:\/\/doi.org\/10.1007\/s10115-009-0251-x","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,25]]}}}