Dataset Viewer
Auto-converted to Parquet Duplicate
Search is not available for this dataset
src
int64
0
48.8k
dst
int64
63
48.9k
0
25,344
1
451
1
5,247
1
32,477
1
35,318
1
45,417
2
33,392
3
28,524
4
48,469
5
10,753
5
15,021
5
26,328
5
26,828
5
29,371
6
30,195
6
40,663
7
6,270
8
4,394
8
23,947
8
26,745
8
33,492
9
33,509
10
6,937
11
4,241
11
8,365
11
15,644
11
39,472
12
25,545
13
3,734
13
6,979
13
9,822
13
11,381
14
12,150
15
12,702
15
12,816
16
33,163
17
6,420
17
24,617
17
33,711
17
35,840
17
39,874
18
12,426
18
33,783
18
38,532
18
44,105
19
29,277
20
1,513
21
23,005
21
34,812
22
31,216
22
39,591
23
39,158
24
32,337
24
37,538
24
43,503
25
7,168
26
14,370
27
9,426
27
16,707
27
18,684
27
20,831
27
27,381
27
35,072
28
63
28
123
28
191
28
212
28
661
28
773
28
798
28
817
28
1,730
28
1,732
28
1,841
28
2,474
28
2,801
28
3,321
28
4,706
28
4,709
28
4,802
28
4,935
28
5,237
28
5,349
28
6,416
28
6,623
28
7,023
28
7,083
28
7,462
28
7,630
28
7,750
28
8,540
28
8,770
28
8,812
28
8,872
28
9,056
28
9,128
28
9,569
28
9,580
28
10,374
28
10,409
End of preview. Expand in Data Studio

Questions (graph anomaly detection)

Users of the Yandex Q question-answering service, connected by answering interactions. The minority class marks users by activity outcome; at a 3.0% base rate this is a realistic rare-anomaly regime.

Nodes 48,921
Node features 301
Edges 153,540
Outliers 1,460 (3.0%)
Label type adjudicated
Label source Yandex Q activity outcome, Platonov et al. 2023

Files. nodes.parquet (node_id, feat_*, label, split masks where available) and edges.parquet (src, dst, the edge list as shipped upstream; symmetrize for undirected use). Ships the upstream 10 split trials as train_mask_0..9, val_mask_0..9, test_mask_0..9.

Load

import pandas as pd

nodes = pd.read_parquet("hf://datasets/JaySuryavanshi/graph-anomaly-questions/nodes.parquet")
edges = pd.read_parquet("hf://datasets/JaySuryavanshi/graph-anomaly-questions/edges.parquet")

As a graph, with graphspot (pip install graphspot):

import numpy as np, scipy.sparse as sp, graphspot
from graphspot.detectors import XGBGraph

n = len(nodes)
adj = sp.csr_matrix((np.ones(len(edges)), (edges.src, edges.dst)), shape=(n, n))
g = graphspot.Graph(adj=adj, x=nodes.filter(like="feat_").to_numpy(),
                    node_labels=nodes.label.to_numpy())

Provenance

Mirrored unmodified (beyond format conversion to parquet) from yandex-research/heterophilous-graphs (MIT). Conversion is scripted and deterministic; label counts above are computed from the files in this repository, not copied from upstream docs.

Citation

@inproceedings{platonov2023critical,
  title={A critical look at the evaluation of {GNNs} under heterophily: Are we really making progress?},
  author={Platonov, Oleg and Kuznedelev, Denis and Diskin, Michael and Babenko, Artem and Prokhorenkova, Liudmila},
  booktitle={International Conference on Learning Representations},
  year={2023}
}
Downloads last month
28