{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:09:35Z","timestamp":1761894575839},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745525"},{"type":"electronic","value":"9783540745532"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74553-2_36","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T23:07:48Z","timestamp":1187824068000},"page":"385-396","source":"Crossref","is-referenced-by-count":29,"title":["A Novel Similarity-Based Modularity Function for Graph Partitioning"],"prefix":"10.1007","author":[{"given":"Zhidan","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nurcan","family":"Yuruk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A. J.","family":"Schweiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Ding, C.H.Q., He, X., et al.: A min-max cut algorithm for graph partitioning and data clustering. In: Proc. of ICDM 2001 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. On Pattern Analysis and Machine Intelligence\u00a022(8) (2000)","DOI":"10.1109\/34.868688"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L. Hegan","year":"1992","unstructured":"Hegan, L., Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE Trans. On Computed Aided Design\u00a011, 1074\u20131085 (1992)","journal-title":"IEEE Trans. On Computed Aided Design"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Newman, M.: Fast algorithm for detecting community structure in networks. Phys. Rev.\u00a0E 69, art. No. 066133 (2004)","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M., Moore, C.: Finding community in very large networks (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"36_CR6","first-page":"15132","volume":"64","author":"M. Newman","year":"2001","unstructured":"Newman, M.: Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality. Phys. Rev. E\u00a064, 15132 (2001)","journal-title":"Phys. Rev. E"},{"key":"36_CR7","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA\u00a099, 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","volume":"38","author":"M. Newman","year":"2004","unstructured":"Newman, M.: Detecting community structure in networks. Eur. Phys. J. B\u00a038, 321\u2013330 (2004)","journal-title":"Eur. Phys. J. B"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L. Freeman","year":"1977","unstructured":"Freeman, L.: A set of measures of centrality based upon betweeness. Sociometry\u00a040, 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Guimera, R., Amaral, L.A.N.: Functional cartography of complex metabolic networks. Letters to nature (February 2005)","DOI":"10.1038\/nature03288"},{"key":"36_CR11","unstructured":"Feng, Z., Xu, X., Schweiger, T.: Genetic Clustering Algorithm for Graph Partitioning, technique report (2006)"},{"key":"36_CR12","doi-asserted-by":"crossref","first-page":"26120","DOI":"10.1103\/PhysRevE.73.026120","volume":"73","author":"E.A. Leicht","year":"2006","unstructured":"Leicht, E.A., Holme, P., Newman, M.E.J.: Vertex similarity in networks. Phys. Rev. E\u00a073, 26120 (2006)","journal-title":"Phys. Rev. E"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Dias, C.R., Ochi, L.S.: Efficient Evolutionary Algorithms for the Clustering Problem in Directed Graphs. In: CEC 2003. The Congress on Evolutionary Computation (2003)","DOI":"10.1109\/CEC.2003.1299774"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Wang, J., Xu, L., Zhang, B.: A Genetic Annealing Hybrid Algorithm based Clustering Strategy in Mobile Ad hoc Network. Proc. on Communications, Circuits and Systems (2005)","DOI":"10.1109\/ICCCAS.2005.1493417"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Sheng, W., Swift, S., Zhang, L., Liu, X.: A Weighted Sum Validity Function for Clustering With a Hybrid Niching Genetic Algorithm. IEEE Trans. On Sys., Man and Cybernetics, part B:Cybernetics\u00a035(6) (December 2005)","DOI":"10.1109\/TSMCB.2005.850173"},{"key":"36_CR16","unstructured":"Hernadez, G., Bobadilla, L., Sanchez, Q.: A Genetic Word Clustering Algorithm. In: CEC 2005. The Congress on Evolutionary Computation (2005)"},{"key":"36_CR17","unstructured":"Zhang, J., Chung, H., Hu, B.: Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms Based on Clustering Technique. In: CEC 2004. The Congress on Evolutionary Computation (2004)"},{"key":"36_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)"},{"key":"36_CR19","unstructured":"http:\/\/www.informatik.uni-trier.de\/~ley\/db\/"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74553-2_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:24:11Z","timestamp":1619504651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74553-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745525","9783540745532"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74553-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}