Thanks for reading Ultipa Graph Analytics & Algorithms. If you have any questions about the manual, please do not hesitate to contact our team.

This manual includes graph algorithms categorized in:

• Basic Execution of Ultipa Graph Algorithms
• Centrality Algorithms
  • Degree
  • Closeness Centrality
  • Harmonic Centrality
  • Graph Centrality
  • Betweenness Centrality
  • Eigenvector Centrality
  • CELF
• Similarity algorithms
  • Categorical Similarity
    • Jaccard Similaity
    • Overlap Similarity
  • Numerical Similarity
    • Cosine Similarity
    • Pearson Correlation Coefficient
    • Euclidean Distance
    • Normalized Euclidean Distance
• Connectivity & Compactness Algorithms
  • K-Hop All
  • Connected Component
  • Triangle Counting
  • Induced Subgraph
  • Bipartite Graph
  • HyperANF
  • k-Core
  • Minimum Spanning Tree
  • Local Clustering Coefficient
  • Topological Link Prediction
    • Adamic-Adar Index
    • Common Neighbors
    • Preferential Attachment
    • Resource Allocation
    • Total Neighbors
• Ranking Algorithms
  • PageRank & ArticleRank
  • SybilRank
• Propagation Algorithms
  • Label Propagation
  • HANP
• Community Detection & Classification Algorithms
  • k-Nearest Neighbor
  • k-Means
  • Louvain
• Graph Embedding Algorithms
  • Random Walk
  • Node2Vec Walk
  • Struc2Vec Walk
  • GraphSAGE Train
  • GraphSAGE
  • Node2Vec
  • Struc2Vec
  • LINE
  • FastRP

Documentation license: Creative Commons 4.0! © 2021 Ultipa, Inc.