Cosine Similarity of Neighborhoods (Single-Source)

Supported Graph Characteristics

Weighted edges

Homogeneous vertex types

Heterogeneous vertex types

Algorithm link: Cosine Similarity of Neighborhoods (Single-Source)

This algorithm calculates the similarity between a given vertex and every other vertex in the graph using cosine similarity.

For each vertex pair, the selected properties of each vertex are first represented as a vector. For example, a property vector for a Person vertex could have the elements age, height, and weight. Then the cosine function is applied to the two vectors.

The cosine similarity of two vectors A and B is defined as follows:

\[cos(A,B)=\frac{A\cdot B}{||A||\cdot ||B||} = \frac{\sum_iA_i B_i}{\sqrt{\sum_iA^2_i}\sqrt{\sum_iB^2_i}}\]

If A and B are identical, then \(cos(A, B) = 1\). As expected for a cosine function, the value can also be negative or zero. In fact, cosine similarity is closely related to the Pearson correlation coefficient.

For this implementation of the algorithm, the feature vector is the set of edge weights between the two vertices and their neighbors.

On a graph with many vertices, it is very likely that most vertices will be dissimilar to each other. For this reason, we can limit output with the top_k parameter.

In the Movie Rating graph shown in the figure below, there are Person vertices and Movie vertices. Every person has given a rating to one or more movies. The rating score is stored on the Likes edge using the weight attribute (not shown in the diagram). For example, in the graph below, Alex gives a rating of 10 to the movie "Free Solo".

View of a graph illustrating Person vertices connected to Movie vertices by Likes edges.

Specifications

tg_cosine_nbor_ss (VERTEX source,  SET<STRING> e_type_set, SET<STRING> reverse_e_type_set,
  STRING weight_attribute, INT top_k, INT print_limit, BOOL print_results = TRUE,
  STRING file_path = "", STRING similarity_edge = "")
RETURNS (MapAccum<VERTEX, FLOAT>)

Parameters

Parameter Description Default value

Parameter	Description	Default value
`VERTEX source`	The source vertex to start from. Provide the vertex ID and type as a tuple: `("id","type")`	N/A
`SET<STRING> e_type_set`	Edge types to traverse	(empty set of strings)
`SET<STRING> reverse_e_type_set`	Reverse edge type to traverse	(empty set of strings)
`STRING weight_attribute`	The edge attribute to use as the weight of the edge.	(empty string)
`INT top_k`	The number of vertices to return	10
`INT print_limit`	The maximum number of vertices to return	10
`BOOL print_results`	Whether to output the final results to the console in JSON format	True
`STRING filepath`	If provided, the algorithm will save the output in CSV format to this file	(empty string)
`STRING similarity_edge`	If provided, the similarity score will be saved to this edge	(empty string)

VERTEX source

The source vertex to start from. Provide the vertex ID and type as a tuple: ("id","type")

N/A

SET<STRING> e_type_set

Edge types to traverse

(empty set of strings)

SET<STRING> reverse_e_type_set

Reverse edge type to traverse

(empty set of strings)

STRING weight_attribute

The edge attribute to use as the weight of the edge.

(empty string)

INT top_k

The number of vertices to return

INT print_limit

The maximum number of vertices to return

BOOL print_results

Whether to output the final results to the console in JSON format

True

STRING filepath

If provided, the algorithm will save the output in CSV format to this file

(empty string)

STRING similarity_edge

If provided, the similarity score will be saved to this edge

(empty string)

Output

The top \(k\) vertices in the graph that have the highest similarity scores, along with their scores.

The result is available in three forms:

streamed out in JSON format
written to a file in tabular format
stored as a vertex attribute value

Result size

The output size is almost always \(k\), except in cases where the number of total vertices is lower than \(k\). The algorithm may arbitrarily choose to output one vertex over another if there are tied similarity scores.

Time complexity

This algorithm has a time complexity of \(O(D^2)\), where \(D\) is equal to the outdegree of the vertex.

Example

Still using a Movie Rating graph, one way to calculate similarity between two people would be to see which movies they both rated similarly.

Starting from one person’s name, this algorithm calculates the cosine similarity between the given person and every other person in the graph, as long as there is at least one movie they have both rated.

tg_cosine_nbor_ss ("Alex", "Likes", "Reverse_Likes", "weight", 5, 5,_,_,_)

If the source vertex is Alex, and top_k is set to 5, then we calculate the cosine similarity between him and two other persons, Jing and Kevin (since our graph does not have enough data to return 5 Person vertices). The JSON output shows the most similar vertices and their similarity scores in descending order.

The output limit is 5 persons, but we have only 2 qualified persons:

[
  {
    "neighbours": [
      {
        "attributes": {
          "neighbours.@sum_similarity": 0.42173
        },
        "v_id": "Jing",
        "v_type": "Person"
      },
      {
        "attributes": {
          "neighbours.@sum_similarity": 0.14248
        },
        "v_id": "Kevin",
        "v_type": "Person"
      }
    ]
  }
]

The CSV file version output, if selected, is not necessarily in descending order. It looks like the following:

Vertex1,Vertex2,Similarity
Alex,Kevin,0.142484
Alex,Jing,0.421731

The ATTR version inserts a new edge called Similarity into the graph with the similarity score as an edge attribute whenever the score is larger than zero. The result looks like this: