{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:23Z","timestamp":1750307123482,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["CCF-0916309IIS-0713142"],"award-info":[{"award-number":["CCF-0916309IIS-0713142"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0916309IIS-0713142"],"award-info":[{"award-number":["CCF-0916309IIS-0713142"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p>Social network analysis has attracted increasing attention in recent years. In many social networks, besides friendship links among users, the phenomenon of users associating themselves with groups or communities is common. Thus, two networks exist simultaneously: the friendship network among users, and the affiliation network between users and groups. In this article, we tackle the affiliation recommendation problem, where the task is to predict or suggest new affiliations between users and communities, given the current state of the friendship and affiliation networks. More generally, affiliations need not be community affiliations---they can be a user\u2019s taste, so affiliation recommendation algorithms have applications beyond community recommendation. In this article, we show that information from the friendship network can indeed be fruitfully exploited in making affiliation recommendations. Using a simple way of combining these networks, we suggest two models of user-community affinity for the purpose of making affiliation recommendations: one based on graph proximity, and another using latent factors to model users and communities. We explore the affiliation recommendation algorithms suggested by these models and evaluate these algorithms on two real-world networks, Orkut and Youtube. In doing so, we motivate and propose a way of evaluating recommenders, by measuring how good the top 50 recommendations are for the average user, and demonstrate the importance of choosing the right evaluation strategy. The algorithms suggested by the graph proximity model turn out to be the most effective. We also introduce scalable versions of these algorithms, and demonstrate their effectiveness. This use of link prediction techniques for the purpose of affiliation recommendation is, to our knowledge, novel.<\/jats:p>","DOI":"10.1145\/2036264.2036267","type":"journal-article","created":{"date-parts":[[2012,10,12]],"date-time":"2012-10-12T20:56:02Z","timestamp":1350075362000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Scalable Affiliation Recommendation using Auxiliary Networks"],"prefix":"10.1145","volume":"3","author":[{"given":"Vishvas","family":"Vasuki","sequence":"first","affiliation":[{"name":"University of Texas at Austin"}]},{"given":"Nagarajan","family":"Natarajan","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}]},{"given":"Zhengdong","family":"Lu","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}]},{"given":"Berkant","family":"Savas","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}]},{"given":"Inderjit","family":"Dhillon","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}]}],"member":"320","published-online":{"date-parts":[[2011,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"volume-title":"Proceedings of the 22nd International Conference on Computational Linguistics (COLING). Association for Computational Linguistics","author":"Bader B. W.","key":"e_1_2_1_2_1","unstructured":"Bader , B. W. and Chew , P. A . 2008. Enhancing multilingual latent semantic analysis with term alignment information . In Proceedings of the 22nd International Conference on Computational Linguistics (COLING). Association for Computational Linguistics , Morristown, NJ, 49--56. Bader, B. W. and Chew, P. A. 2008. Enhancing multilingual latent semantic analysis with term alignment information. In Proceedings of the 22nd International Conference on Computational Linguistics (COLING). Association for Computational Linguistics, Morristown, NJ, 49--56."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526801"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401909"},{"volume-title":"Proceedings of the 2009 IEEE International Conference on Multimedia and Expo (ICME). IEEE Press","author":"De Choudhury M.","key":"e_1_2_1_6_1","unstructured":"De Choudhury , M. , Sundaram , H. , Lin , Y.-R. , John , A. , and Seligmann , D. D . 2009. Connecting content to community in social media via image content, user tags and user communication . In Proceedings of the 2009 IEEE International Conference on Multimedia and Expo (ICME). IEEE Press , Los Alamitos, CA, 1238--1241. De Choudhury, M., Sundaram, H., Lin, Y.-R., John, A., and Seligmann, D. D. 2009. Connecting content to community in social media via image content, user tags and user communication. In Proceedings of the 2009 IEEE International Conference on Multimedia and Expo (ICME). IEEE Press, Los Alamitos, CA, 1238--1241."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"e_1_2_1_8_1","volume-title":"Matrix Computations","author":"Golub G. H.","unstructured":"Golub , G. H. and Van Loan , C. F. 1996. Matrix Computations 3 rd Ed., Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press , Baltimore, MD. Golub, G. H. and Van Loan, C. F. 1996. Matrix Computations 3rd Ed., Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD.","edition":"3"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312649"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"volume-title":"Department of Computer Science","author":"Larsen R.","key":"e_1_2_1_13_1","unstructured":"Larsen , R. 1998. Lanczos bidiagonalization with partial reorthogonalization. Tech. rep. DAIMI PB-357 , Department of Computer Science , Aarhus University . Larsen, R. 1998. Lanczos bidiagonalization with partial reorthogonalization. Tech. rep. DAIMI PB-357, Department of Computer Science, Aarhus University."},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Lehoucq R. Sorensen D. and Yang C. 1998. Arpack Users\u2019 Guide: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. SIAM Philadelphia. Lehoucq R. Sorensen D. and Yang C. 1998. Arpack Users\u2019 Guide: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods . SIAM Philadelphia.","DOI":"10.1137\/1.9780898719628"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"volume-title":"Proceedings of the SIAM Data Mining Conference. To appear.","author":"Savas B.","key":"e_1_2_1_17_1","unstructured":"Savas , B. and Dhillon , I. S . 2011. Clustered low rank approximation of graphs in information science applications . In Proceedings of the SIAM Data Mining Conference. To appear. Savas, B. and Dhillon, I. S. 2011. Clustered low rank approximation of graphs in information science applications. In Proceedings of the SIAM Data Mining Conference. To appear."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401969"},{"key":"e_1_2_1_19_1","unstructured":"Song H. H. Savas B. Cho T. W. Dave V. Lu Z. Dhillon I. Zhang Y. and Qiu L. 2010. Clustered embedding of massive online social networks. Tech. rep. Department of Computer Science The University of Texas at Austin. Song H. H. Savas B. Cho T. W. Dave V. Lu Z. Dhillon I. Zhang Y. and Qiu L. 2010. Clustered embedding of massive online social networks. Tech. rep. Department of Computer Science The University of Texas at Austin."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.125"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864731"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557128"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2036264.2036267","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2036264.2036267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:28Z","timestamp":1750240108000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2036264.2036267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.1145\/2036264.2036267"],"URL":"https:\/\/doi.org\/10.1145\/2036264.2036267","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"type":"print","value":"2157-6904"},{"type":"electronic","value":"2157-6912"}],"subject":[],"published":{"date-parts":[[2011,10]]},"assertion":[{"value":"2010-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}