SocialMatching++: A Novel Approach for Interlinking User Profiles on Social Networks
نویسندگان
چکیده
With the large number of users connected to social networks, screenname duplication is a rising problem, which leads to interference when trying to recognize users. A number of algorithms have been proposed to distinguish user profiles on one or multiple social networks. The main task in this context is to have robust features. According to the state-of-the-art approaches, features can be: content and behavioural based features, that compare content similarity between posts or behaviour similarity (timestamps between posts (behavioural), or overlapping between content (content) for example). Attribute-based features that compare profiles attributes, such as gender, age, location or image. In this paper, we tackle this problem and propose SocialMatching++ a novel approach that leverages: (1) user life events such as graduation, marriage or new job, which used to enhance the behavioural approaches (2) profile biographies, which consist in small paragraphs that users write to comprise arbitrary information about themselves. These are used to enhance the attribute approaches. To evaluate our approach, we conducted experiments on 2,263 different profiles from Facebook matched with 5,694 Twitter users, and compared them with two baseline approaches. Our results show that SocialMatching++ achieves better results compared to the baselines approaches, showing that our system successfully bridges the gap between behavioural and attribute based approaches.
منابع مشابه
Improving the performance of recommender systems in the face of the cold start problem by analyzing user behavior on social network
The goal of recommender system is to provide desired items for users. One of the main challenges affecting the performance of recommendation systems is the cold-start problem that is occurred as a result of lack of information about a user/item. In this article, first we will present an approach, uses social streams such as Twitter to create a behavioral profile, then user profiles are clusteri...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملPrediction of user's trustworthiness in web-based social networks via text mining
In Social networks, users need a proper estimation of trust in others to be able to initialize reliable relationships. Some trust evaluation mechanisms have been offered, which use direct ratings to calculate or propagate trust values. However, in some web-based social networks where users only have binary relationships, there is no direct rating available. Therefore, a new method is required t...
متن کاملA CSA Method for Assigning Client to Servers in Online Social Networks
This paper deals with the problem of user-server assignment in online social network systems. Online social network applications such as Facebook, Twitter, or Instagram are built on an infrastructure of servers that enables them to communicate with each other. A key factor that determines the facility of communication between the users and the servers is the Expected Transmission Time (ETT). A ...
متن کاملIntegrating and Ranking Interests From User Profiles!
Many websites allow their users to personalize their profiles. As users subscribe to many personalization websites, such as social networks or search systems, each user owns different profiles, which are seldom compatible. Yet, there is a strong need for comparing the profiles of different users to discover shared interests, e.g., by integrating all user profiles into a global one. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017