Analyzing Graphs Using Algorithms

Scenario

In scenarios such as social networking and e-commerce recommendation, graph algorithms can be used for relationship analysis and social community discovery. For example, you can use the PageRank algorithm to analyze key roles in social networks, use the Shortest Path algorithm to find relationship paths and recommend friends among the roles, and use the K-core algorithm to discover small circles.

Procedure

  1. Log in to the GES graph editor. For details, see Accessing the GES Graph Editor.
  2. In the algorithm library area, you can select an algorithm and set its parameters.

    Algorithm List shows the algorithms supported by GES and Algorithms describes the algorithm details.

    Figure 1 Setting algorithm parameters

  3. Run the algorithm by clicking . You can view the query result after the analysis is complete.

    Figure 2 Viewing the analysis result

  4. Take the movie data in the template as an example. After the parameters are adjusted, the PageRank value changes, but the top rank is nearly the same.

    The two most influential movies, that is, the ID Lethal Weapon and ID Jaws, are selected.
    Figure 3 Adjusting parameters
    Figure 4 Query result after the parameters are adjusted

  5. Run the Link Prediction algorithm to analyze the association degree of the two movies. The degree is 0.35, indicating that many people have watched both the two movies.

    Figure 5 Association analysis
    Figure 6 Association analysis result