TigerGraph Logo Docs
Products
TigerGraph Server
TigerGraph Server
TigerGraph Suite
GraphStudio and Admin Portal TigerGraph Insights GSQL Web Shell
GSQL
GSQL Language Reference
TigerGraph Cloud
TigerGraph Cloud
Graph Data Science
TigerGraph Graph Data Science Library TigerGraph ML Workbench
Connectors and APIs
pyTigerGraph TigerGraph GraphQL Service JDBC Driver
Legacy Documentation
Legacy Documentation
Resources
Developer Site Community Forum Knowledge Base
Start Free
  • 3.9 LTS
  • 3.8
  • 3.7

TigerGraph Graph Data Science Library

    • Overview
    • Using an Algorithm
    • Centrality Algorithms
      • Approximate Closeness Centrality
      • ArticleRank
      • Betweenness Centrality
      • Closeness Centrality
      • Degree Centrality
      • Eigenvector Centrality
      • Harmonic Centrality
      • Influence Maximization
      • PageRank
      • Personalized PageRank
      • Weighted Degree Centrality
      • Weighted PageRank
    • Classification Algorithms
      • Greedy Graph Coloring
      • k-Nearest Neighbors
      • k-Nearest Neighbors (Batch Version)
      • k-Nearest Neighbors (Cross-Validation Version)
      • Maximal Independent Set
    • Community Algorithms
      • Weakly Connected Components
        • WCC (Small-World Optimized)
      • k-Core Decomposition
      • k-Means Clustering
      • Label Propagation
      • Speaker-Listener Label Propagation
      • Local Clustering Coefficient
      • Louvain
      • Strongly Connected Components
        • SCC (Small-World Optimized)
      • Triangle Counting
    • Node Embedding Algorithms
      • Fast Random Projection
      • Node2Vec
      • Weisfeiler-Lehman
    • Pathfinding Algorithms
      • A*
      • All-Pairs Shortest Path
      • All Paths (Single-Pair)
      • Breadth-First Search
      • Cycle Detection
      • Cycle Component
      • Estimated Diameter
      • Maximum Flow
      • Minimum Spanning Forest
      • Minimum Spanning Tree
      • Single-source Shortest Path (Unweighted)
      • Single-source Shortest Path (Weighted)
    • Similarity Algorithms
      • Euclidean Distance
      • Overlap Similarity
      • Pearson Similarity
      • Cosine Similarity of Neighborhoods (All Pairs, Batch)
      • Cosine Similarity of Neighborhoods (Single-Source)
      • Jaccard Similarity of Neighborhoods (Batch)
      • Jaccard Similarity of Neighborhoods (Single Source)
    • Topological Link Prediction Algorithms
      • Adamic Adar
      • Common Neighbors
      • Preferential Attachment
      • Resource Allocation
      • Same Community
      • Total Neighbors
TigerGraph Graph Data Science Library 3.8
  • TigerGraph Cloud
  • TigerGraph Server
    • 3.9 LTS
    • 3.8
    • 3.7
    • 3.6 LTS
    • 3.5
    • 3.4
    • 3.3
    • 3.2
  • GSQL Language Reference
    • 3.9 LTS
    • 3.8
    • 3.7
    • 3.6 LTS
    • 3.5
    • 3.4
    • 3.3
    • 3.2
  • GraphStudio and Admin Portal
    • 3.9 LTS
    • 3.8
    • 3.7
    • 3.6 LTS
    • 3.5
    • 3.4
    • 3.3
    • 3.2
  • TigerGraph Insights
    • 3.9 LTS
    • 3.8
    • 3.7
  • TigerGraph Graph Data Science Library
    • 3.9 LTS
    • 3.8
    • 3.7
  • pyTigerGraph
    • 1.5
    • 1.4
    • 1.3
    • 1.2
    • 1.1
    • 1.0
  • TigerGraph ML Workbench
    • 1.4
    • 1.3
    • 1.2
    • 1.1
  • TigerGraph GraphQL Service
    • 3.9 LTS
    • 3.8
    • 3.7
  • TigerGraph Graph Data Science Library
  • Topological Link Prediction Algorithms
Edit this Page

Topological Link Prediction Algorithms

Topological link prediction algorithms determine the closeness score of a pair of vertices. This score can then be used to make predictions about the relationships between the two vertices in the pair.

The TigerGraph Graph Data Science Library provides the following link prediction algorithms:

  • Adamic Adar

  • Common Neighbors

  • Preferential Attachment

  • Resource Allocation

  • Same Community

  • Total Neighbors

3 Twin Dolphin Drive, Ste 225
Redwood City, CA 94065

Copyright © 2023 TigerGraph

  • Resources

    • Support
    • Community
    • Developer Site
    • Test Drive

  • Social

    • Linkedin
    • Facebook
    • Twitter

  • Legal

    • Privacy Policy
    • Terms of Use
    • Sitemap