8 repository-uri
Predicting labels for individual nodes within a graph structure.
Distinct from Semi-Supervised Classification: Specific to graph-structured data, whereas semi-supervised classification is a general ML approach.
Explore 8 awesome GitHub repositories matching artificial intelligence & ml · Node Classification. Refine with filters or upvote what's useful.
DGL is a Python library for building and training graph neural networks. It functions as a graph message passing framework and a geometric deep learning tool, enabling the development of models that analyze graph-structured data. The library is designed for large-scale graph processing, utilizing distributed training and neighbor sampling to handle datasets with billions of edges. It provides specialized support for heterogeneous graph modeling, allowing for the representation of complex real-world entities with multiple node and edge types. Its capabilities cover a wide range of graph tasks
Predicts labels for individual nodes using semi-supervised or supervised learning techniques on graph-structured data.
This is a graph convolutional network library designed for performing node and graph classification on graph-structured data. It functions as a framework for generating graph embeddings and implementing spectral convolutional neural networks to predict labels for nodes and entire graph structures. The library provides specialized tools for spectral graph convolutions, utilizing Chebyshev polynomial approximations to perform feature aggregation. It includes a multi-graph processing framework that manages batches of different graph instances through block-diagonal adjacency matrices and pooling
Predicts labels for unknown nodes in a graph using only a small set of labeled examples.
pygcn is a PyTorch library and framework for implementing graph convolutional networks. It provides tools for semi-supervised node classification and the generation of node embeddings from graph-structured data. The system converts graph nodes into low-dimensional vectors based on neighborhood patterns and local similarities. It enables the prediction of node labels by leveraging both a small set of labeled examples and the overall graph topology. The library covers relational data analysis and semi-supervised graph learning. It includes computational primitives for message passing, adjacenc
Predicting labels for specific nodes in a graph by combining known examples with the overall network structure.
Memgraph is an in-memory, distributed graph database designed for high-performance labeled property graph management. It utilizes a Cypher query engine for declarative data retrieval and manipulation, providing a scalable knowledge graph backend that integrates vector search and graph traversals. The system distinguishes itself as a real-time graph analytics platform, employing native C++ and CUDA implementations to execute complex network analysis and dynamic community detection on streaming data. It provides specialized support for AI integration, including GraphRAG capabilities, the constr
Implements node classification to predict labels for individual nodes using neighbor and structural analysis.
GraphEmbedding is a graph network representation library and node embedding framework. It provides a toolkit for transforming complex network nodes into low-dimensional vector spaces, enabling the integration of relational graph data into machine learning workflows. The library functions as a dimensionality reduction toolkit and network topology analysis tool. It uses matrix-factorization techniques to preserve global connectivity and employs random-walk sampling with skip-gram based vector optimization to learn numerical representations of nodes. The framework covers several domain-specific
Predicts categories or labels for individual network nodes based on their learned numerical representations.
GraphSAGE is a graph neural network framework designed for inductive representation learning on large-scale graphs. It functions as an inductive graph embedding tool and neighborhood aggregation engine, enabling the generation of numerical node representations that generalize to previously unseen data. The system distinguishes itself by computing node embeddings through the aggregation of features from local neighborhoods rather than relying on a global lookup table. This approach allows the framework to operate as both a supervised graph classifier for predicting categorical node classes and
Provides capabilities for predicting categorical node classes based on graph structure and attributes.
Graph Nets is a graph neural network library and educational toolkit implemented in PyTorch, providing implementations of popular graph representation learning algorithms and research papers. The project covers core graph machine learning tasks including semi-supervised node classification, inductive and unsupervised node embedding generation, and neighborhood feature aggregation. The library supports diverse algorithmic approaches for processing network structures, ranging from shared-parameter graph convolutions and attention-weighted neighborhood aggregation to spectral Chebyshev filtering
Apply shared filter parameters across graph locations to perform semi-supervised classification on non-euclidean graph data structures.
This repository serves as an educational resource for implementing graph neural networks using Python. It provides a collection of structured code examples and tutorials designed to guide developers through the process of building and training machine learning models that operate on complex, interconnected datasets. The project covers the core mechanics of graph-based deep learning, including message-passing architectures, feature aggregation, and the stacking of convolutional layers. It demonstrates how to represent non-Euclidean data as static graphs and how to manage memory during training
Assigns labels to nodes or edges within large datasets to categorize complex network structures for better data organization.