Pith. sign in

REVIEW 1 cited by

A Binary Classification Social Network Dataset for Graph Machine Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.02397 v1 pith:5DMT4Y3T submitted 2025-03-04 cs.LG cs.AI

classification cs.LGcs.AI
keywords graphlearningnetworkmachineclassificationsocialbinarybisnd
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Are Heterogeneous Graph Neural Networks Truly Effective for Node Classification? A Causal Perspective

    cs.LG 2025-10 reject novelty 5.0 of 10

    A large benchmark suggests tuned RGCN matches complex HGNNs and heterogeneous graphs help mainly via homophily and local-global label discrepancy, but the causal analysis is circular.

Pith tools