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

Ruosong Long

dblp:369/6009 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 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
1 paper
Graph learning · 91% Language models and text generation · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
0.712023
A Comprehensive Study on Text-attributed Graphs: Benchmarking and Rethinking · NeurIPS 2023
Machine learning › Graph learning
text-attributed graph
0.712023
A Comprehensive Study on Text-attributed Graphs: Benchmarking and Rethinking · NeurIPS 2023
Machine learning › Graph learning › graph representation learning
text-attributed graph learning
0.712023
A Comprehensive Study on Text-attributed Graphs: Benchmarking and Rethinking · NeurIPS 2023
Natural language and speech › Language models and text generation
pre-trained language model
0.212023
A Comprehensive Study on Text-attributed Graphs: Benchmarking and Rethinking · NeurIPS 2023

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

topological pre-training · 0.7PLM-GNN co-training · 0.7
YearPublicationVenuePosition
2023 A Comprehensive Study on Text-attributed Graphs: Benchmarking and Rethinking
abstract
Text-attributed graphs (TAGs) are prevalent in various real-world scenarios, where each node is associated with a text description. The cornerstone of representation learning on TAGs lies in the seamless integration of textual semantics within individual nodes and the topological connections across nodes. Recent advancements in pre-trained language models (PLMs) and graph neural networks (GNNs) have facilitated effective learning on TAGs, garnering increased research interest. However, the absence of meaningful benchmark datasets and standardized evaluation procedures for TAGs has impeded progress in this field. In this paper, we propose CS-TAG, a comprehensive and diverse collection of challenging benchmark datasets for TAGs. The CS-TAG datasets are notably large in scale and encompass a wide range of domains, spanning from citation networks to purchase graphs. In addition to building the datasets, we conduct extensive benchmark experiments over CS-TAG with various learning paradigms, including PLMs, GNNs, PLM-GNN co-training methods, and the proposed novel topological pre-training of language models. In a nutshell, we provide an overview of the CS-TAG datasets, standardized evaluation procedures, and present baseline experiments. The entire CS-TAG project is publicly accessible at \url{https://github.com/sktsherlock/TAG-Benchmark}.
Hao Yan 0004, Chaozhuo Li, Ruosong Long, Chao Yan 0004, Jianan Zhao 0002, Wenwen Zhuang, Jun Yin 0005, Peiyan Zhang, Weihao Han, Hao Sun 0015, Qi Zhang 0066, Lichao Sun 0001, Xing Xie 0001, Senzhang Wang
NeurIPS3