Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bora Oztekin

dblp:276/1721 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Graph learning · 82% Trustworthy machine learning · 18%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network
message passing
0.612022
Spherical Message Passing for 3D Molecular Graphs · ICLR 2022
Machine learning › Graph learning
graph neural network
0.512021
DIG: A Turnkey Library for Diving into Graph Deep Learning Research · J. Mach. Learn. Res. 2021
Bioinformatics and computational biology › molecular informatics › cheminformatics
molecular graph representation
0.212022
Spherical Message Passing for 3D Molecular Graphs · ICLR 2022
Machine learning › Graph learning
graph generation
0.112021
DIG: A Turnkey Library for Diving into Graph Deep Learning Research · J. Mach. Learn. Res. 2021
Machine learning › Trustworthy machine learning › interpretability
graph neural network explanation
0.112021
DIG: A Turnkey Library for Diving into Graph Deep Learning Research · J. Mach. Learn. Res. 2021
Machine learning › Graph learning
graph self-supervised learning
0.112021
DIG: A Turnkey Library for Diving into Graph Deep Learning Research · J. Mach. Learn. Res. 2021
Machine learning › Trustworthy machine learning
interpretability
0.112021
DIG: A Turnkey Library for Diving into Graph Deep Learning Research · J. Mach. Learn. Res. 2021

Methods — techniques the papers use, named apart from their topics

spherical message passing · 1.1equivariant neural network · 1.1graph neural network · 0.5
YearPublicationVenuePosition
2022 Spherical Message Passing for 3D Molecular Graphs
Yi Liu 0059, Limei Wang, Meng Liu 0015, Yuchao Lin, Bora Oztekin, Shuiwang Ji
ICLR6
2021 DIG: A Turnkey Library for Diving into Graph Deep Learning Research
abstract
Although there exist several libraries for deep learning on graphs, they are aiming at implementing basic operations for graph deep learning. In the research community, implementing and benchmarking various advanced tasks are still painful and time-consuming with existing libraries. To facilitate graph deep learning research, we introduce DIG: Dive into Graphs, a turnkey library that provides a unified testbed for higher level, research-oriented graph deep learning tasks. Currently, we consider graph generation, self-supervised learning on graphs, explainability of graph neural networks, and deep learning on 3D graphs. For each direction, we provide unified implementations of data interfaces, common algorithms, and evaluation metrics. Altogether, DIG is an extensible, open-source, and turnkey library for researchers to develop new methods and effortlessly compare with common baselines using widely used datasets and evaluation metrics. Source code is available at https://github.com/divelab/DIG.
Meng Liu 0015, Youzhi Luo, Limei Wang, Yaochen Xie, Hao Yuan 0001, Shurui Gui, Haiyang Yu 0005, Zhao Xu 0005, Jingtun Zhang, Yi Liu 0059, Keqiang Yan, Cong Fu 0003, Bora Oztekin, Shuiwang Ji
J. Mach. Learn. Res.14