<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>SocialMatching++: A Novel Approach for Interlinking User Profiles on Social Networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hussein Hazimeh</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Elena Mugellini</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Omar Abou Khaled</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Philippe Cudré-Mauroux</string-name>
          <email>phil@exascale.info</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Applied Sciences of Western Switzerland</institution>
          ,
          <addr-line>Fribourg</addr-line>
          ,
          <country country="CH">Switzerland</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>eXascale Infolab, University of Fribourg</institution>
          ,
          <addr-line>Fribourg</addr-line>
          <country country="CH">Switzerland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>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.</p>
      </abstract>
      <kwd-group>
        <kwd>Identity Linkage</kwd>
        <kwd>Profile Matching</kwd>
        <kwd>Social Networks</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        The process of registration on any social networking website is accomplished in an
easy fashion, launched by the creation of a new user account. Typically, it is
necessary to provide an email and a password to obtain a valid user profile. A user
can later access his own profile and modify a diversity of settings concerning several
aspects, such as profile image, location, relationship status, social network, interests
and other information. People can register themselves on several sites, moreover, the
same user can create different accounts on a single platform by providing the same
information for each different profiles while using different email accounts. So far,
social networking sites did not setup any mechanisms yet to detect discover if two
accounts are similar and merge them. This problem is mainly originating from
databases known as Record Linkage (RL). RL is the task of identifying records
corresponding to the same entity from one or more data sources accurately, [
        <xref ref-type="bibr" rid="ref22 ref27">22, 27</xref>
        ].
The process of RL normally starts by resolving entities in database (Entity resolution),
matching them using convenient data matching techniques and finally merging
similar records.
The scenario is similar in social networks; Figure 1 shows a generic model that
explains how it works. Suppose that we have two social networks, social network SNa
and social network SNb, and we have a user entity Entitya on SNa and user entity
Entityb on SNb. The objective is to discover whether these two profile accounts are
linkable. Approaches to user profile matching usually start by defining a set of
features (matching interlinks) to link user profiles. Interlinks are categorized into
attribute information or context and semantic information [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ]. Attribute based
matchers employ profile attributes, such as screennames, profile images, birthdates,
etc. Context or semantic matchers compare the behavioural likeness of user profiles.
Both categories of matching algorithms poses a set of challenges: in attribute ones,
information can be private or not updated; in semantic (behavioural) ones user’s
activity can be completely different between two social networks.
      </p>
      <p>The research community works forward to investigate new matching mechanisms.
Timestamp variations between user posts, is a widely used behavioral feature.
However, this feature could be weak if the user is active in only one social network
rather than the others. Similarly, profile attributes like image, location, and others,
might be not updated over time.</p>
      <p>In this paper, we tackle this problem by leveraging two novel profile-matching
features: (1) user life events and (2) profile biographies. Our approach enhances the
behavioral approaches and attribute ones, arguing that even if a user is not active in
one social network, the potential of sharing his life events such as marriage,
graduation, new job, etc, could be high. Furthermore, given life events cannot be
common for two different users. Profile biographies contain key information about
the user, with the advantage that it is always public and easy to be fetched. The
proposed approach is tested on profiles extracted from Facebook, and linked them to
their correspondent Twitter accounts.
The following two sections present the most relevant approaches closest to ours. In
Table 1, we mention the feature(s) used by each approach.
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Attribute-based approaches</title>
      <p>
        Attribute-based approaches use basic profile attributes such as: gender, age, location
or profile images. Goga et al. 2015 [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] define four characteristics: availability,
consistency, non-impersonability, and discriminability. By using each one of the
following attributes, they can reach a reliable matching. The second contribution of
their work is how to select the training and testing sets properly.
      </p>
      <p>
        Raad et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] goal is to create a framework that finds the similarity among user
profiles across different social networks. They exploit to solve this problem all the
user’s profile attributes. The matching mechanism starts by assigning weights to each
one of the profile attributes based on its importance. To decide the matching
occurrence, they create a decision-making algorithm and assign it this task.
Jain et al. 2015 [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] Link user profiles’ accounts by detecting the historical
modifications of user’s profile attribute information. Historical values of attributes
can definitely link two same users. However, they are not always available and hard
to fetch them.
      </p>
      <p>
        Bennacer et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] match social accounts across Flickr, Live-Journal, Twitter and
YouTube using names, emails and links to other webpages. In addition, they define a
set of rules on the aforementioned attributes to ensure the matching accuracy.
Zafarani et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] provide an approach for mapping user across communities. They
use data collected form twelve different communities. The main goal of this research
is to connect these platforms using community mappings. To achieve this task the
authors rely on usernames and URL with an accuracy of 66%.
2.2
      </p>
      <p>
        Content and behavioural based approaches
