Common Neighbors of Vertex Sets

Overview

The Common Neighbors of Vertex Sets algorithm can find common neighbors of two vertex sets, and intuitively discover an object jointly associated with both sets, for example, a common friend in a social occasion, a commodity that is of common interest, a person who has been contacted by community groups. In this way, the algorithm infers the potential relationship and degree of association between the vertex sets.

Application Scenarios

This algorithm applies to graph analysis such as relationship mining and product/friend recommendations.

Parameter Description

**Table 1** Common Neighbors of Vertex Sets algorithm parameters
Parameter	Mandatory	Description	Type	Value Range	Default Value
sources	Yes	Source vertex ID set	String	The value is in the standard CSV format. IDs are separated by commas (,), for example, Alice, Nana. The maximum ID number is 100,000.	-
targets	Yes	Target vertex ID set	String	The value is in the standard CSV format. IDs are separated by commas (,), for example, Alice, Nana. The maximum ID number is 100,000.	-

Precautions

None

Example

Enter sources=Alice,Nana and targets=Mike,Amy. The calculation result is displayed on the canvas and the JSON result is displayed in the query result area.

Parent topic: Algorithms

Previous topic: Clustering Coefficient

Next topic: Subgraph Matching