{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T04:09:45Z","timestamp":1745208585559,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642350627"},{"type":"electronic","value":"9783642350634"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35063-4_28","type":"book-chapter","created":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T01:36:15Z","timestamp":1352252175000},"page":"382-395","source":"Crossref","is-referenced-by-count":1,"title":["Like-Minded Communities: Bringing the Familiarity and Similarity together"],"prefix":"10.1007","author":[{"given":"Natwar","family":"Modani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ritesh","family":"Gupta","sequence":"additional","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":"Saurabh","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuntal","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(066111) (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"28_CR2","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":"28_CR3","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"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Ntl. Acad. Sci, USA 99(7821) (2002)","DOI":"10.1073\/pnas.122653799"},{"issue":"7043","key":"28_CR5","doi-asserted-by":"publisher","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\u00a0435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"3-5","key":"28_CR6","doi-asserted-by":"publisher","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. Physics Reports\u00a0486(3-5), 75\u2013174 (2010)","journal-title":"Physics Reports"},{"key":"28_CR7","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 2010, Toronto, Canada (October 2010)","DOI":"10.1145\/1871437.1871469"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"66133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E\u00a069, 66133 (2004)","journal-title":"Phys. Rev. E"},{"key":"28_CR9","unstructured":"Said, A., Luca, E.W.D., Albayrak, S.: How social relationships affect user similarities. In: SRS (2010)"},{"key":"28_CR10","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\/1353343.1353424"},{"key":"28_CR11","volume-title":"Introduction to Social Network Methods","author":"R.A. Hanneman","year":"2005","unstructured":"Hanneman, R.A., Riddle, M.: Introduction to Social Network Methods. University of California, Riverside (2005)"},{"key":"28_CR12","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"},{"issue":"2","key":"28_CR13","doi-asserted-by":"publisher","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.\u00a021(2), 224\u2013240 (2010)","journal-title":"Data Min. Knowl. Discov."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Jaho, E., Karaliopoulos, M., Stavrakakis, I.: Iscode: a framework for interest similarity-based community detection in social networks. In: IEEE INFOCOM Workshops, pp. 912\u2013917 (2011)","DOI":"10.1109\/INFCOMW.2011.5928942"},{"key":"28_CR15","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":"28_CR16","first-page":"430","volume":"21","author":"D. Cohn","year":"2001","unstructured":"Cohn, D., Hofman, T.: The missing link - a probabilistic model of document content and hypertext connectivity. Advances In Neural Information Processing Systems\u00a021, 430\u2013436 (2001)","journal-title":"Advances In Neural Information Processing Systems"},{"key":"28_CR17","first-page":"542","volume-title":"Proc. of the 14th ACM SIGKDD (KDD 2008)","author":"R.M. 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 2008), pp. 542\u2013550. ACM, New York (2008)"},{"key":"28_CR18","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) (July 2010)","DOI":"10.1145\/1830252.1830268"},{"key":"28_CR19","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487\u2013499 (1994)"},{"key":"28_CR20","doi-asserted-by":"publisher","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 Mining and Knowledge Discovery\u00a08, 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"28_CR21","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":"28_CR22","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":"28_CR23","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering\u00a012(3), 372\u2013390 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"28_CR24","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":"28_CR25","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"},{"key":"28_CR26","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":"28_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-73078-1_28","volume-title":"User Modeling 2007","author":"C. Ono","year":"2007","unstructured":"Ono, C., Kurokawa, M., Motomura, Y., Asoh, H.: A Context-aware Movie Preference Model Using a Bayesian Network for Recommendation and Promotion. In: Conati, C., McCoy, K., Paliouras, G. (eds.) UM 2007. LNCS (LNAI), vol.\u00a04511, pp. 247\u2013257. Springer, Heidelberg (2007)"},{"key":"28_CR28","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":"28_CR29","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":"28_CR30","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)"},{"issue":"3","key":"28_CR31","doi-asserted-by":"publisher","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 Technology Journal\u00a024(3), 84\u201398 (2006)","journal-title":"BT Technology Journal"},{"key":"28_CR32","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/312624.312682","volume-title":"Proc. of the SIGIR","author":"J.L. 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 (1999)"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering - WISE 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35063-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T10:05:50Z","timestamp":1745143550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35063-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642350627","9783642350634"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35063-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}