Propagation of trust and distrust for the detection of trolls in a social network
Trust and Reputation Systems constitute an essential part of many social networks due to the great expansion of these on-line communities in the past few years. As a consequence of this growth, some users try to disturb the normal atmosphere of these communities, or even to take advantage of them in...
Gespeichert in:
Veröffentlicht in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2012-08, Vol.56 (12), p.2884-2895 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 2895 |
---|---|
container_issue | 12 |
container_start_page | 2884 |
container_title | Computer networks (Amsterdam, Netherlands : 1999) |
container_volume | 56 |
creator | Ortega, F. Javier Troyano, José A. Cruz, Fermín L. Vallejo, Carlos G. Enríquez, Fernando |
description | Trust and Reputation Systems constitute an essential part of many social networks due to the great expansion of these on-line communities in the past few years. As a consequence of this growth, some users try to disturb the normal atmosphere of these communities, or even to take advantage of them in order to obtain some kind of benefits. Therefore, the concept of trust is a key point in the performance of on-line systems such as on-line marketplaces, review aggregators, social news sites, and forums. In this work we propose a method to compute a ranking of the users in a social network, regarding their trustworthiness. The aim of our method is to prevent malicious users from illicitly gaining high reputation in the network by demoting them in the ranking of users. We propose a novel system intended to propagate both positive and negative opinions of the users through a network, in such way that the opinions from each user about others influence their global trust score. Our proposal has been evaluated in different challenging situations. The experiments include the generation of random graphs, the use of a real-world dataset extracted from a social news site, and a combination of both a real dataset and generation techniques, in order to test our proposals in different environments. The results show that our method performs well in every situations, showing the propagation of trust and distrust to be a reliable mechanism in a Trust and Reputation System. |
doi_str_mv | 10.1016/j.comnet.2012.05.002 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1081858149</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S138912861200179X</els_id><sourcerecordid>1081858149</sourcerecordid><originalsourceid>FETCH-LOGICAL-c446t-be596e7e93398307df7bdfd96832b3a8e8761acf51b2b7e2906d59c77793343f3</originalsourceid><addsrcrecordid>eNqNkU1LJDEQhoMoOI7-Aw8BL3vpNl_dSS7CIrsqCCroOaSTas3Y05lNehT__WZoYcHD4qmq4Hnr60XolJKaEtqer2oX1yNMNSOU1aSpCWF7aEGVZJUkrd4vOVe6oky1h-go5xUhRAimFujhPsWNfbZTiCOOPZ7SNk_Yjh77kOeijwlPL4A9TOD-cXEYMg4jtjhHF-yAywLvMb0eo4PeDhlOPuMSPf3-9Xh5Xd3eXd1c_rytnBDtVHXQ6BYkaM614kT6Xna-97pVnHXcKlCypdb1De1YJ4Fp0vpGOyllUQje8yX6MffdpPhnC3ky65AdDIMdIW6zoURR1Sgq9DdQrpiWosxeorMv6Cpu01gOKRQTikhS6CUSM-VSzDlBbzYprG36KJDZWWJWZrbE7CwxpDHFkiK7mGVQ_vIWIJnsAowOfEjltcbH8P8GfwGAopVf</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1024807010</pqid></control><display><type>article</type><title>Propagation of trust and distrust for the detection of trolls in a social network</title><source>Elsevier ScienceDirect Journals</source><creator>Ortega, F. Javier ; Troyano, José A. ; Cruz, Fermín L. ; Vallejo, Carlos G. ; Enríquez, Fernando</creator><creatorcontrib>Ortega, F. Javier ; Troyano, José A. ; Cruz, Fermín L. ; Vallejo, Carlos G. ; Enríquez, Fernando</creatorcontrib><description>Trust and Reputation Systems constitute an essential part of many social networks due to the great expansion of these on-line communities in the past few years. As a consequence of this growth, some users try to disturb the normal atmosphere of these communities, or even to take advantage of them in order to obtain some kind of benefits. Therefore, the concept of trust is a key point in the performance of on-line systems such as on-line marketplaces, review aggregators, social news sites, and forums. In this work we propose a method to compute a ranking of the users in a social network, regarding their trustworthiness. The aim of our method is to prevent malicious users from illicitly gaining high reputation in the network by demoting them in the ranking of users. We propose a novel system intended to propagate both positive and negative opinions of the users through a network, in such way that the opinions from each user about others influence their global trust score. Our proposal has been evaluated in different challenging situations. The experiments include the generation of random graphs, the use of a real-world dataset extracted from a social news site, and a combination of both a real dataset and generation techniques, in order to test our proposals in different environments. The results show that our method performs well in every situations, showing the propagation of trust and distrust to be a reliable mechanism in a Trust and Reputation System.</description><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/j.comnet.2012.05.002</identifier><identifier>CODEN: CNETDP</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Communities ; Graph theory ; Graphs ; Information systems ; Methods ; Networks ; News ; On-line systems ; Propagation ; Proposals ; Ranking ; Ranking algorithms ; Reputations ; Social networks ; Studies ; Trust ; Trust and Reputation Systems</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 2012-08, Vol.56 (12), p.2884-2895</ispartof><rights>2012 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Aug 2012</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c446t-be596e7e93398307df7bdfd96832b3a8e8761acf51b2b7e2906d59c77793343f3</citedby><cites>FETCH-LOGICAL-c446t-be596e7e93398307df7bdfd96832b3a8e8761acf51b2b7e2906d59c77793343f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S138912861200179X$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3536,27903,27904,65309</link.rule.ids></links><search><creatorcontrib>Ortega, F. Javier</creatorcontrib><creatorcontrib>Troyano, José A.</creatorcontrib><creatorcontrib>Cruz, Fermín L.</creatorcontrib><creatorcontrib>Vallejo, Carlos G.</creatorcontrib><creatorcontrib>Enríquez, Fernando</creatorcontrib><title>Propagation of trust and distrust for the detection of trolls in a social network</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>Trust and Reputation Systems constitute an essential part of many social networks due to the great expansion of these on-line communities in the past few years. As a consequence of this growth, some users try to disturb the normal atmosphere of these communities, or even to take advantage of them in order to obtain some kind of benefits. Therefore, the concept of trust is a key point in the performance of on-line systems such as on-line marketplaces, review aggregators, social news sites, and forums. In this work we propose a method to compute a ranking of the users in a social network, regarding their trustworthiness. The aim of our method is to prevent malicious users from illicitly gaining high reputation in the network by demoting them in the ranking of users. We propose a novel system intended to propagate both positive and negative opinions of the users through a network, in such way that the opinions from each user about others influence their global trust score. Our proposal has been evaluated in different challenging situations. The experiments include the generation of random graphs, the use of a real-world dataset extracted from a social news site, and a combination of both a real dataset and generation techniques, in order to test our proposals in different environments. The results show that our method performs well in every situations, showing the propagation of trust and distrust to be a reliable mechanism in a Trust and Reputation System.</description><subject>Algorithms</subject><subject>Communities</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Information systems</subject><subject>Methods</subject><subject>Networks</subject><subject>News</subject><subject>On-line systems</subject><subject>Propagation</subject><subject>Proposals</subject><subject>Ranking</subject><subject>Ranking algorithms</subject><subject>Reputations</subject><subject>Social networks</subject><subject>Studies</subject><subject>Trust</subject><subject>Trust and Reputation Systems</subject><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNqNkU1LJDEQhoMoOI7-Aw8BL3vpNl_dSS7CIrsqCCroOaSTas3Y05lNehT__WZoYcHD4qmq4Hnr60XolJKaEtqer2oX1yNMNSOU1aSpCWF7aEGVZJUkrd4vOVe6oky1h-go5xUhRAimFujhPsWNfbZTiCOOPZ7SNk_Yjh77kOeijwlPL4A9TOD-cXEYMg4jtjhHF-yAywLvMb0eo4PeDhlOPuMSPf3-9Xh5Xd3eXd1c_rytnBDtVHXQ6BYkaM614kT6Xna-97pVnHXcKlCypdb1De1YJ4Fp0vpGOyllUQje8yX6MffdpPhnC3ky65AdDIMdIW6zoURR1Sgq9DdQrpiWosxeorMv6Cpu01gOKRQTikhS6CUSM-VSzDlBbzYprG36KJDZWWJWZrbE7CwxpDHFkiK7mGVQ_vIWIJnsAowOfEjltcbH8P8GfwGAopVf</recordid><startdate>20120816</startdate><enddate>20120816</enddate><creator>Ortega, F. Javier</creator><creator>Troyano, José A.</creator><creator>Cruz, Fermín L.</creator><creator>Vallejo, Carlos G.</creator><creator>Enríquez, Fernando</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20120816</creationdate><title>Propagation of trust and distrust for the detection of trolls in a social network</title><author>Ortega, F. Javier ; Troyano, José A. ; Cruz, Fermín L. ; Vallejo, Carlos G. ; Enríquez, Fernando</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c446t-be596e7e93398307df7bdfd96832b3a8e8761acf51b2b7e2906d59c77793343f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithms</topic><topic>Communities</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Information systems</topic><topic>Methods</topic><topic>Networks</topic><topic>News</topic><topic>On-line systems</topic><topic>Propagation</topic><topic>Proposals</topic><topic>Ranking</topic><topic>Ranking algorithms</topic><topic>Reputations</topic><topic>Social networks</topic><topic>Studies</topic><topic>Trust</topic><topic>Trust and Reputation Systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ortega, F. Javier</creatorcontrib><creatorcontrib>Troyano, José A.</creatorcontrib><creatorcontrib>Cruz, Fermín L.</creatorcontrib><creatorcontrib>Vallejo, Carlos G.</creatorcontrib><creatorcontrib>Enríquez, Fernando</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ortega, F. Javier</au><au>Troyano, José A.</au><au>Cruz, Fermín L.</au><au>Vallejo, Carlos G.</au><au>Enríquez, Fernando</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Propagation of trust and distrust for the detection of trolls in a social network</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>2012-08-16</date><risdate>2012</risdate><volume>56</volume><issue>12</issue><spage>2884</spage><epage>2895</epage><pages>2884-2895</pages><issn>1389-1286</issn><eissn>1872-7069</eissn><coden>CNETDP</coden><abstract>Trust and Reputation Systems constitute an essential part of many social networks due to the great expansion of these on-line communities in the past few years. As a consequence of this growth, some users try to disturb the normal atmosphere of these communities, or even to take advantage of them in order to obtain some kind of benefits. Therefore, the concept of trust is a key point in the performance of on-line systems such as on-line marketplaces, review aggregators, social news sites, and forums. In this work we propose a method to compute a ranking of the users in a social network, regarding their trustworthiness. The aim of our method is to prevent malicious users from illicitly gaining high reputation in the network by demoting them in the ranking of users. We propose a novel system intended to propagate both positive and negative opinions of the users through a network, in such way that the opinions from each user about others influence their global trust score. Our proposal has been evaluated in different challenging situations. The experiments include the generation of random graphs, the use of a real-world dataset extracted from a social news site, and a combination of both a real dataset and generation techniques, in order to test our proposals in different environments. The results show that our method performs well in every situations, showing the propagation of trust and distrust to be a reliable mechanism in a Trust and Reputation System.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.comnet.2012.05.002</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1389-1286 |
ispartof | Computer networks (Amsterdam, Netherlands : 1999), 2012-08, Vol.56 (12), p.2884-2895 |
issn | 1389-1286 1872-7069 |
language | eng |
recordid | cdi_proquest_miscellaneous_1081858149 |
source | Elsevier ScienceDirect Journals |
subjects | Algorithms Communities Graph theory Graphs Information systems Methods Networks News On-line systems Propagation Proposals Ranking Ranking algorithms Reputations Social networks Studies Trust Trust and Reputation Systems |
title | Propagation of trust and distrust for the detection of trolls in a social network |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T17%3A13%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Propagation%20of%20trust%20and%20distrust%20for%20the%20detection%20of%20trolls%20in%20a%20social%20network&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Ortega,%20F.%20Javier&rft.date=2012-08-16&rft.volume=56&rft.issue=12&rft.spage=2884&rft.epage=2895&rft.pages=2884-2895&rft.issn=1389-1286&rft.eissn=1872-7069&rft.coden=CNETDP&rft_id=info:doi/10.1016/j.comnet.2012.05.002&rft_dat=%3Cproquest_cross%3E1081858149%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1024807010&rft_id=info:pmid/&rft_els_id=S138912861200179X&rfr_iscdi=true |