Dergi makalesi Açık Erişim

Identifying multiple social network accounts belonging to the same users

Mungen, Ahmet Anil; Gundogan, Esra; Kaya, Mehmet


MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Gundogan, Esra</subfield>
    <subfield code="u">Firat Univ, Dept Comp Engn, TR-23119 Elazig, Turkey</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Kaya, Mehmet</subfield>
    <subfield code="u">Firat Univ, Dept Comp Engn, TR-23119 Elazig, Turkey</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">SOCIAL NETWORK ANALYSIS AND MINING</subfield>
    <subfield code="v">11</subfield>
    <subfield code="n">1</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1007/s13278-021-00736-0</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Identifying multiple social network accounts belonging to the same users</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Mungen, Ahmet Anil</subfield>
    <subfield code="u">Ostim Tech Univ, Dept Software Engn, TR-06374 Ankara, Turkey</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:aperta.ulakbim.gov.tr:237378</subfield>
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="2">opendefinition.org</subfield>
    <subfield code="a">cc-by</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2021-01-01</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/237378/files/bib-d79b4b43-7a9e-436a-9551-4a66ba01536b.txt</subfield>
    <subfield code="z">md5:2d2d92f172e9eb0ad13be734f1f406cb</subfield>
    <subfield code="s">160</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <controlfield tag="005">20221007095447.0</controlfield>
  <controlfield tag="001">237378</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Social networks used for different purposes by users contain different user data. Finding same users' accounts in different social networks and compiling the data found in a single repository will be a very important factor that will both improve the recommended systems and increase the user experience. The aim of this study is to collect the data of thousands of users in nine different social networks and to find the same users in these networks. For this purpose, the novel node alignment and node similarity methods were proposed in the study. While using the anchor method for topological-based node proposition, density relationships between connections are also taken into account. In the node similarity method, the number of successful node matching was increased with attribute selection criteria and initial state selection method we proposed. However, in this study, alignment and similarity were determined both according to users' profile characteristics and their relationship with other users. Nine different methods have been proposed for finding the same accounts on different social networks. The proposed methods were tested on the data of two to six social networks, and users' match success rates were measured. The results showed success rates of up to 95%. This enabled the creation of a wide user profile covering multiple social networks for users whose different attributes are gathered on the same graph in multiple social networks.</subfield>
  </datafield>
</record>
20
3
görüntülenme
indirilme
Görüntülenme 20
İndirme 3
Veri hacmi 480 Bytes
Tekil görüntülenme 20
Tekil indirme 3

Alıntı yap