<!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>An integrated approach to mapping user profiles on social networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vladimir Belov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ilya Andreev Information Systems department, Faculty of Information Systems and Technologies Ulyanovsk State Technical University Ulyanovsk</institution>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Information Systems department, Faculty of Information Systems and Technologies Ulyanovsk State Technical University Ulyanovsk</institution>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <fpage>225</fpage>
      <lpage>228</lpage>
      <abstract>
        <p>-In this paper, we consider an integrated approach for the sole identification of a person in several different social networks by analyzing the questionnaire data, poorly structured information and images comparison from the profiles of social networks. Also the paper contains the description of the software service that implements the proposed approach.</p>
      </abstract>
      <kwd-group>
        <kwd>social network</kwd>
        <kwd>account</kwd>
        <kwd>search</kwd>
        <kwd>mapping</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>I. INTRODUCTION</p>
      <p>
        The active growth of the audience of social networks has
led to the emergence of these resources as a new source of data
and knowledge. In Russia, several social networks are
currently the most popular, each of which has its own focus
and specificity of the content posted. Such resources include
VKontakte, Odnoklassniki, Instagram, Facebook, Youtube,
Twitter[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Many users have several accounts on different
social networks and publish different or similar content to
them. And to find a person in any of the networks becomes
problematic.
      </p>
      <p>Working with social networks can be beneficial in
implementing the functions of the company’s personnel
management system, as you can often find out much more
information about the professional and personal qualities of
the applicant from social networks than from the CV.
Currently, the collection or meaningful analysis of
information from social networks is carried out manually by
specialists of personnel services, which is time consuming and
limits the amount of information processed.</p>
      <p>Thus, there is a need to develop a software system that
allows you to identify a person’s profile in several social
networks. Such developments would allow aggregating more
data about users to assess the severity of their personal
characteristics. This work is aimed at solving the problem of
searching for an integrated approach for mapping (comparing)
user profiles in various social networks based on the analysis
of structured data, text information, as well as graphic
materials for the purpose of further analysis of the user's social
portrait.
II. THE MAIN APPROACHES TO SOLVING THE PROBLEM OF</p>
      <p>
        Currently, the task of identifying users using data profiles
of social networks is solved in various ways [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ].
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref4 ref5 ref6 ref7">4, 5, 6, 7, 8</xref>
        ], methods for analyzing data profiles of the
social networks MySpace, StudiVZ are described. But these
networks are not popular in Russia. The proposed approaches
consist in constructing feature vectors of user characteristics
based on the information provided on personal pages. To the
obtained vectors, methods of exact, partial and fuzzy
comparison are applied. In these works, the authors proposed
features that are most significant when comparing accounts.
The developed algorithms the accuracy of about 80% on a test
sample of user accounts.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref5 ref6 ref8">6, 7, 9</xref>
        ], methods for mapping user profiles of social
networks by analyzing published unstructured (text)
information are presented. In [
        <xref ref-type="bibr" rid="ref5">6</xref>
        ], the authors conclude that the
creator of a text note can be identified by a unique writing
style. In [
        <xref ref-type="bibr" rid="ref6">7</xref>
        ], a method is shown that takes into account not
only text information published by a user in a note, but also
meta-information associated with it: geolocation, publication
time, hashtags, etc.
      </p>
      <p>B. Software services for searching users in social networks</p>
      <p>Currently, there are several services for searching for
profiles of people in social networks in RuNet. Most services
work on the principle of conventional search engines
download all available open profile data and save it to a local
database.</p>
      <p>
        FindFace [
        <xref ref-type="bibr" rid="ref9">10</xref>
        ]. One of these services is the FindFace
system, as well as many other systems based on it, which
allow you to find a person’s profile on a social network from
their photo. To start the search, you need to select a photo
where the human face is clearly visible, and upload the
picture. The algorithm will find pages with similar photos and
lay out links to them with examples of images. Each link will
have a rating from 0 to 1. If the indicator is more than 0.67,
then this means that the system recorded the most complete
match. The developed neural network scanned the faces of
500 million users of the VKontakte social network.
max

where is the number of pairwise matching lemmas, 1,
2 - the number of lemmas in lines 1 and 2, respectively.
If the value of this criterion is more than 0.85, then the
lines are considered similar.
      </p>
      <p>
        Criteria for the presence of similar posts. Two metrics
were used to compare text notes. The first is finding
the Levenshtein distance (editorial distance, editing
distance)[
        <xref ref-type="bibr" rid="ref11 ref12">12, 13</xref>
        ] - the minimum number of operations
