Lightweight Distributed Trust Propagation
-
Upload
daniele-quercia -
Category
Economy & Finance
-
view
2.435 -
download
1
Transcript of Lightweight Distributed Trust Propagation
![Page 1: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/1.jpg)
Lightweight Distributed Trust Propagation
(daniele quercia & stephen hailes & licia capra)
![Page 2: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/2.jpg)
What I do...
![Page 3: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/3.jpg)
Research @ ...
![Page 4: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/4.jpg)
![Page 5: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/5.jpg)
What I research...
![Page 6: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/6.jpg)
Reputation Systems for Mobiles
![Page 7: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/7.jpg)
Daniele Quercia
Situation: People exchange
digital content
![Page 8: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/8.jpg)
Daniele Quercia
Problem: Content overload
![Page 9: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/9.jpg)
Daniele Quercia
Proposal: Accept content only from reputable people
![Page 10: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/10.jpg)
Daniele Quercia
Take two devices…
A B
![Page 11: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/11.jpg)
Daniele Quercia
A B
Shall I accept content from B?
![Page 12: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/12.jpg)
Daniele Quercia
A B
A should set its initial trust for B
![Page 13: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/13.jpg)
Daniele Quercia
A B
A should set its initial trust for B
Yes, but how?
![Page 14: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/14.jpg)
Daniele Quercia
Traditional way: Trust propagation ?A B
C
![Page 15: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/15.jpg)
Daniele Quercia
That way works on the Web and has been tested on “binary” ratings
![Page 16: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/16.jpg)
Daniele Quercia
If that way is tested on 3-level ratings
![Page 17: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/17.jpg)
Conclusion: A needs a new way for propagating its trust in B
![Page 18: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/18.jpg)
Conclusion: A needs a new way for propagating its trust in B
But which way?
![Page 19: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/19.jpg)
Our proposal
![Page 20: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/20.jpg)
Daniele Quercia
1
?A B
C2
AB
AC CB
![Page 21: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/21.jpg)
Daniele Quercia
1
?A B
C2
1 2
?
Put trust relationships in a new graph & label graph nodes
AB
AC CB
![Page 22: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/22.jpg)
Daniele Quercia
1
?A B
C2
1 2
?
Put trust relationships in a new graph & label graph nodes
AB
AC CB
Define a “good” function that rates AB
f
![Page 23: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/23.jpg)
Daniele Quercia
1
?A B
C2
1 2
?
build_graph(trust_relationships, AB)
AB
AC CBf
find_f
![Page 24: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/24.jpg)
<build_graph>
![Page 25: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/25.jpg)
A B
DC3
2
1
1
2
?
A B
? ?
2 3
1
0.5 1
M M
![Page 26: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/26.jpg)
A B
DC3
2
1
1
2
?
A B
? ?
2 3
1
0.5 1
M M
What are those ?
![Page 27: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/27.jpg)
Remember, we’ll define f We will see that f rates neighbouring nodes alike
It’s a neighbour of AB;
therefore, it rates as AB does?
![Page 28: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/28.jpg)
Remember, we’ll define f We will see that f rates neighbouring nodes alike
It’s a neighbour of AB;
therefore, it rates as AB does?
Find relationships that rate as AB does
![Page 29: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/29.jpg)
Remember, we’ll define f We will see that f rates neighbouring nodes alike
It’s a neighbour of AB;
therefore, it rates as AB does?
![Page 30: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/30.jpg)
2 Types
of those relationships
![Page 31: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/31.jpg)
1. The relationships with same rater (A)
A B
DC3
2
1
1
2
As long as B and D behave alike
![Page 32: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/32.jpg)
A B
DC3
2
1
1
2
2. The relationships with same rated node (B)
As long as A and C rate alike
![Page 33: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/33.jpg)
OK, 2 Types
![Page 34: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/34.jpg)
Taking those relationships, one comes up with …
![Page 35: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/35.jpg)
…a graph!
A C
A B
A D C B
2 3
1
0.5 1
M M
![Page 36: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/36.jpg)
</build_graph>
![Page 37: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/37.jpg)
<find_f>
![Page 38: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/38.jpg)
A C
A B
A D C B
2 3
1
0.5 1
M M
![Page 39: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/39.jpg)
Take f that returns the ratings already there ( )& similar ratings for neighbouring nodes
A C
A B
A D C B
2 3
1
0.5 1
M M
2 3
![Page 40: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/40.jpg)
More formally, …
![Page 41: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/41.jpg)
We find f that minimizes that loss!
![Page 42: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/42.jpg)
</find_f>
![Page 43: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/43.jpg)
Daniele Quercia
1
?A B
C2
1 2
?
build_graph
AB
AC CBf
find_f
![Page 44: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/44.jpg)
Does it work? Useful, Robust, Fast, “Light”?
![Page 45: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/45.jpg)
Daniele Quercia
Useful? Tested on real data (Advogato: > 55K user ratings)
![Page 46: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/46.jpg)
Daniele Quercia
Useful? Tested on real data (Advogato: > 55K user ratings)
![Page 47: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/47.jpg)
Daniele Quercia
Robust?
![Page 48: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/48.jpg)
Daniele Quercia
Robust?
![Page 49: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/49.jpg)
Daniele Quercia
Fast and “Light”?
![Page 50: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/50.jpg)
Daniele Quercia
Fast and “Light”?
For propagating AB (worst case)
Transmit 30KB& run for 2.8ms
![Page 51: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/51.jpg)
Daniele Quercia
All this on …
![Page 52: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/52.jpg)
Daniele Quercia
All this on …
![Page 53: Lightweight Distributed Trust Propagation](https://reader037.fdocuments.us/reader037/viewer/2022110120/5585b4a6d8b42a5e5a8b47d5/html5/thumbnails/53.jpg)
Daniele Quercia