2013 International Conference on Social Computing 2013
DOI: 10.1109/socialcom.2013.53
|View full text |Cite
|
Sign up to set email alerts
|

Entity Matching in Online Social Networks

Abstract: In recent years, Online Social Networks (OSNs) have essentially become an integral part of our daily lives. There are hundreds of OSNs, each with its own focus and offers for particular services and functionalities. To take advantage of the full range of services and functionalities that OSNs offer, users often create several accounts on various OSNs using the same or different personal information. Retrieving all available data about an individual from several OSNs and merging it into one profile can be usefu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
50
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 74 publications
(50 citation statements)
references
References 6 publications
0
50
0
Order By: Relevance
“…In other words, two different user profiles from two different OSNs can be matched based on the features extracted from user profile and networks. There are some studies about profile matching and while some of them just use profiles of users (Peled et al, 2013), some of them use friend networks. Peled et al (2013) provide a four-step algorithm for entity resolution based on user profiles: data acquisition, feature extraction, training set construction, and building the model.…”
Section: Matching Profiles Across Multiple Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…In other words, two different user profiles from two different OSNs can be matched based on the features extracted from user profile and networks. There are some studies about profile matching and while some of them just use profiles of users (Peled et al, 2013), some of them use friend networks. Peled et al (2013) provide a four-step algorithm for entity resolution based on user profiles: data acquisition, feature extraction, training set construction, and building the model.…”
Section: Matching Profiles Across Multiple Networkmentioning
confidence: 99%
“…There are some studies about profile matching and while some of them just use profiles of users (Peled et al, 2013), some of them use friend networks. Peled et al (2013) provide a four-step algorithm for entity resolution based on user profiles: data acquisition, feature extraction, training set construction, and building the model. In the data acquisition stage, irrelevant data are filtered out after crawling user profiles.…”
Section: Matching Profiles Across Multiple Networkmentioning
confidence: 99%
“…Peled [18] presented a supervised learning method to match user profiles, and then proved its good performance in matching user profiles, though incomplete records with missing data could significantly increase the error rate of the comparison algorithm. Xu [19] showed that combing social features with personal features could improve the performance of criminal identity matching.…”
Section: Related Workmentioning
confidence: 99%
“…Studies have shown that individuals tend to use the same username, or a similar one in different online services. Peled [18] believed that name-based features are the most important ones in entity matching. Therefore, we take online shopping account profile attributes into consideration.…”
Section: Features Extraction Of Online Shopping Accountmentioning
confidence: 99%
“…This problem has been attracting many researchers. For instance, Raad et al [16] and Peled et al [15] proposed a model to measure the similarity between user profiles. Anderson et al [1] calculated the similarity between user characteristics.…”
Section: Introductionmentioning
confidence: 99%