to insert one character, delete one character and
replace one character with another, necessary to turn
one line into another. As a second method for finding
similar posts, the shingles algorithm was
implemented [
        <xref ref-type="bibr" rid="ref13">14</xref>
        ]. This algorithm works on the
principle of splitting text into shingles, computing
hashes of data of shingles, pairwise comparison of
hashes. The following metric was used for the shingle
method:






where  is the number of matching hashs of shingles, ,
 - the number of shingles in the first and second row,
respectively.
      </p>
      <p>A visual representation of the shingle algorithm is shown in
Figure 1.</p>
      <p>
        Yandex.People [
        <xref ref-type="bibr" rid="ref10">11</xref>
        ]. The Yandex.People system uses text
data obtained from social network profiles to search. So the
following data is uploaded from the profiles of a person:
Name of the user (or at least one of the parameters
allowing to identify the person).
      </p>
    </sec>
    <sec id="sec-2">
      <title>Age of user.</title>
    </sec>
    <sec id="sec-3">
      <title>Place of residence or user address.</title>
    </sec>
    <sec id="sec-4">
      <title>Place of study or completed education.</title>
    </sec>
    <sec id="sec-5">
      <title>User’s place of work.</title>
      <p>Despite the availability of these services that solve specific
tasks of searching for users of social networks, there are
currently no comprehensive approaches and universal services
that allow users to compare user profiles in various social
networks by analyzing not only the data of profiles, but also
poorly structured information from the pages of the respective
accounts.</p>
      <p>III. APPROACH TO MAPPING USER PROFILES ON SOCIAL</p>
      <p>NETWORKS</p>
      <p>The developed algorithm takes as a basis a person’s
personal page from a social network. Different information is
downloaded and is used for further search and comparison of
the profile in various social networks. At the current stage, the
following data is used:</p>
      <p>First name, middle name of the user;

















</p>
    </sec>
    <sec id="sec-6">
      <title>Date of Birth;</title>
    </sec>
    <sec id="sec-7">
      <title>Place of residence;</title>
    </sec>
    <sec id="sec-8">
      <title>Place of Birth;</title>
    </sec>
    <sec id="sec-9">
      <title>Friends;</title>
    </sec>
    <sec id="sec-10">
      <title>Text notes (posts);</title>
    </sec>
    <sec id="sec-11">
      <title>Place of work;</title>
    </sec>
    <sec id="sec-12">
      <title>Place of study;</title>
    </sec>
    <sec id="sec-13">
      <title>Contacts, email, phone number;</title>
    </sec>
    <sec id="sec-14">
      <title>Profile avatar, as well as profile photos.</title>
      <p>This information is downloaded, both for the original
profile, and for the desired profiles in other social networks.
The loaded profile data is mapped to the source profile data.
Since there can be several profiles found, they are sorted
according to the following criteria:</p>
      <p>Criteria for the presence of similar faces in
photographs. Using the HOG method, people are
found in photographs and their vector representation
is generated. Subsequently, the Euclidean norms of
the vectors are compared.</p>
      <p>The criterion for the presence of similar contacts.
Profiles containing links to each other are very likely
to belong to the same person.</p>
      <p>The criterion for a similar place of work and place of
study. To calculate this indicator, the strings are
preprocessed: they are cleared of punctuation, reduced to
lower case. After that, the lines are lemmatized, and
using the obtained lemmas, the lines are compared
according to the following metric:</p>
      <p>Criteria for having similar friends. This indicator is
calculated by pairwise comparison of the names of
friends. The more matches, the higher the profile in
the final search results.</p>
      <p>IV. IMPLEMENTATION OF A SOFTWARE SYSTEM FOR MAPPING</p>
      <p>USER PROFILES ON SOCIAL NETWORKS</p>
      <p>To test the effectiveness of the proposed approach, a
software system for mapping user profiles on social networks
was implemented. The developed system is a client-server
application, where the server is a Java web service developed
using the Spring Boot software platform.</p>
      <p>
        The system integrates with the three most popular social
networks in the CIS: Vkontakte [
        <xref ref-type="bibr" rid="ref14">15</xref>
        ], Odnoklassniki [
        <xref ref-type="bibr" rid="ref15">16</xref>
        ] and
Facebook [
        <xref ref-type="bibr" rid="ref16">17</xref>
        ]. Data from the VKontakte social network is
downloaded through the integration with VK API. Data from
the Odnoklassniki and Facebook is downloaded by parsing the
desktop and mobile versions of the website of the respective
networks.
      </p>
      <p>
        A web service containing an application in python has also
