{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:45:47Z","timestamp":1725673547652},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642290220"},{"type":"electronic","value":"9783642290237"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29023-7_21","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T07:56:06Z","timestamp":1333612566000},"page":"204-215","source":"Crossref","is-referenced-by-count":3,"title":["Collaborative Similarity Measure for Intra Graph Clustering"],"prefix":"10.1007","author":[{"given":"Waqas","family":"Nawaz","sequence":"first","affiliation":[]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Sungyoung","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Cook, D.J., Holder, L.B.: Mining Graph Data. Wiley and Sons (2006)","DOI":"10.1002\/0470073047"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering Large Graphs via the Singular Value Decomposition. Machine Learning\u00a056(1-3) (2004)","DOI":"10.1023\/B:MACH.0000033113.59016.96"},{"key":"21_CR3","unstructured":"Dongen, S.: Graph Clustering by Flow Simulation, Ph.D. thesis, University of Utrecht (2000)"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1080\/15427951.2004.10129093","volume":"1","author":"G.W. Flake","year":"2003","unstructured":"Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph Clustering and Minimum Cut Trees. Journal of Internet Mathematics\u00a01(4), 385\u2013408 (2003)","journal-title":"Journal of Internet Mathematics"},{"key":"21_CR5","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. The European Physics Journal B\u00a038, 321\u2013330 (2004)","journal-title":"The European Physics Journal B"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.jvlc.2005.10.003","volume":"17","author":"X. Huang","year":"2006","unstructured":"Huang, X., Lai, W.: Clustering Graphs for Visualization via Node Similarities. Journal of Visual Languages and Computing\u00a017, 225\u2013253 (2006)","journal-title":"Journal of Visual Languages and Computing"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-20847-8_5","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Anand","year":"2011","unstructured":"Anand, R., Reddy, C.K.: Graph-Based Clustering with Constraints. In: Huang, J.Z., Cao, L., Srivastava, J. (eds.) PAKDD 2011, Part II. LNCS, vol.\u00a06635, pp. 51\u201362. Springer, Heidelberg (2011)"},{"issue":"8","key":"21_CR8","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: Scan: a structural clustering algorithm for networks. In: Proc. 2007 Int. Conf. Knowledge Discovery and Data Mining (KDD 2007), San Jose, CA, pp. 824\u2013833 (August 2007)","DOI":"10.1145\/1281192.1281280"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"26113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E\u00a069, 026113 (2004)","journal-title":"Phys. Rev. E"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: Proc. 2008 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD 2008), Vancouver, Canada, pp. 567\u2013580 (June 2008)","DOI":"10.1145\/1376616.1376675"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Marcopol, K., et al.: Scalable Discovery of Best Clusters on Large Graphs. Proceedings of VLDB Endowment\u00a03(1) (2010)","DOI":"10.14778\/1920841.1920930"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Tiakas, E., et al.: Graph Node Clustering via Transitive Node Similarity. In: 14th Panhellenic Conference on Informatics (2010)","DOI":"10.1109\/PCI.2010.42"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Zhou, Y., et al.: Graph Clustering Based on Structural\/Attribute Similarities. In: Proceedings of VLDB Endowment, France (2009)","DOI":"10.14778\/1687627.1687709"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Larsen, B., Aone, C.: Fast and effective text mining using linear-time document clustering. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 16\u201322 (1999)","DOI":"10.1145\/312129.312186"},{"key":"21_CR16","first-page":"547","volume":"37","author":"P. Jaccard","year":"1901","unstructured":"Jaccard, P.: Etude Comparative de la Distribution Floraledansune Portion des Alpes et des Jura. Soci\u00e8t\u00e8 Vaudoise des Sciences Naturelles\u00a037, 547\u2013579 (1901)","journal-title":"Soci\u00e8t\u00e8 Vaudoise des Sciences Naturelles"},{"key":"21_CR17","volume-title":"Cluster Analysis","author":"B. Everitt","year":"1993","unstructured":"Everitt, B.: Cluster Analysis, 3rd edn. Edward Arnold, London (1993)","edition":"3"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Cheng, H., et al.: Clustering Large Attributed Graphs: A Balance between Structural and Attribute Similarities. ACM Transaction on Knowledge Discovery from Data\u00a05(2) (February 2011)","DOI":"10.1145\/1921632.1921638"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. Fredman","year":"1987","unstructured":"Fredman, M., Tarjan, R.: Fibonacci Heaps and their Uses in Improved Network Optimization Algorithms. Journal of ACM\u00a034, 596\u2013615 (1987)","journal-title":"Journal of ACM"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Witsenburg, T., et al.: Improving the Accuracy of Similarity Measures by Using Link Information. In: International Symposium on Methodologies for Intelligent Systems, 9th edn., Poland (2011)","DOI":"10.1007\/978-3-642-21916-0_54"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregationfor graph summarization. In: Proc. 2008 ACM-SIGMOD Int.Conf. Management of Data (SIGMOD 2008), Vancouver, Canada, pp. 567\u2013580 (June 2008)","DOI":"10.1145\/1376616.1376675"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. Fredman","year":"1987","unstructured":"Fredman, M., Tarjan, R.: Fibonacci Heaps and their Uses in ImprovedNetwork Optimization Algorithms. Journal of the ACM\u00a034, 596\u2013615 (1987)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29023-7_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:18:58Z","timestamp":1620127138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29023-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290220","9783642290237"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29023-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}