Behavioural-based approaches use comparisons between user behaviours leveraging
features such as posting rates, timestamps, or comparing content of posts.
Van Le et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] propose a system for user profile modelling which exploits Latent
Dirichlet Allocation (LDA) to discover the hidden topics that lies inside
usergenerated contents.
      </p>
      <p>
        Liu et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] introduce HYDRA for linking different accounts of the same user using
a large-scale approach, which models the behavior across different social networks
during a long period, in order to raise the level of consistency. This approach allows
overcoming shortcomings of basic behavioral comparisons, due to the heterogeneity
of behavior modelled across different social networks. Another crucial matching key
proposed is the social network structure of a user.
      </p>
      <p>
        Zafarani et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] propose an attribute-independent user profile mapping approach, by
exploiting redundant information that exists from user’s behavioral patterns in social
media sites. They argue that behavioral information is unique, due to a variety of
factors, such as user personality and others. Since user personality cannot be changed,
this will lead to effective mapping approach. The second contribution is the use of
machine learning techniques to increase the efficiency or accuracy of user
identification.
      </p>
      <p>
        Roedler et al. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] exploite timestamps between user posts and geo-tags. They
hypothesize that users use their social networks simultaneously; hence, if a user for
example update his status on Facebook, he will do the same on Twitter. They use
goetags to infer user’s geographical area by calculating distances between these tags.
      </p>
      <sec id="sec-2-1">
        <title>Reference</title>
      </sec>
      <sec id="sec-2-2">
        <title>Goga et al. [7]</title>
        <p>
          Sha et al. [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Zafarani et al. [1]</title>
      </sec>
      <sec id="sec-2-4">
        <title>Goga at al. [9]</title>
      </sec>
      <sec id="sec-2-5">
        <title>Bennacer et al. [18]</title>
        <p>
          Van Le et al. [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]
        </p>
      </sec>
      <sec id="sec-2-6">
        <title>Raad et al. [2]</title>
        <p>
          Jain et al. [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]
Liu et al. [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]
        </p>
      </sec>
      <sec id="sec-2-7">
        <title>Zafarani et al. [3]</title>
      </sec>
      <sec id="sec-2-8">
        <title>Nunes et al. [13]</title>
      </sec>
      <sec id="sec-2-9">
        <title>Motoyama et al. [4]</title>
      </sec>
      <sec id="sec-2-10">
        <title>Bartunov et al. [5]</title>
      </sec>
      <sec id="sec-2-11">
        <title>Vosecky et al. [6] Shen et al. [14]</title>
      </sec>
      <sec id="sec-2-12">
        <title>Liang et al. [19]</title>
      </sec>
      <sec id="sec-2-13">
        <title>Roedler et al. [20]</title>
      </sec>
      <sec id="sec-2-14">
        <title>Panchenko et al. [17]</title>
      </sec>
      <sec id="sec-2-15">
        <title>Nguyen et al. [16]</title>
      </sec>
      <sec id="sec-2-16">
        <title>Peled et al. [15]</title>
        <p>
          Jain et al. 2015 [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ]
        </p>
      </sec>
      <sec id="sec-2-17">
        <title>Perito et al. [28]</title>
      </sec>
      <sec id="sec-2-18">
        <title>Szomszor et al. [30]</title>
      </sec>
      <sec id="sec-2-19">
        <title>Iofciu et al. [31]</title>
      </sec>
      <sec id="sec-2-20">
        <title>Malhotra et al. [34]</title>
      </sec>
      <sec id="sec-2-21">
        <title>Zhang et al. [37]</title>
      </sec>
      <sec id="sec-2-22">
        <title>Vosoughi et al. [35]</title>
      </sec>
      <sec id="sec-2-23">
        <title>Matching features (Interlinks)</title>
      </sec>
      <sec id="sec-2-24">
        <title>Geo-location, timestamp of posts, writing style</title>
      </sec>
      <sec id="sec-2-25">
        <title>User message (posts, tweets, retweets)</title>
      </sec>
      <sec id="sec-2-26">
        <title>Usernames</title>
      </sec>
      <sec id="sec-2-27">
        <title>Profile public-attributes</title>
      </sec>
      <sec id="sec-2-28">
        <title>Network topology, public information</title>
      </sec>
      <sec id="sec-2-29">
        <title>Topics exists in user posts</title>
      </sec>
      <sec id="sec-2-30">
        <title>Profile public-attributes</title>
      </sec>
      <sec id="sec-2-31">
        <title>Public-attributes, social network, self-mentions (URIs)</title>
      </sec>
      <sec id="sec-2-32">
        <title>Long-term behavioral analysis</title>
      </sec>
      <sec id="sec-2-33">
        <title>Information redundancies in behavioral patterns</title>
      </sec>
      <sec id="sec-2-34">
        <title>Profile public-attributes</title>
      </sec>
      <sec id="sec-2-35">
        <title>Profile public-attributes, email</title>
      </sec>
      <sec id="sec-2-36">
        <title>Profile public-attributes, friendship links</title>
      </sec>
      <sec id="sec-2-37">
        <title>Profile public-attributes</title>
      </sec>
      <sec id="sec-2-38">
        <title>Public attributes, neighborhood features, quasi (inferred) features</title>
      </sec>
      <sec id="sec-2-39">
        <title>Profile attributes, friendship links</title>
      </sec>
      <sec id="sec-2-40">
        <title>Timestamp of posts, device generated geo-tags</title>
      </sec>
      <sec id="sec-2-41">
        <title>Usernames, friend lists</title>
      </sec>
      <sec id="sec-2-42">
        <title>User public information</title>
      </sec>
      <sec id="sec-2-43">
        <title>Profile public-attributes, network features</title>
      </sec>
      <sec id="sec-2-44">
        <title>Historical values of attributes</title>
      </sec>
      <sec id="sec-2-45">
        <title>Usernames</title>
      </sec>
      <sec id="sec-2-46">
        <title>Tag-clouds</title>
      </sec>
      <sec id="sec-2-47">
        <title>Usernames, tags</title>
        <p>username, display name, location, profile image, and
number of connections</p>
      </sec>
      <sec id="sec-2-48">
        <title>Local features: Usernames, language, URL, popularity.</title>
      </sec>
      <sec id="sec-2-49">
        <title>External features: location, avatar</title>
      </sec>
      <sec id="sec-2-50">
        <title>Language models, temporal activity</title>
        <p>Based on the aforementioned state-of-the-art analysis, we propose two features life
events and profiles biographies. In addition, we show that they can enhance each
other.
The approach we propose, called SocialMatching++, aims at linking user profiles
from Facebook to their exact profiles on Twitter by using life events and biographies
as two novel matching links.
3.1</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>SocialMatching++ Conceptual Model</title>
      <p>SocialMatching++ is divided into: (1) LEBL (Life Event Based Linking) that link
profiles using life events, and (2) DEBL (DEscription Based Linking) that link
profiles based on profile biographies. Figure 2 shows a case study of
SocialMatching++ (LEBL). It presents the user interaction on two different platforms
(Facebook and Twitter) over time. We observe that user could have same life event
(graduation) mentioned on both social networks, even if the content and behavior
does not exists on Twitter.
A life event post is not frequent. This means, it occurs in a specific circumstances,
hence users who are not active on all their social networks and want to keep the
audience updated, usually share these events, by writing a post that describe them or
by adding them to their timeline. In our work, life events were extracted from the
users’ timelines on Facebook. Unlike Facebook, no formal representation of life
events on Twitter is available. Consequently, we have to perform alternative
mechanisms to detect them; named entity recognition is used to recognize entities
inside event posts.</p>
      <sec id="sec-3-1">
        <title>Profile descriptions</title>
        <p>Profile description and biography are attributes that exist both on LinkedIn and
Twitter. On LinkedIn, users can write a detailed description about themselves.
However, Twitter descriptions are shorter. Recently, Facebook developed a new
feature that allows users to define anything about themselves using characters. People
can mention any thing inside it (hobbies, life events, biographies, etc). Users can
mention many things inside like new job, hobbies, favorite food, etc.
3.1</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>SocialMatching++ Problem Formulation</title>
      <p>
Let   be a user profile on Facebook and   a user profile on Twitter.   is a known
entity and it consists of a username ( ) which is composed of a first name, last name,
a list of life events  where (</p>
      <p>,  ) and a description  . For each   we have to
match the exact user names on Twitter   .   (1) is the matching function and   (2)
the similarity function.</p>
      <p>(  ,   ) = ∀   
  ( (   ),  (  )) 
  ( (   ),  (  ))
  is the similarity function, and  is the total number of events on Facebook. We use
the vector space model (cosine similarity) because we have a sequence of tokens to
compare in both life events and biographies.</p>
      <p />
      <p>= cos( ) = ∑ =1</p>
      <p>, (   ) (   )
√∑ =1  , (   )2 √∑ =1  , (   )2
(1)
(2)
(3)
The complete architecture of SocialMatching++ is detailed in Figure 3. It starts by
retrieving screennames from Facebook, in parallel the set of life events and
biographies corresponding to each user. After, we find the exact matching
screennames from twitter. For each Twitter account, we search for a similar life
events on their timeline and compare them to those on Facebook, as well as we do the
same for biographies. Finally, we decide if two user profiles are linkable or not.
Two profiles are considered to be matched, if they have exact screenname matches
and if the value of similarity score is higher than a predefined threshold t.
1,  
 &gt;</p>
      <p>. screenname =   . screename
  (  ,   ) = {</p>
      <sec id="sec-4-1">
        <title>SocialMatching++ Implementation</title>
        <p>ℎ
Screennames processing</p>
        <p>Event classifier</p>
        <p>Similarity functions</p>
        <p>Linked
pairs
Profiles extraction</p>
        <p>Profile
linker
Life</p>
        <p>Events &amp; desc. extraction
In SocialMatching++, we decide to use Facebook and Twitter websites. Facebook is
the largest social networking platform across the world, followed by Twitter. In our
research, we observed that only 48.9% from the user profiles extracted from
Facebook own a Twitter account. Facebook permits users to create structured life
events that describe a certain circumstance, these events are commonly posted on the
user’s wall (timeline). Users also can post a new update (status) describing their life
events. Contrariwise, Twitter does not provide any official feature through which
users can update their life events. Twitter users can nevertheless post their own life
events as Tweets.</p>
      </sec>
      <sec id="sec-4-2">
        <title>Processing Screennames and Profile Extraction</title>
        <p>Each user registered on a social network have to define a valid first name and last
name, which are called screen names. People normally distinguish their names to
prevent ambiguity with other users, through the modification of their usernames (a
username is an id that can be accessed via the URL, e.g. facebook.com/userid). For
instance, the exact screen name “Hussein Hazimeh” is available in 50 different
profiles on Facebook, and each one has a different username. In plus, users
differentiate themselves by adding a nickname to the original screen names (e.g.
Hussein Hazimeh (PhD Student)), or to write it in two different languages.
Screennames retrieval process starts by acquiring a set of screennames from the
Facebook directory1, this directory contains people, pages and place names sorted
alphabetically, with the URL for each entity. All screennames extracted were
composed of Latin characters for both Facebook and Twitter datasets. In Figure 2, we
1 https://www.facebook.com/directory
started by querying Facebook with each screenname, after this we obtained a list of
exact screennames from Twitter. The maximum number of matches were 18 for a
Screen
names</p>
        <p>Nick name
removal</p>
        <p>Processing</p>
        <p>To lower
case</p>
        <p>Split
spaces</p>
        <p>Screen
names</p>
        <p>FRieg. 4. ScreennRaemes Processing
single Facebook screenname. All the nicknames that are different from Latin are
removed in the screennames processing phase.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Life Events Extraction</title>
      <p>After all screennames are manipulated carefully, and matched them to the
correspondent screennames on Twitter, we started in retrieving the life events for each
username with the date for each one. The maximum number of events extracted per
entity was seven.</p>
    </sec>
    <sec id="sec-6">
      <title>Biography Extraction</title>
      <p>A set of operations must be applied on biographies before storing them. Due to the
messy content exists in many free texts, many special characters might exist, and that
could diminish the matching performance. For this, we clean all biographies by
removing stop words, stemming the text, remove special characters and defining
entities inside the text.</p>
    </sec>
    <sec id="sec-7">
      <title>Named Entity Extraction</title>
      <p>Named entities are extracted from both life events and biographies. A named entity
can be a person, organization, location or a university. In life events, user can mention
their work place or organization name for example, as well as in biographies, same
entities can be shared, in addition to persons. We used the state-of-the-art techniques
to annotate entities. Conditional Random Fields (CRFs) are widely used models.
Given a specific biography or life event text, applying CRF we can obtain and
annotate all the entities inside this text.</p>
      <p>Life Events Querying Mechanism: a Time Window Approach
Each Facebook life event consists of a set of entities and a date. We model the
timeline of a Twitter user as a series of time windows, Figure 5. A single time
window is a fixed interval of time when the data stream is processed for querying.
Suppose that we have a Facebook life event e that has a specific date d. Our objective
is to query the time window with date d and try to find if we have existing similar life
events to e. The similarity of two life events represented by the function S(e1, e2). S is
positive if one of the two following scenarios is occurred: (1) if the value of  
Function (2) is greater than threshold, or if the similarity between two life events
entities’ is positive.</p>
    </sec>
    <sec id="sec-8">
      <title>Profile linker Workflow</title>
      <p>The first two inputs of the profile linker are: the Facebook screen name and its
corresponding Twitter ids. We have two matching problems, the first one is a (1 to 1)
matching problem. This exists when we have only one matched screen name on
Twitter. The second one is a (1 to n) matching problem. This exists when we have
more than 2 existing Twitter profiles. The matching procedure starts by comparing
two biographies considering both named entities and matching score to take the
matching decision. For e.g.</p>
      <p>Married one year ago. My life Sarah</p>
      <p>Love you Sarah
In the biographies (1) and (2), the similarity score is very low. However, if we
consider common entities between them, we can observe that the user writes about his
wife Sarah. In this case, we decide to link the two profiles rather than ignoring them.
If the description comparison returns a null result, we query each user’s Twitter
timeline with the named entities extracted from Facebook in a specific interval of
time, Figure 5.</p>
    </sec>
    <sec id="sec-9">
      <title>4 Experiments and Evaluation</title>
      <p>In all our experiments, we used Facebook and Twitter websites. Alternative social
networks like Instagram have more number of users compared to Twitter. However,
Instagram allows people to share only images, which is not enough to conduct
matching studies. LinkedIn contains a lot of information about users. But the platform
is dedicated to and we do not have access to the user’s timeline. Hence, even if the
portion of connected users between Facebook and Twitter is not big, they remain two
better choices due to the richness of information tweeted and posted on the user’s
timelines.
We conducted tests on 2,263 different profiles having 6,630 life events and 1948
profile descriptions from Facebook matched with 5,694 Twitter users. The
constructed Facebook dataset is open to the public and available for download (upon
request). To implement our system we used Selenium web driver coded in Java using
eclipse, and used a PC with 8GB of RAM and eight cores. The complete system code
can be downloaded2.</p>
    </sec>
    <sec id="sec-10">
      <title>Dataset analysis and profiles selection</title>
      <p>The 2,263 profiles from Facebook were selected using the following mechanism: we
select two random profiles from Facebook that have a public friend list, each one of
these two profiles has more than thousand friends. We have crawled these friend lists
and for each user in this list we have extracted from his profile the public life events
published on his timeline and his profile description. For each event, we have
extracted its content and the exact date of publishing.</p>
      <p>In Figure 7, a chart displays the total number of exact screen names matchings from
Twitter that correspond to a unique Facebook profile screen name.
#of profile</p>
      <p>Screen names from Facebook
2 https://github.com/HusseinHESSO/ProfileLinking_v1.0
The maximum number of screen names matches is 18, and only 1,022 screen names
were found on Twitter.</p>
      <p>The maximum number of life events extracted from Facebook for each user is eight
events. The total number of events extracted for each class is shown in table 2. For
each life event, we define the named entity.</p>
    </sec>
    <sec id="sec-11">
      <title>Evaluation Metrics</title>
      <p>To evaluate our system, we use precision as a metric. In addition, we compare our
system to two baseline systems.</p>
      <p>
        With regard to life events, we chose one state-of-the-art system that compares the
behavioural similarity between two user profiles. The system is HYDRA [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]
published in 2014. HYDRA compares also long-term behavioural activity on
largescale datasets. We decide to use HYDRA because it is one of the most relevant and
important contributions in this field.
      </p>
      <p>
        Concerning biographies, we compare our system with systems that rely on profile
attribute information, and prove that even if users do not share public attribute
information, it is possible to link these profiles using biographies. @I seek ‘fb.me’.
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] was the baseline compared with us because it uses a variety of profile attributes,
however, it missing the biography.
      </p>
      <sec id="sec-11-1">
        <title>Precision</title>
        <p>We compare the precision of our system before and after defining entities. Figures 8
and 9 show how that the precision can be enhanced after defining entities using both
the LEBL and DEBL approaches. We compare also the precision of our system with
the baseline approaches, in Figures 10 and 11 and we show that both of our
approaches are highly precise compared to the baselines. All the results shown in the
figures take into account between 10 and 50 user profiles</p>
      </sec>
    </sec>
    <sec id="sec-12">
      <title>Baseline systems comparison</title>
      <sec id="sec-12-1">
        <title>DEBL Baselines</title>
        <p>
          To compare our system with the two baseline systems, we select four random profiles
that can fail to be linked using public attribute-based approaches, and show that they
can be linked using profile descriptions. Table 2 show a set of four random profiles
linked using biographies compared with @I seek ‘fb.me’ [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], providing the Twitter
id and Facebook id of the user (we do not mention the screen names to respect the
privacy of users).
        </p>
        <p>DEBL</p>
        <p>#of
Twitter
profiles
5
studioandrew
rodwell.mupungu
Yes
5
1
As we observe in Table 3, our approach DEBL performs better than baselines. We
can see that the baseline approaches succeed in linking users via image comparison.
However, image matching can be more challenging than text matching. Some of them
can link users via location too. Location can be same for different users. Hence,
biographies can play a vital role when linking users.</p>
      </sec>
      <sec id="sec-12-2">
        <title>LEBL Baselines</title>
        <p>We also compare LEBL to the behavioural approaches. We select four random
profiles, and show that information existing between users’ timelines can vary in
terms of content of posts, timestamps between posts and others. However, if we query
the timeline with a specific type of information (Life events) we can detect that the
two profiles belong to the same user. This can be enhanced in terms of accuracy (life
events cannot be the same for two different users) and lack of activity in one of the
two profiles. In Table 4, we show in detail the analysis of the four different profiles.</p>
        <p>HYDRA
TW(textweets),FB(p
hotos &amp; videos)</p>
        <p>TW(latin
letters),FB(Arabic</p>
        <p>latters)
TW(Last public post</p>
        <p>2015)
FB(last public post 1</p>
        <p>hour ago)
Similar hashtags</p>
        <p>LEBL
Yes
Yes
Yes
Yes
#of TW
profiles
2
1
4
6</p>
      </sec>
    </sec>
    <sec id="sec-13">
      <title>5 Conclusions and Future Works</title>
      <p>In this work, we described SocialMatching++ a novel system that links user profiles
on Facebook to their Twitter accounts, using life events (LEBL) and descriptions
(DEBL). After conducting a comprehensive state-of-the-art on this research problem,
we found that none of the related works has used these two features. We proved that
our approach can achieve promising results. We concluded that even users do not
share similar profile attribute information, such as images, locations; they can be
matched using profile descriptions. Furthermore, users with different timeline
behaviours and content can be matched using life events.</p>
      <p>This work is strongly intended to match the topic of dataset profiling. The two built
datasets can be later used for profiling reasons as a future work, motivating that
dataset profiling in the context of social media is quite novel.</p>
      <p>However, our work still has some limitations. Users are matched only from Facebook
to Twitter, and not vice versa. Life events classification needs a more sophisticated, to
detect more possible number of events on both social networks. As future work, we
are working on enhancing the flexibility of our system. System users can define later
the similarity functions based on their expertise, in addition to the flexibility of
selecting the social network of interest. In order to test the scalability of our approach,
we are working on building large-scale datasets and extend the number of social
network channels (Google+ is under study).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>R.</given-names>
            <surname>Zafarani</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Liu</surname>
          </string-name>
          .
          <article-title>Connecting corresponding identities across communities</article-title>
          .
          <source>ICWSM</source>
          .
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>E.</given-names>
            <surname>Raad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Chbeir</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A. Dipanda.</surname>
          </string-name>
          <article-title>User profile matching in social networks</article-title>
          .
          <source>In NetworkBased Information Systems (NBiS)</source>
          .
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>R.</given-names>
            <surname>Zafarani</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Liu</surname>
          </string-name>
          .
          <article-title>Connecting users across social media sites: A behavioral-modeling approach</article-title>
          . SIGKDD,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>M.</given-names>
            <surname>Motoyama</surname>
          </string-name>
          and
          <string-name>
            <surname>G. Varghese.</surname>
          </string-name>
          <article-title>I seek you: searching and matching individuals in social networks</article-title>
          .
          <source>In WIDM</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>S.</given-names>
            <surname>Bartunov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Korshunov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S-Taek</given-names>
            <surname>Park</surname>
          </string-name>
          , W. Ryu, and
          <string-name>
            <given-names>H.</given-names>
            <surname>Lee</surname>
          </string-name>
          .
          <article-title>Joint link-attribute user identity resolution in online social networks</article-title>
          .
          <source>SNAKDD Workshop</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>J.</given-names>
            <surname>Vosecky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hong</surname>
          </string-name>
          , and
          <string-name>
            <given-names>V.Y.</given-names>
            <surname>Shen</surname>
          </string-name>
          .
          <article-title>User identification across multiple social networks</article-title>
          .
          <source>NDT '09</source>
          .
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>O.</given-names>
            <surname>Goga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. Hari</given-names>
            <surname>Krishnan</surname>
          </string-name>
          , G. Friedland,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sommer</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Teixeir</surname>
          </string-name>
          .
          <article-title>Exploiting Innocuous Activity for Correlating Users Across Sites</article-title>
          .
          <source>WWW Conference</source>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liang</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Zheng</surname>
          </string-name>
          .
          <article-title>Matching User Accounts across Social Networks based on User Message</article-title>
          .
          <source>ICCS</source>
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>O.</given-names>
            <surname>Goga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Loiseau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sommer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Teixeira</surname>
          </string-name>
          and
          <string-name>
            <given-names>K. P.</given-names>
            <surname>Gummadi</surname>
          </string-name>
          .
          <article-title>On the Reliability of Profile Matching Across Large Online Social Networks</article-title>
          .
          <source>KDD</source>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>T. Van Le</surname>
            ,
            <given-names>T. Nghia</given-names>
          </string-name>
          <string-name>
            <surname>Truong</surname>
            and
            <given-names>T. Vu</given-names>
          </string-name>
          <string-name>
            <surname>Pham</surname>
          </string-name>
          .
          <article-title>A Content-Based Approach for User Profile Modeling and Matching on Social Networks</article-title>
          .
          <source>MIWAI</source>
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. P. Jain,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kumaraguru</surname>
          </string-name>
          , Anupam Joshi.
          <article-title>@i seek 'fb.me': identifying users across multiple online social networks</article-title>
          .
          <source>WWW (</source>
          Companion Volume)
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. S. Liu,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Krishnan</surname>
          </string-name>
          . HYDRA:
          <article-title>large-scale social identity linkage via heterogeneous behavior modeling</article-title>
          .
          <source>SIGMOD</source>
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>A.</given-names>
            <surname>Nunes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Calado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Martins</surname>
          </string-name>
          .
          <article-title>Resolving user identities over social networks through supervised learning and rich similarity features</article-title>
          .
          <source>SAC</source>
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jin</surname>
          </string-name>
          .
          <article-title>Controllable Information Sharing for User Accounts Linkage across Multiple Online Social Networks</article-title>
          .
          <source>CIKM</source>
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>O.</given-names>
            <surname>Peled</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fire</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Elovici</surname>
          </string-name>
          .
          <article-title>Matching entities across online social networks</article-title>
          .
          <source>Neurocomputing 210</source>
          .
          <year>2016</year>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>N. Hoang</given-names>
            <surname>Long</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Jung</surname>
          </string-name>
          .
          <article-title>Privacy-Aware Framework for Matching Online Social Identities in Multiple Social Networking Services</article-title>
          .
          <source>Cybernetics and Systems</source>
          <volume>46</volume>
          (
          <issue>1-2</issue>
          )
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>A.</given-names>
            <surname>Panchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Babaev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Obiedkov</surname>
          </string-name>
          .
          <article-title>Large-Scale Parallel Matching of Social Network Profiles</article-title>
          .
          <source>AIST</source>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>N.</given-names>
            <surname>Bennacer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Nana Jipmo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Penta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Quercini</surname>
          </string-name>
          .
          <article-title>Matching User Profiles Across Social Networks</article-title>
          .
          <source>CAiSE</source>
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>W.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Meng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          , Xianchao. GCM:
          <article-title>A Greedy-Based Cross-Matching Algorithm for Identifying Users Across Multiple Online Social Networks</article-title>
          .
          <source>PAISI</source>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>R.</given-names>
            <surname>Roedler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kergl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. Dreo</given-names>
            <surname>Rodosek</surname>
          </string-name>
          .
          <source>Profile Matching Across Online Social Networks Based on Geo-Tags. NaBIC</source>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>O.</given-names>
            <surname>Goga</surname>
          </string-name>
          .
          <article-title>Matching user accounts across online social networks : methods and applications</article-title>
          .
          <source>PhD thesis</source>
          , Pierre and Marie Curie University, Paris, France 2014
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22. L.
          <string-name>
            <surname>Gu</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Baxter</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Vickers</surname>
            , and
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Rainsford</surname>
          </string-name>
          . Record Linkage:
          <article-title>Current Practice and Future Directions</article-title>
          .
          <source>CSIRO 2003</source>
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23. H.
          <string-name>
            <surname>Noureddine</surname>
            , I. Jarkass,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Hazimeh</surname>
            ,
            <given-names>A. Abou</given-names>
          </string-name>
          <string-name>
            <surname>Khaled</surname>
            ,
            <given-names>E. Mugellini.</given-names>
          </string-name>
          <article-title>CARP: Correlation Based Approach for Researcher Profiling</article-title>
          .
          <source>SEKE</source>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24. W. W. Cohen,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ravikumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Fienberg</surname>
          </string-name>
          .
          <article-title>A Comparison of String Distance Metrics for Name-Matching Tasks</article-title>
          .
          <source>IIWeb</source>
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25. P. Jain,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kumaraguru. Other Times</surname>
          </string-name>
          , Other Values:
          <article-title>Leveraging Attribute History to Link User Profiles across Online Social Networks</article-title>
          .
          <source>ACM (HT</source>
          )
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <given-names>D.</given-names>
            <surname>Perito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Castelluccia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Ali</given-names>
            <surname>Kâafar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Manils</surname>
          </string-name>
          .
          <article-title>How Unique and Traceable Are Usernames? Privacy Enhancing Technologies</article-title>
          .
          <source>PETS</source>
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Elmagarmid</surname>
            ,
            <given-names>A. K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ipeirotis</surname>
            ,
            <given-names>P. G.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Verykios</surname>
            ,
            <given-names>V. S.</given-names>
          </string-name>
          <article-title>Duplicate record detection: A survey</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          <volume>19</volume>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>M. Szomszor</surname>
            , I. Cantador,
            <given-names>H.</given-names>
          </string-name>
          <article-title>Alani Correlating user profiles from multiple folksonomies</article-title>
          .
          <source>Hypertext</source>
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29. T. Iofciu,
          <string-name>
            <given-names>P.</given-names>
            <surname>Fankhauser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Abel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bischoff</surname>
          </string-name>
          .
          <source>Identifying Users Across Social Tagging Systems. AAAI</source>
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <given-names>R.</given-names>
            <surname>Nayak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>A Social Matching System for an Online Dating Network: A Preliminary Study</article-title>
          .
          <source>ICDM Workshops 2010</source>
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <given-names>A.</given-names>
            <surname>Krzywicki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wobcke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sok Kim</surname>
          </string-name>
          , Xiongcai Cai,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mahidadia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Compton</surname>
          </string-name>
          .
          <article-title>Collaborative Filtering for people-to-people recommendation in online dating</article-title>
          .
          <source>Int. J. Hum.-Comput. Stud</source>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <given-names>X.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Krzywicki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wobcke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sok Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Compton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mahidadia</surname>
          </string-name>
          .
          <article-title>Learning Collaborative Filtering and Its Application to People to People Recommendation in Social Networks</article-title>
          .
          <source>ICDM</source>
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Breese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Heckerman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. Myers</given-names>
            <surname>Kadie</surname>
          </string-name>
          .
          <article-title>Empirical Analysis of Predictive Algorithms for Collaborative Filtering</article-title>
          .
          <source>UAI</source>
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <given-names>A.</given-names>
            <surname>Malhotra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. C.</given-names>
            <surname>Totti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. Meira</given-names>
            <surname>Jr</surname>
          </string-name>
          .,
          <string-name>
            <surname>Ponnurangam</surname>
            <given-names>Kumaraguru</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Virgílio A. F.</given-names>
            <surname>Almeida</surname>
          </string-name>
          .
          <article-title>Studying User Footprints in Different Online Social Networks</article-title>
          .
          <source>ASONAM</source>
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <given-names>S.</given-names>
            <surname>Vosoughi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Roy</surname>
          </string-name>
          . Digital Stylometry:
          <article-title>Linking Profiles Across Social Networks</article-title>
          .
          <source>Social Informatics - 8th International Conference. SocInfo</source>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>G. Sujatha Das</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Kardes</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Person-Name Parsing for Linking User Web Profiles</article-title>
          .
          <source>WebDB 2015</source>
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <surname>M-Yen Kan</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Liu</surname>
          </string-name>
          , S. Ma.
          <article-title>Online Social Network Profile Linkage</article-title>
          .
          <source>AIRS 2014</source>
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38. H.
          <string-name>
            <surname>Kopcke</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Rahm</surname>
          </string-name>
          .
          <article-title>Frameworks for entity matching: A comparison</article-title>
          .
          <source>Data and Knowledge Engineering</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Thomas</surname>
            <given-names>Dickinson</given-names>
          </string-name>
          , Miriam Fernández, Lisa A. Thomas, Paul Mulholland, Pam Briggs, Harith Alani:
          <article-title>Automatic Identification of Personal Life Events in Twitter</article-title>
          .
          <source>WebSci 2015</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>