{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:13:31Z","timestamp":1770815611197,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,1,20]],"date-time":"2015-01-20T00:00:00Z","timestamp":1421712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10619-014-7170-x","type":"journal-article","created":{"date-parts":[[2015,1,19]],"date-time":"2015-01-19T06:38:52Z","timestamp":1421649532000},"page":"583-603","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Intra graph clustering using collaborative similarity measure"],"prefix":"10.1007","volume":"33","author":[{"given":"Waqas","family":"Nawaz","sequence":"first","affiliation":[]},{"given":"Kifayat-Ullah","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Sungyoung","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,20]]},"reference":[{"key":"7170_CR1","doi-asserted-by":"crossref","unstructured":"Ahn, Y.Y., Han, S., Kwak, H., Moon, S., Jeong, H.: Analysis of topological characteristics of huge online social networking services. In: Proceedings of the 16th International Conference on World Wide Web, WWW \u201907, pp. 835\u2013844. ACM, New York, NY, USA (2007). doi: 10.1145\/1242572.1242685","DOI":"10.1145\/1242572.1242685"},{"key":"7170_CR2","doi-asserted-by":"crossref","unstructured":"Anand, R., Reddy, C.K.: Graph-based clustering with constraints. In: Proceedings of the 15th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining\u2014Volume Part II, PAKDD\u201911, pp. 51\u201362. Springer, Berlin, Heidelberg (2011). http:\/\/dl.acm.org\/citation.cfm?id=2022850.2022855","DOI":"10.1007\/978-3-642-20847-8_5"},{"key":"7170_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, R., Lang, K.J.: Communities from seed sets. In: Proceedings of the 15th International Conference on World Wide Web, WWW \u201906, pp. 223\u2013232. ACM, New York, NY, USA (2006). doi: 10.1145\/1135777.1135814","DOI":"10.1145\/1135777.1135814"},{"issue":"2","key":"7170_CR4","doi-asserted-by":"crossref","first-page":"12:1","DOI":"10.1145\/1921632.1921638","volume":"5","author":"H Cheng","year":"2011","unstructured":"Cheng, H., Zhou, Y., Yu, J.X.: Clustering large attributed graphs: a balance between structural and attribute similarities. ACM Trans. Knowl. Discov. Data 5(2), 12:1\u201312:33 (2011). doi: 10.1145\/1921632.1921638","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"7170_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0470073047","volume-title":"Mining Graph Data","author":"DJ Cook","year":"2006","unstructured":"Cook, D.J., Holder, L.B.: Mining Graph Data. Wiley, New York (2006)"},{"issue":"1\u20133","key":"7170_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","volume":"56","author":"P Drineas","year":"2004","unstructured":"Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering large graphs via the singular value decomposition. Mach. Learn. 56(1\u20133), 9\u201333 (2004). doi: 10.1023\/B:MACH.0000033113.59016.96","journal-title":"Mach. Learn."},{"key":"7170_CR7","unstructured":"Everitt, B.S., Landau, S., Leese, M.: Cluster Analysis, 4th edn. Wiley, New York (2009)"},{"key":"7170_CR8","unstructured":"Fjllstrm, P.O.: Algorithms for Graph Partitioning: A Survey. Linkping Electronic Articles in Computer and Information Science 3 (1998). http:\/\/www.ep.liu.se\/ea\/cis\/1998\/010\/cis98010.pdf"},{"key":"7170_CR9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1080\/15427951.2004.10129093","volume":"1","author":"GW Flake","year":"2004","unstructured":"Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Internet Math. 1, 385\u2013408 (2004)","journal-title":"Internet Math."},{"issue":"3","key":"7170_CR10","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987). doi: 10.1145\/28869.28874","journal-title":"J. ACM"},{"key":"7170_CR11","doi-asserted-by":"crossref","unstructured":"Hofmann, T.: Probabilistic latent semantic indexing. In: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR \u201999, pp. 50\u201357. ACM, New York, NY, USA (1999). doi: 10.1145\/312624.312649","DOI":"10.1145\/312624.312649"},{"issue":"3","key":"7170_CR12","doi-asserted-by":"crossref","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. J. Vis. Lang. Comput. 17(3), 225\u2013253 (2006). doi: 10.1016\/j.jvlc.2005.10.003","journal-title":"J. Vis. Lang. Comput."},{"key":"7170_CR13","doi-asserted-by":"crossref","unstructured":"Ino, H., Kudo, M., Nakamura, A.: Partitioning of web graphs by community topology. In: Proceedings of the 14th International Conference on World Wide Web, WWW \u201905, pp. 661\u2013669. ACM, New York, NY, USA (2005). doi: 10.1145\/1060745.1060841","DOI":"10.1145\/1060745.1060841"},{"key":"7170_CR14","first-page":"547","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard, P.: \u00c9tude comparative de la distribution florale dans une portion des alpes et des jura. Bulletin del la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles 37, 547\u2013579 (1901)","journal-title":"Bulletin del la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles"},{"key":"7170_CR15","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: Proceedings of the 17th International Conference on World Wide Web, WWW \u201908, pp. 695\u2013704. ACM, New York, NY, USA (2008). doi: 10.1145\/1367497.1367591","DOI":"10.1145\/1367497.1367591"},{"key":"7170_CR16","unstructured":"Macropol, K., Singh, A.: Scalable discovery of best clusters on large graphs. Proc. VLDB Endow. 3(1\u20132), 693\u2013702 (2010). http:\/\/dl.acm.org\/citation.cfm?id=1920841.1920930"},{"key":"7170_CR17","doi-asserted-by":"crossref","unstructured":"Nawaz, W., Lee, Y.K., Lee, S.: Collaborative similarity measure for intra graph clustering. In: DASFAA Workshops, pp. 204\u2013215 (2012)","DOI":"10.1007\/978-3-642-29023-7_21"},{"key":"7170_CR18","doi-asserted-by":"crossref","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 Condens. Matter Complex Syst. 38, 321\u2013330 (2004). doi: 10.1140\/epjb\/e2004-00124-y","journal-title":"Eur. Phys. J. B Condens. Matter Complex Syst."},{"key":"7170_CR19","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004). doi: 10.1103\/PhysRevE.69.026113","journal-title":"Phys. Rev. E"},{"issue":"3","key":"7170_CR20","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","volume":"24","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in social media. Data Min. Knowl. Discov. 24(3), 515\u2013554 (2012). doi: 10.1007\/s10618-011-0224-z","journal-title":"Data Min. Knowl. Discov."},{"key":"7170_CR21","doi-asserted-by":"crossref","first-page":"346","DOI":"10.5626\/JCSE.2011.5.4.346","volume":"5","author":"G-P Rob","year":"2011","unstructured":"Rob, G.-P., Hwang, S.: Online clustering algorithms for semantic-rich network trajectories. J. Comput. Sci. Eng. 5, 346\u2013353 (2011). doi: 10.5626\/JCSE.2011.5.4.346","journal-title":"J. Comput. Sci. Eng."},{"key":"7170_CR22","first-page":"888","volume":"22","author":"J Shi","year":"1997","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22, 888\u2013905 (1997)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"7170_CR23","doi-asserted-by":"crossref","unstructured":"Tiakas, E., Papadopoulos, A.N., Manolopoulos, Y.: Graph node clustering via transitive node similarity. In: Panhellenic Conference on Informatics, pp. 72\u201377 (2010). doi: 10.1109\/PCI.2010.42","DOI":"10.1109\/PCI.2010.42"},{"key":"7170_CR24","doi-asserted-by":"crossref","unstructured":"Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201908, pp. 567\u2013580. ACM, New York, NY, USA (2008). doi: 10.1145\/1376616.1376675","DOI":"10.1145\/1376616.1376675"},{"key":"7170_CR25","unstructured":"van Dongen, S.M.: Graph Clustering by Flow Simulation. Ph.D. thesis, University of Utrecht, The Netherlands (2000)"},{"key":"7170_CR26","doi-asserted-by":"crossref","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: Scan: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201907, pp. 824\u2013833. ACM, New York, NY, USA (2007). doi: 10.1145\/1281192.1281280","DOI":"10.1145\/1281192.1281280"},{"key":"7170_CR27","doi-asserted-by":"crossref","unstructured":"Zhai, C., Velivelli, A., Yu, B.: A cross-collection mixture model for comparative text mining. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201904, pp. 743\u2013748. ACM, New York, NY, USA (2004). doi: 10.1145\/1014052.1014150","DOI":"10.1145\/1014052.1014150"},{"key":"7170_CR28","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. Proc. VLDB Endow. 2(1), 718\u2013729 (2009). http:\/\/dl.acm.org\/citation.cfm?id=1687627.1687709","DOI":"10.14778\/1687627.1687709"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-014-7170-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10619-014-7170-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-014-7170-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:29:51Z","timestamp":1559230191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-014-7170-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,20]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["7170"],"URL":"https:\/\/doi.org\/10.1007\/s10619-014-7170-x","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,20]]}}}