been developed. This service, using the DLIB library [
        <xref ref-type="bibr" rid="ref17">18</xref>
        ],
forms a vector representation for user photos.
Fig. 2. System architecture.
      </p>
      <p>As can be seen from the figure, the system consists of two
server applications:</p>
      <p>There is also a React App client application. Spring Boot
App contains the basic logic of the system, as well as data
loaders from social networks:</p>
    </sec>
    <sec id="sec-15">
      <title>Spring Boot App [19],</title>
    </sec>
    <sec id="sec-16">
      <title>Flask App [20]</title>
    </sec>
    <sec id="sec-17">
      <title>VK Api Loader,</title>
    </sec>
    <sec id="sec-18">
      <title>Facebook loader,</title>
    </sec>
    <sec id="sec-19">
      <title>OK loader</title>
      <p>



</p>
      <p>The Flask App contains methods for recognizing faces in
photographs using the DLIB library. H2 Database is used to
store some non-confidential data. An example of such data is
the id of cities and countries from the VK API.</p>
      <p>An example of the system interface is shown in Figure 3.</p>
      <p>As input, the system accepts a link to a profile in one of
the social networks. From this profile, all possible data about
a person is loaded, and according to these data a single model
of the desired profile is formed. Similar profiles are searched
by searching for fields loaded from the original profile. Based
on loaded similar profiles, a rating is formed, according to
which sorting subsequently occurs.</p>
      <p>Similar profiles are sorted by the received rating and
displayed on a web-form.</p>
      <p>The page displays the selected profiles, and on the left
there is an application menu.</p>
    </sec>
    <sec id="sec-20">
      <title>V. EXPERIMENT RESULTS</title>
      <p>A pre-prepared sample of 100 users with profiles in
various social networks was used as an experimental base. All
these users had 204 accounts, since not all of them had
accounts in all networks at once. For each of these accounts,
we tried to find similar ones using the developed service. As a
result of the experiments, the diagram shown in Figure 4 was
compiled.</p>
      <p>On the diagram you can see that the system coped best
with finding profiles on the VK social network, and worst of
all, Facebook. This is due to the convenience of extracting
data from relevant resources. VK API allows you to quickly
extract large amounts of data, which increases the quality of
recognition, while parsing other networks consumes many
resources, which forces to limit the amount of data retrieved.</p>
      <p>The results for the profile comparison criteria were also
calculated, the result is shown in Figure 5.</p>
      <p>On the diagram you can see that in all cases the system
managed to find at least one common friend. The results of the
coincidence of other criteria are much smaller. Twice worse,
the system managed to find common educational institutions
and common places of work. This is due to the fact that users
do not always indicate these characteristics on their pages.
Also, often the format of the specified data does not allow to
correctly compare them. Even less, the system coped with
finding common faces in photos. This is due to many factors,
such as, for example, the accuracy of the model itself, the
quality and number of photos uploaded. Only a third of the
experiments managed to find common posts on the pages.
This is due to the fact that users do not always fill pages with
the same posts. Cross-references to profiles were found least
of all, as users provide such information less often.</p>
      <p>CONCLUSION</p>
      <p>Thus, within the framework of this work, an integrated
approach was proposed to find user profiles in different social
networks by analyzing not only the data of profiles, but also
poorly structured information from the pages of the respective
accounts, as well as graphic information.</p>
      <p>As a result of the work done, a software system was
developed that performs the function of searching and
mapping similar profiles on social networks. The application
can be used as a personnel search platform. The proposed
methodology lays the foundation for further work on
conducting relevant experiments, developing new algorithms
for searching, comparing, analyzing, and building a portrait of
a user based on open data about they.</p>
      <p>ACKNOWLEDGMENT</p>
      <p>This work was supported by the Foundation for Assistance
to the Development of Small Forms of Enterprises in the
Scientific and Technical Sphere within the framework of the
project "Development, technical implementation and testing
of a prototype platform for the formation of a social portrait of
an applicant based on intelligent data retrieval in social
networks using the principles of knowledge engineering" of
Agreement No. 60GS1CTS10-D5 / 56043 from 06.02.2020.</p>
      <p>M. Motoyama and G. Varghese, "I seek you: searching and matching
