LGAIMar 4, 2025

A Binary Classification Social Network Dataset for Graph Machine Learning

arXiv:2503.02397v13 citationsh-index: 3
Originality Synthesis-oriented
AI Analysis

This provides a new dataset for researchers in graph machine learning, but it is incremental as it fills a specific gap without broader methodological advances.

The paper tackles the lack of a benchmark binary classification social network dataset for graph machine learning by introducing the Binary Classification Social Network Dataset (BiSND), achieving F1-scores from 67.66 to 70.15 across various classifiers.

Social networks have a vast range of applications with graphs. The available benchmark datasets are citation, co-occurrence, e-commerce networks, etc, with classes ranging from 3 to 15. However, there is no benchmark classification social network dataset for graph machine learning. This paper fills the gap and presents the Binary Classification Social Network Dataset (\textit{BiSND}), designed for graph machine learning applications to predict binary classes. We present the BiSND in \textit{tabular and graph} formats to verify its robustness across classical and advanced machine learning. We employ a diverse set of classifiers, including four traditional machine learning algorithms (Decision Trees, K-Nearest Neighbour, Random Forest, XGBoost), one Deep Neural Network (multi-layer perceptrons), one Graph Neural Network (Graph Convolutional Network), and three state-of-the-art Graph Contrastive Learning methods (BGRL, GRACE, DAENS). Our findings reveal that BiSND is suitable for classification tasks, with F1-scores ranging from 67.66 to 70.15, indicating promising avenues for future enhancements.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes