Propagation of Trust and Distrust R Guha R

Propagation of Trust and Distrust R. Guha, R. Kumar, P. Raghavan and A. Tomkins New York, 2004 Antti Sorjamaa Time Series Prediction and Chemo. Informatics Group Adaptive Informatics Research Centre Helsinki University of Technology

Outline Background n Algorithms n – Atomic propagation – Propagation methods – Rounding – Transitivity issues n Experimental results Antti Sorjamaa - TSPCi - AIRC - HUT 2/27

Background Trust Valid information n Distrust Disinformation or no information n Increasing flow of information makes it necessary to validate the information n Opinion of a single user is always right, but is it trustworthy? n e. Bay, Epinions, huuto. net, etc. n Antti Sorjamaa - TSPCi - AIRC - HUT 3/27

Background (2) n Problems of disinformation – Stock manipulation by bogus postings on investment boards – Marketers posing as customers – Search engine link spamming – Online relationships, dating n Web of Trust – Does not apply directly to Distrust Antti Sorjamaa - TSPCi - AIRC - HUT 4/27

Origin of Trust n Collect opinions of several users – One user can use several accounts – Group of users agree and perform spoofing n IRL Trust is built and maintained over long time periods – Trust relationships – Good basis for the propagation of Trust – More individual view of the Web of Trust Antti Sorjamaa - TSPCi - AIRC - HUT 5/27

Problems of Distrust ”Negative Trust” n Shifting the already existing Trust scores distort the results n Algorithmic complications n – Negative eigenvalues – Negative probabilities n What is Distrust propagation? Antti Sorjamaa - TSPCi - AIRC - HUT 6/27

Notation n = number of users T = Trust matrix, n x n, values from 0 to 1 D = Distrust matrix, as Trust matrix B = Beliefs matrix, typically T or T - D CB, α = Combined atomic propagation matrix P(k ) = Propagation matrix using k steps F = Final beliefs Antti Sorjamaa - TSPCi - AIRC - HUT 7/27

Atomic Propagation Basic propagation techniques, ”atoms” n Matrix operations, multiplying B with appropriate matrix operator n 4 basic atoms n – Direct Propagation – Co-citation – Transpose Trust – Trust coupling Antti Sorjamaa - TSPCi - AIRC - HUT 1 5 2 3 1 2 3 4

Atomic Propagation (2) Direct Propagation, B n Co-citation, BTB n Transpose Trust, BT n Trust coupling, BBT n 0 1 0 0 0 0, 7 0 0 0 Antti Sorjamaa - TSPCi - AIRC - HUT = 1 2 0 0 0, 7 0 0 0 3 9/27

1 Trust Coupling, BBT 5 3 4 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 Antti Sorjamaa - TSPCi - AIRC - HUT = = 10/27

Atomic Propagation (3) Direct Propagation, B n Co-citation, BTB n Transpose Trust, BT n Trust coupling, BBT n Antti Sorjamaa - TSPCi - AIRC - HUT 11/27

Notation n = number of users T = Trust matrix, n x n, values from 0 to 1 D = Distrust matrix, as Trust matrix B = Beliefs matrix, typically T or T - D CB, α = Combined atomic propagation matrix P(k ) = Propagation matrix using k steps F = Final beliefs Antti Sorjamaa - TSPCi - AIRC - HUT 12/27

Propagation Methods n Trust only: B = T n One-step Distrust: B = T n Propagated Distrust: B = T - D Antti Sorjamaa - TSPCi - AIRC - HUT 13/27

Iterative Propagation n Eigenvalue Propagation n Weighted Linear Combinations (WLC) Antti Sorjamaa - TSPCi - AIRC - HUT 14/27

Rounding n Binary decision of Trust (± 1) – Global Rounding n Order F according to Trust values n Fraction of Trust in the whole F – Local Rounding n Order F according to Trust values n Fraction of Trust in the corrent row of F – Majority Rounding n Smallest local well-defined neighborhood Antti Sorjamaa - TSPCi - AIRC - HUT 15/27

Transitivity n Direct Propagation of Trust – If 1 trusts 2 and 2 trusts 3 then 1 trusts 3 n Does not apply to Distrust directly 0 -1 1 0 0 -1 0 0 0 -0, 7 0 0 0 = 0 0 0, 7 0 0 0 ”Enemy of my enemy is my friend” Multiplicative Trust Propagation Antti Sorjamaa - TSPCi - AIRC - HUT 16/27

Transitivity (2) n Multiplicative Distrust creates problems – As seen on previous slide: ”Enemy of my enemy is my friend” – Directed cycle with negative values can lead to the user to distrust himself! n Additive Distrust Propagation – Transform the basic propagation atom – For example exp(bij) bij Antti Sorjamaa - TSPCi - AIRC - HUT 17/27

Experimental Results Epinions dataset from Epinions. com n Users write and read reviews from many different topics n Users can also rate the reviews and other reviewers n Review reading creates royalties n – Distrust system to decrease abuse n Similar systems: Amazon, Slashdot Antti Sorjamaa - TSPCi - AIRC - HUT 18/27

Epinions Dataset 131 829 nodes with 841 372 edges n Edges either Trust (+1) or Distrust (-1) n 85 percent of edges are Trust edges n Large Strongly Connected Component (SCC) of over 41 000 nodes n Bowtie: In almost 40 000 nodes and out more than 30 000 nodes n Antti Sorjamaa - TSPCi - AIRC - HUT 19/27

Methodology n Propagation of Distrust – Trust, One-step and Propagated Distrust Iteration Methods: EIG and WLC n Rounding: Global, Local and Majority n Atomic Propagations: n – Direct, Co-sitation and all combined 81 different combinations Antti Sorjamaa - TSPCi - AIRC - HUT 20/27

Experiments Each combination of methods get the same treatment n Validation using Leave-One-Out (LOO) n – Total of 3250 random edges prediction error ε – About 500 Distrust and 500 Trust edges prediction error εS n Naive errors: ε = 0, 15 and εS = 0, 5 Antti Sorjamaa - TSPCi - AIRC - HUT 21/27

Results K = 20 e 1 = Direct Only e 2 = Co-sitation Only e* = [0, 4 0, 1] Antti Sorjamaa - TSPCi - AIRC - HUT 22/27

Results (2) Antti Sorjamaa - TSPCi - AIRC - HUT 23/27

Results (3) Antti Sorjamaa - TSPCi - AIRC - HUT 24/27

Results (4) Antti Sorjamaa - TSPCi - AIRC - HUT 25/27

Conclusions n Web of Trust and Distrust is important part of many e-commerce related sites – Distrust stabilizes the propagation of opinions in the network – Distrust decreases the effect of abuse Rounding is surprisingly important n Small number of expressed Trust scores lead to accurate prediction n Antti Sorjamaa - TSPCi - AIRC - HUT 26/27

Questions? Antti. Sorjamaa@hut. fi http: //www. cis. hut. fi/projects/tsp 27/27