File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Quantifying Trust Dynamics In Signed Graphs, The S-cores Approach

TitleQuantifying Trust Dynamics In Signed Graphs, The S-cores Approach
Authors
Keywordsgraph mining
trust networks
graph degeneracy
signed networks
Issue Date2014
PublisherSociety for Industrial and Applied Mathematics (SIAM).
Citation
The SIAM International Conference on Data Mining, Philadelphia, Pennsylvania, USA, 24-26 April, 2014. In the Proceedings of the SIAM International Conference on Data Mining, 2014, p. 668-676 How to Cite?
AbstractLately, there has been an increased interest in signed networks with applications in trust, security, or social computing. This paper focuses on the issue of defining models and metrics for reciprocity in signed graphs. In unsigned directed networks, reciprocity quantifies the predisposition of network members in creating mutual connections. On the other hand, this concept has not yet been investigated in the case of signed graphs. We capitalize on the graph degeneracy concept to identify subgraphs of the signed network in which reciprocity is more likely to occur. This enables us to assess reciprocity at a global level, rather than at an exclusively local one as in existing approaches. The large scale experiments we perform on real world data sets of trust networks lead to both interesting and intuitive results. We believe these reciprocity measures can be used in various social applications such as trust management, community detection and evaluation of individual nodes. The global reciprocity we define in this paper is closely correlated to the clustering structure of the graph, more than the local reciprocity as it is indicated by the experimental evaluation we conducted.
DescriptionThe paper can be viewed at: http://epubs.siam.org/doi/pdf/10.1137/1.9781611973440.77
Persistent Identifierhttp://hdl.handle.net/10722/201107
ISBN

 

DC FieldValueLanguage
dc.contributor.authorGiatsidis, Cen_US
dc.contributor.authorCautis, Ben_US
dc.contributor.authorManiu, Sen_US
dc.contributor.authorThilikos, Den_US
dc.contributor.authorVazirigiannis, Men_US
dc.date.accessioned2014-08-21T07:13:35Z-
dc.date.available2014-08-21T07:13:35Z-
dc.date.issued2014en_US
dc.identifier.citationThe SIAM International Conference on Data Mining, Philadelphia, Pennsylvania, USA, 24-26 April, 2014. In the Proceedings of the SIAM International Conference on Data Mining, 2014, p. 668-676en_US
dc.identifier.isbn9781611973440-
dc.identifier.urihttp://hdl.handle.net/10722/201107-
dc.descriptionThe paper can be viewed at: http://epubs.siam.org/doi/pdf/10.1137/1.9781611973440.77-
dc.description.abstractLately, there has been an increased interest in signed networks with applications in trust, security, or social computing. This paper focuses on the issue of defining models and metrics for reciprocity in signed graphs. In unsigned directed networks, reciprocity quantifies the predisposition of network members in creating mutual connections. On the other hand, this concept has not yet been investigated in the case of signed graphs. We capitalize on the graph degeneracy concept to identify subgraphs of the signed network in which reciprocity is more likely to occur. This enables us to assess reciprocity at a global level, rather than at an exclusively local one as in existing approaches. The large scale experiments we perform on real world data sets of trust networks lead to both interesting and intuitive results. We believe these reciprocity measures can be used in various social applications such as trust management, community detection and evaluation of individual nodes. The global reciprocity we define in this paper is closely correlated to the clustering structure of the graph, more than the local reciprocity as it is indicated by the experimental evaluation we conducted.-
dc.languageengen_US
dc.publisherSociety for Industrial and Applied Mathematics (SIAM).en_US
dc.relation.ispartofProceedings of the 2014 SIAM International Conference on Data Miningen_US
dc.subjectgraph mining-
dc.subjecttrust networks-
dc.subjectgraph degeneracy-
dc.subjectsigned networks-
dc.titleQuantifying Trust Dynamics In Signed Graphs, The S-cores Approachen_US
dc.typeConference_Paperen_US
dc.identifier.emailManiu, S: smaniu@cs.hku.hken_US
dc.identifier.doi10.1137/1.9781611973440.77-
dc.identifier.hkuros232986en_US
dc.identifier.spage668-
dc.identifier.epage676-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats