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

Yurong Hu

dblp:117/2906 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · conflict

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

Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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 · 75% Web and social media mining · 25%

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

TopicWeightPapersLastEvidence papers
Information retrieval
evidence retrieval
1.012026
JARVIS: An Evidence-Grounded Retrieval System for Interpretable Deceptive Reviews Adjudication · SIGIR 2026
Web and social media mining › online review analysis
fake review detection
1.012026
JARVIS: An Evidence-Grounded Retrieval System for Interpretable Deceptive Reviews Adjudication · SIGIR 2026
Information retrieval
multimodal retrieval
1.012026
JARVIS: An Evidence-Grounded Retrieval System for Interpretable Deceptive Reviews Adjudication · SIGIR 2026

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

large language model · 1.0dense-sparse hybrid retrieval · 1.0
YearPublicationVenuePosition
2026 JARVIS: An Evidence-Grounded Retrieval System for Interpretable Deceptive Reviews Adjudication
abstract
Deceptive reviews are fabricated feedback designed to artificially manipulate the perceived quality of products. Within modern e-commerce ecosystems, these reviews remain a critical governance challenge. Despite advances in review-level and graph-level detection methods, two pivotal limitations remain: inadequate generalization and lack of interpretability. To address these challenges, we propose JARVIS, a framework providing Judgment via Augmented Retrieval and eVIdence graph Structures. Starting from the review to be evaluated, it retrieves semantically similar evidence via hybrid dense–sparse multimodal retrieval, expands relational signals through shared entities, and constructs a heterogeneous evidence graph. The large language model then performs evidence-grounded adjudication to produce interpretable risk assessments. Offline experiments demonstrate that JARVIS enhances performance on our constructed review dataset, achieving a precision increase from 0.953 to 0.988 and a recall boost from 0.830 to 0.901. In the production environment, our framework achieves a 27% increase in the recall volume and reduces manual inspection time by 75%. Furthermore, the adoption rate of the model-generated analysis reaches 96.4%.
Leyang Li, Yurong Hu
SIGIR3
2012 Self-adaptive Differential Evolution Based Multi-objective Optimization Incorporating Local Search and Indicator-Based Selection
Datong Xie, Lixin Ding, Shenwen Wang, Zhaolu Guo, Yurong Hu, Chengwang Xie
ICIC (1)5
2001 Logical topology-based routing in LEO constellations
abstract
Satellite communication is distinguished by global coverage and the ability to support a wide range of applications. LEO (low Earth orbit) satellite systems employing inter-satellite links offer rich connectivity in space and provide direct broadband access and personal communication services. One of the technical challenges for LEO systems is the design of efficient routing strategies tailored to their highly dynamic nature. In this paper, we present a new routing method which solves the routing problem efficiently by overlaying a static logical topology over the physical constellation. The algorithm generates near-optimal shortest paths. The performance of our proposed scheme is evaluated through theoretical analysis and simulations.
Yurong Hu, Victor O. K. Li
ICC1