Please use this identifier to cite or link to this item:
|Title:||Community-based user recommendation in uni-directional social networks|
Uni-direction social network
|Source:||Zhao, G.,Lee, M.L.,Hsu, W.,Chen, W.,Hu, H. (2013). Community-based user recommendation in uni-directional social networks. International Conference on Information and Knowledge Management, Proceedings : 189-198. ScholarBank@NUS Repository. https://doi.org/10.1145/2505515.2505533|
|Abstract:||Advances in Web 2.0 technology has led to the rising popularity of many social network services, e.g., there are over 500 million active users in Twitter. Given the huge number of users, user recommendation has gained importance where the goal is to find a set of users whom a target user is likely to follow. Content-based approaches that rely on tweet content for user recommendation have low precision as tweet contents are typically short and noisy, while collaborative filtering approaches that utilize follower-followee relationships lead to higher precision but data sparsity remains a challenge. In this work, we propose a community-based approach to user recommendation in Twitter-style social networks. Forming communities enables us to reduce data sparsity and focus on discovering the latent characteristics of communities instead of individuals. We employ an LDA-based method on the follower-followee relationships to discover communities before applying the state-of-the-art matrix factorization method on each of the communities. This approach proves effective in improving the conversion rate (by as much as 20%) as demonstrated by the results of extensive experiments on two real world data sets Twitter and Weibo. In addition, the community-based approach is scalable as the individual community can be analyzed separately. Copyright 2013 ACM.|
|Source Title:||International Conference on Information and Knowledge Management, Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 7, 2018
checked on Mar 9, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.