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

Hao Miao 0002

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

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

Databases, data management, data science and information retrieval · 2 · 2 first-author · 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.

Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%
Artificial intelligence
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
0.912025
BSG4Bot:Efficient Bot Detection Based on Biased Heterogeneous Subgraphs · ICDE 2025
Machine learning › Graph learning › graph neural network
heterogeneous graph neural network
0.912025
BSG4Bot:Efficient Bot Detection Based on Biased Heterogeneous Subgraphs · ICDE 2025
Web and social media mining
bot detection
0.912025
BSG4Bot:Efficient Bot Detection Based on Biased Heterogeneous Subgraphs · ICDE 2025
Web and social media mining › bot detection
social bot detection
0.912025
BSG4Bot:Efficient Bot Detection Based on Biased Heterogeneous Subgraphs · ICDE 2025

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

pre-trained classifier · 1.7personalized pagerank · 1.7biased subgraph construction · 1.7
YearPublicationVenuePosition
2025 BSG4Bot:Efficient Bot Detection Based on Biased Heterogeneous Subgraphs
abstract
The detection of malicious social bots has become a crucial task, as bots can be easily deployed and manipulated to spread disinformation, promote conspiracy messages, and more. Most existing approaches utilize graph neural networks (GNNs) to capture both user profile and structural features, achieving promising progress. However, they still face limitations including the expensive training on large underlying graph, the performance degradation when “similar neighborhood patterns” assumption preferred by GNNs is not satisfied, and the distinguishable features of bots in a highly adversarial context. Motivated by these limitations, this paper proposes a method named BSG4Bot with an intuition that GNNs training on Biased SubGraphs can improve both performance and time/space efficiency in bot detection. Specifically, BSG4Bot first pre-trains a classifier on node features efficiently to define the node similarities, and constructs biased subgraphs by combining the similarities computed by the pre-trained classifier and the node importances computed by Personalized PageRank (PPR scores). BSG4Bot then introduces a heterogeneous GNN over the constructed subgraphs to detect bots effectively and efficiently. The relatively stable features, including the content category and temporal activity features, are explored and incorporated into BSG4Bot after preliminary verification on sample data. The extensive experimental studies show that BSG4Bot outperforms the state-of-the-art bot detection methods, while only needing nearly 1/4 training time.
Hao Miao 0002, Zida Liu, Jun Gao 0003
ICDE1
2023 JG2Time: A Learned Time Estimator for Join Operators Based on Heterogeneous Join-Graphs
Hao Miao 0002, Jiazun Chen, Mo Xu, Yinjun Han, Jun Gao 0003
DASFAA (1)1