{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:55:31Z","timestamp":1761580531566},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T00:00:00Z","timestamp":1188000000000},"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":[[2008,1]]},"DOI":"10.1007\/s10115-007-0096-0","type":"journal-article","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T14:23:39Z","timestamp":1187965419000},"page":"101-139","source":"Crossref","is-referenced-by-count":12,"title":["Cluster ranking with an application to mining mailbox networks"],"prefix":"10.1007","volume":"14","author":[{"given":"Ziv","family":"Bar-Yossef","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ido","family":"Guy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronny","family":"Lempel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yo\u00eblle S.","family":"Maarek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Soroka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,25]]},"reference":[{"key":"96_CR1","doi-asserted-by":"crossref","unstructured":"Amir E, Krauthgamer R, Rao S (2003) Constant factor approximation of vertex-cuts in planar graphs. In: Proceedings of the 35th ACM symposium on theory of computing (STOC), San Diego, pp 90\u201399","DOI":"10.1145\/780542.780557"},{"key":"96_CR2","doi-asserted-by":"crossref","unstructured":"Banerjee A, Krumpelman C, Ghosh J, Basu S, Mooney RJ (2005) Model-based overlapping clustering. In: Proceedings of the 11th ACM SIGKDD international conference on knowledge discovery and data mining, Chicago, pp 532\u2013537","DOI":"10.1145\/1081870.1081932"},{"key":"96_CR3","doi-asserted-by":"crossref","first-page":"803","DOI":"10.2307\/2532201","volume":"49","author":"JD Banfield","year":"1993","unstructured":"Banfield JD and Raftery AE (1993). Model-based gaussian and non-gaussian clustering. Biometrics 49: 803\u2013821","journal-title":"Biometrics"},{"key":"96_CR4","unstructured":"Baumes J, Goldberg MK, Krishnamoorthy MS, Magdon-Ismail M, Preston N (2005) Finding communities by clustering a graph into overlapping subgraphs. In: Proceedings of the IADIS international conference on applied computing, Algarve, pp 97\u2013104"},{"issue":"4","key":"96_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/MC.2005.132","volume":"38","author":"PO Boykin","year":"2005","unstructured":"Boykin PO and Roychowdhury V (2005). Personal email networks: an effective anti-spam tool. IEEE Comput 38(4): 61\u201368","journal-title":"IEEE Comput"},{"key":"96_CR6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"TN Bui","year":"1992","unstructured":"Bui TN and Jones C (1992). Finding good approximate vertex and edge partitions is NP-hard. Inf Proces Lett 42: 153\u2013159","journal-title":"Inf Proces Lett"},{"key":"96_CR7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1080\/01969727308546046","volume":"3","author":"JC Dunn","year":"1973","unstructured":"Dunn JC (1973). A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters. J Cybern 3: 32\u201357","journal-title":"J Cybern"},{"key":"96_CR8","unstructured":"Farnham S, Portnoy W, Turski A, Cheng L, Vronay D (2003) Personal map: automatically modeling the user\u2019s online social network. In: Proceedings of the international conference on human\u2013computer interaction (INTERACT), Zurich, pp 567\u2013574"},{"key":"96_CR9","unstructured":"Fasulo D (1999) An analysis of recent work on clustering algorithms. Technical Report 01-03-02, Department of Computer Science and Engineering, University of Washington, Seattle"},{"key":"96_CR10","doi-asserted-by":"crossref","unstructured":"Feige U, Hajiaghayi MT, Lee JR (2005) Improved approximation algorithms for minimum-weight vertex separators. In: Proceedings of the 37th ACM symposium on theory of computing (STOC), Baltimore, pp 563\u2013572","DOI":"10.1145\/1060590.1060674"},{"issue":"5","key":"96_CR11","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/MIC.2005.114","volume":"9","author":"D Fisher","year":"2005","unstructured":"Fisher D (2005). Using egocentric networks to understand communication. IEEE Internet Comput 9(5): 20\u201328","journal-title":"IEEE Internet Comput"},{"key":"96_CR12","doi-asserted-by":"crossref","unstructured":"Fisher D, Dourish P (2004) Social and temporal structures in everyday collaboration. In: Proceedings of the 2004 conference on human factors in computing systems (CHI), Vienna, pp 551\u2013558","DOI":"10.1145\/985692.985762"},{"key":"96_CR13","doi-asserted-by":"crossref","unstructured":"Flake GW, Lawrence S, Giles CL (2000) Efficient identification of Web communities. In: Proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining, Boston pp 150\u2013160","DOI":"10.1145\/347090.347121"},{"issue":"3","key":"96_CR14","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/2.989932","volume":"35","author":"GW Flake","year":"2002","unstructured":"Flake GW, Lawrence S, Giles CL and Coetzee F (2002). Self-organization and identification of web communities. IEEE Comput 35(3): 66\u201371","journal-title":"IEEE Comput"},{"issue":"8","key":"96_CR15","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1093\/comjnl\/41.8.578","volume":"41","author":"C Fraley","year":"1998","unstructured":"Fraley C and Raftery AE (1998). How many clusters? Which clustering method? Answers via model-based cluster analysis. Comput J 41(8): 578\u2013588","journal-title":"Comput J"},{"key":"96_CR16","unstructured":"Fraley C, Raftery AE (2000) Model-based clustering, discriminant analysis, density estimation. Technical Report 380, University of Washington, Department of Statistics"},{"key":"96_CR17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977). A set of measures of centrality based on betweenness. Sociometry 40: 35\u201341","journal-title":"Sociometry"},{"key":"96_CR18","volume-title":"The development of social network analysis: a study in the sociology of science","author":"LC Freeman","year":"2004","unstructured":"Freeman LC (2004). The development of social network analysis: a study in the sociology of science. Empirical Press, Vancouver"},{"issue":"12","key":"96_CR19","first-page":"7821","volume":"99","author":"M Girvans","year":"2002","unstructured":"Girvans M and Newman MEJ (2002). Community structure in social and biological networks. In: Proceedings of the National Academy of Sciences of the United States of America (PNAS) 99(12): 7821\u20137826","journal-title":"In: Proceedings of the National Academy of Sciences of the United States of America (PNAS)"},{"key":"96_CR20","volume-title":"Fuzzy cluster analysis: Methods for classification, data analysis and image Recognition","author":"F H\u00f6ppner","year":"1999","unstructured":"H\u00f6ppner F, Klawonn F, Kruse R and Runkler T (1999). Fuzzy cluster analysis: Methods for classification, data analysis and image Recognition. Wiley, New York"},{"key":"96_CR21","doi-asserted-by":"crossref","unstructured":"Ino H, Kudo M, Nakamura A (2005) Partitioning of Web graphs by community topology. In: Proceedings of the 14th international conference on World Wide Web (WWW), Chiba, pp 661\u2013669","DOI":"10.1145\/1060745.1060841"},{"key":"96_CR22","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1998","unstructured":"Jain AK and Dubes RC (1998). Algorithms for clustering data. Prentice-Hall, New Jersey"},{"key":"96_CR23","doi-asserted-by":"crossref","unstructured":"Jain AK, Topchy AP, Law MHC, Buhmann JM (2004) Landscape of clustering algorithms. In: Proceedings of the 17th international conference on pattern recognition (ICPR), Cambridge, Vol. 1, pp 260\u2013263","DOI":"10.1109\/ICPR.2004.1334073"},{"issue":"3","key":"96_CR24","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R Kannan","year":"2004","unstructured":"Kannan R, Vempala S and Vetta A (2004). On clusterings: good, bad and spectral. J ACM 51(3): 497\u2013515","journal-title":"J ACM"},{"key":"96_CR25","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman L and Rousseeuw PJ (1990). Finding groups in data: an introduction to cluster analysis. John Wiley, New York"},{"key":"96_CR26","unstructured":"Kleinberg JM (2002) An impossibility theorem for clustering. In: Proceedings of the 15th annual conference on neural information processing systems (NIPS), Vancouver, pp 446\u2013453"},{"key":"96_CR27","doi-asserted-by":"crossref","unstructured":"Klimt B, Yang Y (2004) The enron corpus: a new dataset for email classification research. In: Proceedings of the 15th European conference on machine learning (ECML), Pisa, pp 217\u2013226","DOI":"10.1007\/978-3-540-30115-8_22"},{"issue":"3","key":"96_CR28","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10115-006-0005-y","volume":"10","author":"M Kobayashi","year":"2006","unstructured":"Kobayashi M and Aono M (2006). Exploring overlapping clusters using dynamic re-scaling and sampling. Knowl Inf Systems 10(3): 295\u2013313","journal-title":"Knowl Inf Systems"},{"issue":"6","key":"96_CR29","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T Leighton","year":"1999","unstructured":"Leighton T and Rao S (1999). Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J ACM 46(6): 787\u2013832","journal-title":"J ACM"},{"key":"96_CR30","unstructured":"Macqueen JB (1967) Some methods of classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley symposium on mathemtical statistics and probability, Berkeley, pp 281\u2013297"},{"key":"96_CR31","doi-asserted-by":"crossref","unstructured":"Mar JC, McLachlan GJ (2003) Model-based clustering in gene expression microarrays: an application to breast cancer data. In: Proceedings of the first asia-pacific bioinformatics conference (APBC), Adelaide, Vol 19, pp 139\u2013144","DOI":"10.1142\/S0218194003001482"},{"key":"96_CR32","unstructured":"McCallum A, Corrada-Emmanuel A, Wang X (2005) Topic and role discovery in social networks. In: Proceedings of the 19th international joint conference on artificial intelligence (IJCAI), Edinburgh, pp 786\u2013791"},{"key":"96_CR33","doi-asserted-by":"crossref","unstructured":"Newman MEJ (2001) Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality. Phys Rev E 64(016132)","DOI":"10.1103\/PhysRevE.64.016132"},{"key":"96_CR34","doi-asserted-by":"crossref","unstructured":"Newman MEJ (2004) Analysis of weighted networks. Phys Rev E 70(056131)","DOI":"10.1103\/PhysRevE.70.056131"},{"key":"96_CR35","doi-asserted-by":"crossref","unstructured":"Newman MEJ, Girvans M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(026113)","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"96_CR36","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I and Vicsek T (2005). Uncovering the overlapping community structure of complex networks in nature and society. Nature 435: 814\u2013818","journal-title":"Nature"},{"key":"96_CR37","doi-asserted-by":"crossref","unstructured":"Pereira FCN, Tishby N, Lee L (1993) Distributional clustering of english words. In: Proceedings of the 31st annual meeting of the association for computational linguistics (ACL), Ohio, pp 183\u2013190","DOI":"10.3115\/981574.981598"},{"key":"96_CR38","volume-title":"Social network analysis: a handbook","author":"J Scott","year":"1991","unstructured":"Scott J (1991). Social network analysis: a handbook. Sage, London"},{"key":"96_CR39","unstructured":"Segal E, Battle A, Koller D (2003) Decomposing gene expression into cellular processes. In: Proceedings of the 8th pacific symposium on biocomputing (PSB), Lihue, pp 89\u2013100"},{"issue":"8","key":"96_CR40","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J and Malik J (2000). Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8): 888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"96_CR41","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1017\/S0963548300000390","volume":"1","author":"AJ Sinclair","year":"1992","unstructured":"Sinclair AJ (1992). Improved bounds for mixing rates of Markov chains and multicommodity flow. Combin Probab Comput 1: 351\u2013370","journal-title":"Combin Probab Comput"},{"key":"96_CR42","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"AJ Sinclair","year":"1989","unstructured":"Sinclair AJ and Jerrum MR (1989). Approximate counting, uniform generation and rapidly mixing Markov chains. Inf Comput 82: 93\u2013133","journal-title":"Inf Comput"},{"key":"96_CR43","unstructured":"Slonim N (2002) The information bottleneck: theory and applications. PhD thesis, The Hebrew University of Jerusalem"},{"issue":"12","key":"96_CR44","first-page":"18297","volume":"102","author":"N Slonim","year":"2005","unstructured":"Slonim N, Atwal GS, Tkacik G and Bialek W (2005). Information based clustering. In: Proc Natl Acad Sci USA 102(12): 18297\u201318302","journal-title":"In: Proc Natl Acad Sci USA"},{"key":"96_CR45","unstructured":"Tishby N, Pereira F, Bialek W (1999) The information bottleneck method. In: Proceedings of the 37th annual allerton conference on communication, control and computing, University of Illinois, Urbana-Champaign, pp 368\u2013377"},{"key":"96_CR46","doi-asserted-by":"crossref","unstructured":"Tyler J, Wilkinson D, Huberman BA (2003) Email as spectroscopy: automated discovery of community structure within organizations. In: Proceedings of the 1st international conference on communities and technologies, Amsterdam, pp 81\u201396","DOI":"10.1007\/978-94-017-0115-0_5"},{"key":"96_CR47","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/0378-8733(93)90015-D","volume":"15","author":"B Wellman","year":"1993","unstructured":"Wellman B (1993). An egocentric network tale. Soc Netw 15: 423\u2013436","journal-title":"Soc Netw"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0096-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-007-0096-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0096-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:16Z","timestamp":1559124616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-007-0096-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,25]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["96"],"URL":"https:\/\/doi.org\/10.1007\/s10115-007-0096-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,25]]}}}