2010 13th International Conference on Network-Based Information Systems 2010
DOI: 10.1109/nbis.2010.35
|View full text |Cite
|
Sign up to set email alerts
|

User Profile Matching in Social Networks

Abstract: Abstract-Inter-social networks operations and functionalities are required in several scenarios (data integration, data enrichment, information retrieval, etc.). To achieve this, matching user profiles is required. Current methods are so restrictive and do not consider all the related problems. Particularly, they assume that two profiles describe the same physical person only if the values of their Inverse Functional Property or IFP (e.g. the email address, homepage, etc.) are the same. However, the observed t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
71
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 136 publications
(72 citation statements)
references
References 14 publications
1
71
0
Order By: Relevance
“…We propose a reciprocal-weighted euclidean similarity function (RWD), which is inspired by the hybrid weighted euclidean function and existing research works on matching user profiles of a network (Carbonell et al 2014;Raad et al 2010), to consider self-assigned weights and position orders to profile attributes, when determining similarity measure across profiles. Let L and U be two learner profiles represented by n-dimensional attribute vector, L = (l 1 , l 2 , … , l n ) and U = (u 1 , u 2 , … , u n ) depicting n pre-established measurements made associated with the learner from n attributes, respectively A 1 , A 2 , ⋯ A n which represent common social interests.…”
Section: Reciprocal-weighted Euclidean To Construct Cop-networkmentioning
confidence: 99%
“…We propose a reciprocal-weighted euclidean similarity function (RWD), which is inspired by the hybrid weighted euclidean function and existing research works on matching user profiles of a network (Carbonell et al 2014;Raad et al 2010), to consider self-assigned weights and position orders to profile attributes, when determining similarity measure across profiles. Let L and U be two learner profiles represented by n-dimensional attribute vector, L = (l 1 , l 2 , … , l n ) and U = (u 1 , u 2 , … , u n ) depicting n pre-established measurements made associated with the learner from n attributes, respectively A 1 , A 2 , ⋯ A n which represent common social interests.…”
Section: Reciprocal-weighted Euclidean To Construct Cop-networkmentioning
confidence: 99%
“…Raad [21] used most of the profile attributes, like username, nickname, mailbox, image, etc., and gave different importance to the attributes. Lofciu [22] combined user tags in user profiles to measure the distance between user profiles for identification.…”
Section: Features Extraction Of Social Network Accountmentioning
confidence: 99%
“…Many of these available services are designed to help foster information sharing [55], bridge online and offline connections to enforce interactions [56], provide instant information help [46], and enable users to derive a variety of uses and gratifications from these sites [39]. To make use of the provided functionalities and to stay tuned with their related members, users create several accounts on various social networks where they disclose personal information with varying degrees of sensitivity [57]. Personal information available on these networks commonly describes users and their interactions, along with their published data.…”
Section: Social Network Usersmentioning
confidence: 99%
“…Social network users create several accounts on various sites where they disclose personal and professional information [57]. Link-based node identification can be used to associate a user profile to a real-world entity (person).…”
Section: Privacy Threatsmentioning
confidence: 99%