A Probabilistic Model for Node Classification in Directed Graphs
In this work, we present a probabilistic model for directed graphs where nodes have attributes and labels. This model serves as a generative classifier capable of predicting the labels of unseen nodes using either maximum likelihood or maximum a posteriori estimations. The predictions made by this model are highly interpretable, contrasting with some common methods for node classification, such as graph neural networks. We applied the model to two datasets, demonstrating predictive performance that is competitive with, and even superior to, state-of-the-art methods. One of the datasets considered is adapted from the Math Genealogy Project, which has not previously been utilized for this purpose. Consequently, we evaluated several classification algorithms on this dataset to compare the performance of our model and provide benchmarks for this new resource.
Code (1)
Tasks
MathNode ClassificationSimilar Papers 제목 키워드 기반
Directed Probabilistic Watershed
The Probabilistic Watershed is a semi-supervised learning algorithm applied on undirected graphs. Given a set of labeled nodes (seeds), it defines a Gibbs probability distribution over all possible spanning forests disco…
Node Representation Learning for Directed Graphs
We propose a novel approach for learning node representations in directed graphs, which maintains separate views or embedding spaces for the two distinct node roles induced by the directionality of the edges. We argue th…
General ClassificationGraph ReconstructionLink PredictionMulti-Label Classification+2A Simple and Scalable Graph Neural Network for Large Directed Graphs
Node classification is one of the hottest tasks in graph analysis. Though existing studies have explored various node representations in directed and undirected graphs, they have overlooked the distinctions of their capa…
ClassificationGraph Neural NetworkNode ClassificationGraph Neural Network leveraging Higher-order Class Label Connectivity for Heterophilous Graphs
Node classification in graph neural networks (GNNs) has been widely applied in various fields of graph analysis. GNNs achieve high-accuracy node classification in homophilous graphs, where nodes with the same class label…
Graph Neural NetworkNode ClassificationDirected Reduction Algorithms and Decomposable Graphs
In recent years, there have been intense research efforts to develop efficient methods for probabilistic inference in probabilistic influence diagrams or belief networks. Many people have concluded that the best methods …