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.

Dezhi Liu

dblp:77/3187 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
10since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 67% Data mining · 33%
Artificial intelligence
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models › neural retrieval › dense retrieval
contrastive learning for retrieval
0.812024
Author Name Disambiguation via Paper Association Refinement and Compositional Contrastive Embedding · WWW 2024
Information retrieval › text analysis
name disambiguation
0.812024
Author Name Disambiguation via Paper Association Refinement and Compositional Contrastive Embedding · WWW 2024
Data mining
representation learning
0.812024
Author Name Disambiguation via Paper Association Refinement and Compositional Contrastive Embedding · WWW 2024
Machine learning › Graph learning › graph structure learning
graph structure refinement
0.212024
Author Name Disambiguation via Paper Association Refinement and Compositional Contrastive Embedding · WWW 2024

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

graph refinement · 1.5contrastive learning · 1.5compositional embedding · 1.5
YearPublicationVenuePosition
2026 LWDiffusion: Node role detection in complex networks via legendre wavelet diffusion model
Dezhi Liu, Di Jin 0001, Wenjun Wang 0002, Chengbo Yu
Inf. Sci.2
2026 TRDA-TS: Text reinforcement and regularized diffusion alignment for LLM-empowered multimodal time series forecasting
Xiao Zhai, Changkai Li, Dezhi Liu, Zhengzheng Lin
Knowl. Based Syst.4
2026 Exploring the evolution trends of network security research field based on P4OE heterogeneous network
Dezhi Liu, Wenjun Wang 0002, Chengbo Yu
Neural Comput. Appl.2
2025 Channel-correlation aware photovoltaic power forecasting framework based on multi-perspective modeling
Dezhi Liu, Xuan Lin, Lili Niu, Zhifu Tao
Expert Syst. Appl.1
2025 Incomplete graph learning via data and representation-level interaction
Dezhi Liu, Richong Zhang, Junfan Chen 0001, Fanshuang Kong, Jaein Kim 0003
Knowl. Based Syst.1
2025 DTSFormer: Decoupled temporal-spatial diffusion transformer for enhanced long-term time series forecasting
Dezhi Liu, Huayou Chen, Jinpei Liu, Zhifu Tao
Knowl. Based Syst.2
2024 UrgRF:Radiance Field Reconstruction Guided by Low-Resolution Grids
Dezhi Liu, Weibing Wan, Xiuyuan Zheng
CGI (2)1
2024 A Lightweight Detection Scheme for the Black-Hole Attacks and Gray-Hole Attacks in VANETs
Dezhi Liu
ICA3PP (5)1
2024 Author Name Disambiguation via Paper Association Refinement and Compositional Contrastive Embedding
abstract
Author name disambiguation (AND) is an essential task for online academic retrieval systems. Recent models adopt representation learning in the author's name disambiguation. Despite achieving remarkable success, these methods may be limited in two aspects. First, the heuristically constructed paper association graphs used for representation learning contain uncertainties that may cause negative supervision. Second, existing algorithms, such as binary cross-entropy loss, used to train representation learning models may not produce sufficiently high-quality representations for AND. To tackle the above problems, we propose an association refining and compositional contrasting (ARCC) framework for AND tasks. ARCC first adopts an iterative graph structure refinement process to dynamically reduce the uncertainties in paper graphs. Then, a compositional contrastive learning method is proposed to encourage learning more discriminative representations for AND. Empirical studies on two benchmark datasets suggest that ARCC is effective for AND and outperforms the state-of-the-art models.
Dezhi Liu, Richong Zhang, Junfan Chen 0001, Xinyue Chen 0005
WWW1
2023 GsNeRF: Fast novel view synthesis of dynamic radiance fields
Dezhi Liu, Weibing Wan, Zhijun Fang 0001, Xiuyuan Zheng
Comput. Graph.1