CSD: A multi-user similarity metric for community recommendation in online social networks
نویسندگان
چکیده
Communities are basic components in networks. As a promising social application, community recommendation selects a few items (e.g., movies and books) to recommend to a group of users. It usually achieves higher recommendation precision if the users share more interests; whereas, in plenty of communities (e.g., families, work groups), the users often share few. With billions of communities in online social networks, quickly selecting the communities where the members are similar in interests is a prerequisite for community recommendation. To this end, we propose an easy-to-compute metric, Community Similarity Degree (CSD), to estimate the degree of interest similarity among multiple users in a community. Based on 3460 emulated Facebook communities, we conduct extensive empirical studies to reveal the characteristics of CSD and validate the effectiveness of CSD. In particular, we demonstrate that selecting communities with larger CSD can achieve higher recommendation precision. In addition, we verify the computation efficiency of CSD: it costs less than 1 hour to calculate CSD for over 1 million of communities. Finally, we draw insights about feasible extensions to the definition of CSD, and point out the practical uses of CSD in a variety of applications other than community recommendation. © 2016 Elsevier Ltd. All rights reserved.
منابع مشابه
Providing a Link Prediction Model based on Structural and Homophily Similarity in Social Networks
In recent years, with the growing number of online social networks, these networks have become one of the best markets for advertising and commerce, so studying these networks is very important. Most online social networks are growing and changing with new communications (new edges). Forecasting new edges in online social networks can give us a better understanding of the growth of these networ...
متن کاملSimilarity measurement for describe user images in social media
Online social networks like Instagram are places for communication. Also, these media produce rich metadata which are useful for further analysis in many fields including health and cognitive science. Many researchers are using these metadata like hashtags, images, etc. to detect patterns of user activities. However, there are several serious ambiguities like how much reliable are these informa...
متن کاملA Profile-based Friend Detection Scheme for Online Social Networks
In past few years, users created friends with every other World Health Organization live or work near them, like neighbor or work place etc. this kind of friendly relationship is named as ancient means of constructing friends or G. Friend referred to as geographical primarily based friends .Now social networking services recommend friends to users based on their social graphs, which may not be ...
متن کاملTRPC: An Ensembled Online Prediction Mechanism for Trusted Recommender System
The most recent invasions in social networks make it inevitable to develop a network with high dependence and confidence to users. Even though recommender systems of today use advanced parallelism in web development, achieving trustworthiness in such a system has been a challenging task for several years. To overcome the existing sparsity, scalability and dynamism in new item/user issues, we pr...
متن کاملModeling agent trustworthiness with credibility for message recommendation in social networks
This paper presents a framework for multiagent systems trust modeling that reasons about both user credibility and user similarity. Through simulation, we are able to show that our approach works well in social networking environments by presenting messages to users with high predicted benefit.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Expert Syst. Appl.
دوره 53 شماره
صفحات -
تاریخ انتشار 2016