{"url":"/dataset/imdb-multi","name":"IMDB-MULTI","full_name":null,"description_markdown":"**IMDB-MULTI** is a relational dataset that consists of a network of 1000 actors or actresses who played roles in movies in IMDB. A node represents an actor or actress, and an edge connects two nodes when they appear in the same movie. In IMDB-MULTI, the edges are collected from three different genres: Comedy, Romance and Sci-Fi.\r\n\r\nSource: [Learning metrics for persistence-based summaries and applications for graph classification](https://arxiv.org/abs/1904.12189)","description_withheld":null,"homepage":"https://ls11-www.cs.tu-dortmund.de/staff/morris/graphkerneldatasets","introduced_date":"2015-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/deep-graph-kernels","title":"Deep Graph Kernels","first_author":"Pinar Yanardag","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Graph Classification","url":"/task/graph-classification","datasets_with_task":"/datasets/task/graph-classification"},{"name":"Document Classification","url":"/task/document-classification","datasets_with_task":"/datasets/task/document-classification"},{"name":"Graph Similarity","url":"/task/graph-similarity","datasets_with_task":"/datasets/task/graph-similarity"}],"languages":[],"variants":["IMDb-M","IMDB-MULTI"],"data_loaders":[{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#dgl.data.TUDataset","frameworks":["pytorch","tf","mxnet"]},{"repo":"https://github.com/danielegrattarola/spektral","url":"https://graphneural.network/datasets/#tudataset","frameworks":["tf"]}],"num_papers_in_archive":243,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/graph-classification-on-imdb-m","task":"Graph Classification","dataset_variant":"IMDb-M","rows":36,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"U2GNN (Unsupervised)","paper":"/paper/unsupervised-universal-self-attention-network","metrics":{"Accuracy":"89.2%"},"code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/document-classification-on-imdb-m","task":"Document Classification","dataset_variant":"IMDb-M","rows":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Document Classification Using Importance of Sentences","paper":"/paper/improving-document-level-sentiment","metrics":{"Accuracy":"54.8"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-classification-on-imdb-multi","task":"Graph Classification","dataset_variant":"IMDB-MULTI","rows":1,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"Local Topological Profile (LTP)","paper":"/paper/strengthening-structural-baselines-for-graph","metrics":{"Accuracy":"50.0 ± 4.6","Accuracy (10-fold)":"50.0 ± 4.6"},"code_links":[{"title":"j-adamczyk/ltp","url":"https://github.com/j-adamczyk/ltp"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/fine-tuning-graph-neural-networks-by","title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","date":"2023-12-21","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":13,"samples_ran":13,"samples_unverified":0,"pointer_only_for_licence":13,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graph-level-representation-learning-with","title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","date":"2023-09-27","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":11,"samples_ran":10,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graph-isomorphism-unet","title":"Graph isomorphism UNet","date":"2023-08-23","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/strengthening-structural-baselines-for-graph","title":"Strengthening structural baselines for graph classification using Local Topological Profile","date":"2023-05-01","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":10,"samples_ran":0,"samples_unverified":10,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/template-based-graph-neural-network-with","title":"Template based Graph Neural Network with Optimal Transport Distances","date":"2022-05-31","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dropgnn-random-dropouts-increase-the","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","date":"2021-11-11","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":0,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/maximum-entropy-weighted-independent-set","title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","date":"2021-07-03","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":2,"samples_ran":2,"samples_unverified":0,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/improving-document-level-sentiment","title":"Improving Document-Level Sentiment Classification Using Importance of Sentences","date":"2021-03-09","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":5,"samples_ran":4,"samples_unverified":1,"pointer_only_for_licence":5,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/online-graph-dictionary-learning","title":"Online Graph Dictionary Learning","date":"2021-02-12","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/segmented-graph-bert-for-graph-instance","title":"Segmented Graph-Bert for Graph Instance Modeling","date":"2020-02-09","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/unsupervised-universal-self-attention-network","title":"Universal Graph Transformer Self-Attention Networks","date":"2019-09-26","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":4,"samples_ran":4,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/190910086","title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","date":"2019-09-22","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/infograph-unsupervised-and-semi-supervised","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","date":"2019-07-31","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/graph-representation-learning-via-hard-and","title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","date":"2019-07-05","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/rethinking-complex-neural-network","title":"Rethinking Complex Neural Network Architectures for Document Classification","date":"2019-06-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/provably-powerful-graph-networks","title":"Provably Powerful Graph Networks","date":"2019-05-27","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":8,"samples_ran":0,"samples_unverified":8,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","date":"2019-05-21","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/dissecting-graph-neural-networks-on-graph","title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","date":"2019-05-11","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/capsule-graph-neural-network","title":"Capsule Graph Neural Network","date":"2019-05-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/spi-gcn-a-simple-permutation-invariant-graph","title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","date":"2019-04-08","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/rep-the-set-neural-networks-for-learning-set","title":"Rep the Set: Neural Networks for Learning Set Representations","date":"2019-04-03","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-a-practical-k-dimensional-weisfeiler","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","date":"2019-04-02","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":0,"samples_unverified":1,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/unsupervised-inductive-whole-graph-embedding","title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","date":"2019-04-01","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/weisfeiler-and-leman-go-neural-higher-order","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","date":"2018-10-04","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":10,"samples_ran":3,"samples_unverified":7,"pointer_only_for_licence":5,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/when-work-matters-transforming-classical","title":"When Work Matters: Transforming Classical Network Structures to Graph CNN","date":"2018-07-07","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/an-end-to-end-deep-learning-architecture-for","title":"An End-to-End Deep Learning Architecture for Graph Classification","date":"2018-04-29","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/deep-graph-kernels","title":"Deep Graph Kernels","date":"2015-08-10","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-metrics-for-persistence-based-2","title":"Learning metrics for persistence-based summaries and applications for graph classification","date":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null}],"syntology_totals":{"read_at":"2026-09-24T18:15:14+00:00","papers_with_samples":10,"samples_harvested":67,"samples_ran":36,"samples_unverified":31,"pointer_only_for_licence":26,"papers_with_no_sample_that_ran":4,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}