21. Daniele Quercia 1 ? A B C 2 ? Put trust relationships in a new graph & label graph nodes 1 2 A B A C C B
22. Daniele Quercia 1 ? A B C 2 ? Put trust relationships in a new graph & label graph nodes Define a “good” function that rates A B f 1 2 A B A C C B
23. Daniele Quercia 1 ? A B C 2 ? build_graph ( trust_relationships, A B ) f find_f 1 2 A B A C C B
26. A B D C 3 2 1 1 2 ? A B ? ? 2 3 1 0.5 1 M M What are those ?
27. Remember, we’ll define f We will see that f rates neighbouring nodes alike It’s a neighbour of A B; therefore, it rates as A B does ?
28. Remember, we’ll define f We will see that f rates neighbouring nodes alike It’s a neighbour of A B; therefore, it rates as A B does ? Find relationships that rate as A B does
29. Remember, we’ll define f We will see that f rates neighbouring nodes alike It’s a neighbour of A B; therefore, it rates as A B does ?