individuals in social networks," Proceedings of the eleventh
international workshop on Web information and data management,
2009.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>I.</given-names>
            <surname>Rytsarev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kirsh</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Kupriyanov</surname>
          </string-name>
          , “
          <article-title>Clustering of media content from social networks using bigdata technology,"</article-title>
          <source>Computer Optics</source>
          , vol.
          <volume>42</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>921</fpage>
          -
          <lpage>927</lpage>
          ,
          <year>2018</year>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>2412</fpage>
          -6179-2018-42-5-
          <fpage>921</fpage>
          -927.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Filippov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Moshkin</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Yarushkina</surname>
          </string-name>
          , “
          <article-title>Development of a Software for the Semantic Analysis of Social Media Content,” Recent Research in Control Engineering and Decision Making. Studies in Systems, Decision and Control</article-title>
          , vol
          <volume>199</volume>
          , pp.
          <fpage>421</fpage>
          -
          <lpage>432</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>N.</given-names>
            <surname>Yarushkina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Filippov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Moshkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Guskov</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Romanov</surname>
          </string-name>
          , “
          <article-title>Intelligent Instrumentation for Opinion Mining in Social Media,” Proceedings of the II International Scientific and Practical Conference Fuzzy Technologies in the Industry</article-title>
          , Ulyanovsk, Russia, pp.
          <fpage>50</fpage>
          -
          <lpage>55</lpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gaewon</surname>
          </string-name>
          ,
          <article-title>"Enhancing Entity Search with Social Network Matching,"</article-title>
          <source>EDBT/ICDT: Proceedings of the 14th International Conference on Extending Database Technology</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>E</given-names>
            <surname>Raad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Chbeir</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Dipanda</surname>
          </string-name>
          ,
          <article-title>"User profile matching in social networks,"</article-title>
          <source>13th International Conference on Network-Based Information Systems</source>
          , IEEE,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [7]
          <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," 1 international conference on networked digital technologies</article-title>
          , IEEE,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [8]
          <string-name>
            <surname>I. Veldman</surname>
          </string-name>
          , “
          <article-title>Matching Profiles from Social Network Sites,” Master's thesis</article-title>
          , University of Twente,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>N.</given-names>
            <surname>Yarushkina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Filippov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Moshkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Namestnikov</surname>
          </string-name>
          and G. Guskov, “
          <article-title>The social portrait building of a social network user based on semi-structured data analysis</article-title>
          ,
          <source>” CEUR Workshop Proceedings</source>
          , vol.
          <volume>2475</volume>
          , pp.
          <fpage>119</fpage>
          -
          <lpage>129</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>[10] FindFace [Online]. URL: https://findface.pro.</mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Yandex</surname>
          </string-name>
          .People [Online]. URL: https://yandex.ru/people.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>V.</given-names>
            <surname>Chernenkyi</surname>
          </string-name>
          and Yu. Gapanyuk, “
          <article-title>Passenger identification technique based on installation data,”</article-title>
          <source>Engineering Journal: Science and Innovation</source>
          , vol.
          <volume>3</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>3</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>D.V.</given-names>
            <surname>Mikhailov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.P.</given-names>
            <surname>Kozlov and G.M. Emelyanov</surname>
          </string-name>
          , “
          <article-title>An approach based on analysis of n-grams on links of words to extract the knowledge and relevant linguistic means on subject-oriented text sets</article-title>
          ,”
          <source>Computer Optics</source>
          , vol.
          <volume>41</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>461</fpage>
          -
          <lpage>471</lpage>
          ,
          <year>2017</year>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>2412</fpage>
          -6179-2017-41-3-
          <fpage>461</fpage>
          -471.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Tsimbalov</surname>
          </string-name>
          and
          <string-name>
            <given-names>O.</given-names>
            <surname>Zolotarev</surname>
          </string-name>
          , “
          <article-title>The method of shingles,” Vestnik of the russian new university</article-title>
          . Series:
          <article-title>Complex systems: models, analysis and management</article-title>
          , vol.
          <volume>4</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>72</fpage>
          -
          <lpage>79</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Vkontakte</surname>
          </string-name>
          [Online]. URL: https://vk.com,
          <source>last accessed</source>
          <year>2020</year>
          /05/11.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Odnoklassniki</surname>
          </string-name>
          [Online]. URL: https://ok.ru/.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Facebook</surname>
          </string-name>
          [Online]. URL: https://www.facebook.com.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [18]
          <article-title>DLIB library [Online]</article-title>
          . URL: http://dlib.net/.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Spring</given-names>
            <surname>Boot App</surname>
          </string-name>
          [Online]. URL: https://spring.io/projects/spring-boot.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Flask</surname>
            <given-names>App</given-names>
          </string-name>
          [Online]. URL: https://flask.palletsprojects.
          <source>com/en/1</source>
          .1.x /quickstart/.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>