{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:33:40Z","timestamp":1761978820971,"version":"build-2065373602"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,11,22]],"date-time":"2013-11-22T00:00:00Z","timestamp":1385078400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s11280-013-0261-1","type":"journal-article","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T07:40:38Z","timestamp":1385019638000},"page":"899-919","source":"Crossref","is-referenced-by-count":14,"title":["Like-minded communities: bringing the familiarity and similarity together"],"prefix":"10.1007","volume":"17","author":[{"given":"Natwar","family":"Modani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seema","family":"Nagar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saswata","family":"Shannigrahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ritesh","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuntal","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saurabh","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit A.","family":"Nanavati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,22]]},"reference":[{"key":"261_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487\u2013499 (1994)"},{"key":"261_CR2","doi-asserted-by":"crossref","unstructured":"Ahn, S., Shi, C.: Exploring movie recommendation system using cultural metadata. In: Proc. of the 2008 Intl. Conf. on Cyberworlds, pp. 431\u2013438 (2008)","DOI":"10.1109\/CW.2008.13"},{"key":"261_CR3","doi-asserted-by":"crossref","unstructured":"Amatriain, X., Pujol, J.M., Tintarev, N., Oliver, N.: Rate it again: increasing recommendation accuracy by user re-rating. In: Proc. of the third ACM Conf. on Recommender Systems, pp. 173\u2013180 (2009)","DOI":"10.1145\/1639714.1639744"},{"issue":"3","key":"261_CR4","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/s10550-006-0080-3","volume":"24","author":"P Bonhard","year":"2006","unstructured":"Bonhard, P., Sasse, M.: Knowing me, knowing you using profiles and social networking to improve recommender systems. BT Technol. J. 24(3), 84\u201398 (2006)","journal-title":"BT Technol. J."},{"key":"261_CR5","unstructured":"Breese, J.S., Heckerman, D., Kadie, C.M.: Empirical analysis of predictive algorithms for collaborative filtering. In: Uncertainty in Artificial Intelligence, pp. 43\u201352 (1998)"},{"key":"261_CR6","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1109\/TKDE.2010.271","volume":"24","author":"J Chen","year":"2012","unstructured":"Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. IEEE Trans. Knowl. Data Eng. 24, 1216\u20131230 (2012). doi: 10.1109\/TKDE.2010.271","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"261_CR7","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s10618-010-0186-6","volume":"21","author":"W Chen","year":"2010","unstructured":"Chen, W., Liu, Z., Sun, X., Wang, Y.: A game-theoretic framework to identify overlapping communities in social networks. Data Min. Knowl. Discov. 21(2), 224\u2013240 (2010)","journal-title":"Data Min. Knowl. Discov."},{"issue":"066111","key":"261_CR8","first-page":"1","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(066111), 1\u20136 (2004)","journal-title":"Phys. Rev. E"},{"key":"261_CR9","first-page":"430","volume":"21","author":"D Cohn","year":"2001","unstructured":"Cohn, D., Hofman, T.: The missing link\u2014a probabilistic model of document content and hypertext connectivity. Adv. Neural Inf. Process. Syst. 21, 430\u2013436 (2001)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"261_CR10","doi-asserted-by":"crossref","unstructured":"Cruz, J.D., Bothorel, C., Poulet, F.: Entropy based community detection in augmented social networks. In: International Conference on Computational Aspects of Social Networks (2011). doi: 10.1109\/CASON.2011.6085937","DOI":"10.1109\/CASON.2011.6085937"},{"key":"261_CR11","doi-asserted-by":"crossref","unstructured":"Dasgupta, K., Singh, R. Viswanathan, B., Chakraborty, D., Mukherjea, S., Nanavati, A.A., Joshi, A.: Social ties and their relevance to churn in mobile telecom networks. In: EDBT, pp. 668\u2013677 (2008)","DOI":"10.1145\/1352431.1352512"},{"key":"261_CR12","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: WWW, pp. 461\u2013470 (2007)","DOI":"10.1145\/1242572.1242635"},{"key":"261_CR13","doi-asserted-by":"crossref","unstructured":"Falkowski, T., Barth, A., Spiliopoulou, M.: DENGRAPH: A density-based community detection algorithm. In: Web Intelligence, pp. 112\u2013115 (2007). doi: 10.1109\/WI.2007.43","DOI":"10.1109\/WI.2007.43"},{"issue":"3\u20135","key":"261_CR14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010). doi: 10.1016\/j.physrep.2009.11.002 . URL: http:\/\/www.sciencedirect.com\/science\/article\/B6TVP-4XPYXF1-1\/2\/99061fac6435db4343b2374d26e64ac1","journal-title":"Phys. Rep."},{"key":"261_CR15","doi-asserted-by":"crossref","unstructured":"Gibson, D., Kleinberg, J., Raghavan, P.: Inferring web communities from link topology. In: HYPERTEXT, pp. 225\u2013234 (1998)","DOI":"10.1145\/276627.276652"},{"issue":"7821","key":"261_CR16","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99(7821), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"261_CR17","doi-asserted-by":"crossref","unstructured":"Golbeck, J., Hendler, J.: Filmtrust: movie recommendations using trust in web-based social networks. In: CCNC, pp. 282\u2013286 (2006)","DOI":"10.1109\/CCNC.2006.1593032"},{"key":"261_CR18","doi-asserted-by":"crossref","unstructured":"Guy, I., Werdling, N., Carmel, D., Ronen, I., Uziel, E., Yogev, S., Ofek-Koifman, S.: Personalized recommendation of social software items based on social relations. In: RecSys, pp. 53\u201360 (2009)","DOI":"10.1145\/1639714.1639725"},{"key":"261_CR19","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation. Data Min. Knowl. Disc. 8, 53\u201387 (2004)","journal-title":"Data Min. Knowl. Disc."},{"key":"261_CR20","volume-title":"Introduction to Social Network Methods","author":"RA Hanneman","year":"2005","unstructured":"Hanneman, R.A., Riddle, M.: Introduction to Social Network Methods. University of California, Riverside, CA (2005)"},{"key":"261_CR21","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/312624.312682","volume-title":"Proc. of the SIGIR","author":"JL Herlocker","year":"1999","unstructured":"Herlocker, J.L., Konstan, J.A., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: Proc. of the SIGIR, pp. 230\u2013237. ACM, New York, NY (1999)"},{"key":"261_CR22","doi-asserted-by":"crossref","unstructured":"Jaho, E., Karaliopoulos, M., Stavrakakis, I.: Iscode: a framework for interest similarity-based community detection in social networks. In: INFOCOM WORKSHOPS, pp. 912\u2013917. IEEE (2011)","DOI":"10.1109\/INFCOMW.2011.5928942"},{"key":"261_CR23","doi-asserted-by":"crossref","unstructured":"Kang, Y., Choi, S.: Common neighborhood sub-graph density as a similarity measure for community detection. In: ICONIP (1), pp. 175\u2013184 (2009)","DOI":"10.1007\/978-3-642-10677-4_20"},{"key":"261_CR24","doi-asserted-by":"crossref","unstructured":"Modani, N., Dey, K.: Large maximal cliques enumeration in sparse graphs. In: CIKM, pp. 1377\u20131378 (2008)","DOI":"10.1145\/1458082.1458288"},{"key":"261_CR25","first-page":"542","volume-title":"Proc. of the 14th ACM SIGKDD (KDD \u201908)","author":"RM Nallapati","year":"2008","unstructured":"Nallapati, R.M., Ahmed, A., Xing, E.P., Cohen, W.W.: Joint latent topic models for text and citations. In: Proc. of the 14th ACM SIGKDD (KDD \u201908), pp. 542\u2013550. ACM, New York, NY (2008). doi: 10.1145\/1401890.1401957"},{"key":"261_CR26","doi-asserted-by":"crossref","first-page":"066, 133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066, 133 (2004)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"261_CR27","doi-asserted-by":"crossref","first-page":"036122","DOI":"10.1103\/PhysRevE.68.036122","volume":"68","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J., Park, J.: Why social networks are different from other types of networks. Phys. Rev. E 68(3), 036122 (2003)","journal-title":"Phys. Rev. E"},{"key":"261_CR28","doi-asserted-by":"crossref","unstructured":"Ono, C., Kurokawa, M., Motomura, Y., Asoh, H.: A context-aware movie preference model using a bayesian network for recommendation and promotion. In: User Modeling, pp. 247\u2013257 (2007)","DOI":"10.1007\/978-3-540-73078-1_28"},{"issue":"7043","key":"261_CR29","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.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"key":"261_CR30","doi-asserted-by":"crossref","unstructured":"Pil\u00e1szy, I., Tikk, D.: Recommending new movies: even a few ratings are more valuable than metadata. In: Proc. of the third ACM Conf. on Recommender Systems, pp. 93\u2013100 (2009)","DOI":"10.1145\/1639714.1639731"},{"key":"261_CR31","doi-asserted-by":"crossref","unstructured":"Qi, G.J., Aggarwal, C.C., Huang, T.: Community detection with edge content in social media networks. In: International Conference on Data Engineering, pp. 534\u2013545 (2012). doi: 10.1109\/ICDE.2012.77","DOI":"10.1109\/ICDE.2012.77"},{"key":"261_CR32","unstructured":"Said, A., Luca, E.W.D., Albayrak, S.: How social relationships affect user similarities. In: SRS (2010)"},{"key":"261_CR33","doi-asserted-by":"crossref","unstructured":"Sarwar, B., Karypis, G., Konstan, J., Reidl, J.: Item-based collaborative filtering recommendation algorithms. In: WWW, pp. 285\u2013295 (2001)","DOI":"10.1145\/371920.372071"},{"key":"261_CR34","doi-asserted-by":"crossref","unstructured":"Silva, A., Wagner Meira, J., Zaki, M.J.: Structural correlation pattern mining for large graphs. In: 8th Workshop on Mining and Learning with Graphs (with SIGKDD) (2010)","DOI":"10.1145\/1830252.1830268"},{"key":"261_CR35","doi-asserted-by":"crossref","unstructured":"Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: SIGMOD, pp. 1\u201312 (1996)","DOI":"10.1145\/235968.233311"},{"key":"261_CR36","doi-asserted-by":"crossref","unstructured":"Subramani, K., Velkov, A., Ntoutsi, I., Kroger, P., Kriegel, H.P.: Density-based community detection in social networks. In: International Conference on Internet Multimedia Services Architecture and Applications (2011). doi: 10.1109\/IMSAA.2011.6156357","DOI":"10.1109\/IMSAA.2011.6156357"},{"key":"261_CR37","doi-asserted-by":"crossref","unstructured":"Sun, H., Huang, J., Han, J., Deng, H., Sun, Y.: SHRINK: A structural clustering algorithm for detecting hierarchical communities in networks. In: CIKM\u201910, Toronto, Canada (2010)","DOI":"10.1145\/1871437.1871469"},{"key":"261_CR38","doi-asserted-by":"crossref","unstructured":"Wang, J., Jiawei, H., Pei, J.: Closet+: searching for the best strategies for mining frequent closed itemsets. In: SIGKDD, pp. 236\u2013245 (2003)","DOI":"10.1145\/956755.956779"},{"issue":"3","key":"261_CR39","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372\u2013390 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-013-0261-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-013-0261-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-013-0261-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T22:39:03Z","timestamp":1746052743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-013-0261-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,22]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["261"],"URL":"https:\/\/doi.org\/10.1007\/s11280-013-0261-1","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2013,11,22]]}}}