Theory of Complex Networks

Tutorial 4

6 problems · 0 solved

  1. 17.Pearson correlation similarity derivationsolution

    Show that the definition of the Pearson correlation similarity can be derived from the definition of the Pearson correlation of two random variables (u, v), upon choosing .

  2. 18.Equivalence of cosine similarity formssolution

    Show that the two expressions given for the cosine similarity of two nodes i and j in a nondirected graph are identical. In other words, show that .

  3. 19.Bounds and equality conditions for cosine similaritysolution

    Show that , and that if and only if .

  4. 20.Book recommendation using cosine similarity on bipartite graphsolution

    The graph is a bipartite graph of books (squares) and customers (circles). Each edge links a book to a customer if that customer purchased the corresponding book. Customer 5 would like to purchase a new book. Please provide a recommendation to this customer by using the cosine similarity.

  5. 21.Equivalence of Pearson correlation similarity formssolution

    Show that the two expressions given for the Pearson correlation similarity of two nodes i and j in a nondirected graph are identical.

  6. 22.Bound on Pearson correlation similaritysolution

    Show that . Hint: define for each node i the vector with entries , and write in terms of and . Next, use again the Cauchy-Schwartz inequality.

Solutions

  1. 17.Pearson correlation similarity derivation

    No solution yet.

  2. 18.Equivalence of cosine similarity forms

    No solution yet.

  3. 19.Bounds and equality conditions for cosine similarity

    No solution yet.

  4. 20.Book recommendation using cosine similarity on bipartite graph

    No solution yet.

  5. 21.Equivalence of Pearson correlation similarity forms

    No solution yet.

  6. 22.Bound on Pearson correlation similarity

    No solution yet.

/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card