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

Yanrong Hu

dblp:84/4537 · DBLP profile ↗
← Back
10ranked-venue papers
2as first author
9since 2021 · last 2026
0000-0002-9826-5212ORCID · corroborated

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

Artificial intelligence and machine learning · 6 · 1 first-author · 5 since 2021Systems, architecture and hardware · 2 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Generative modeling · 72% Language models and text generation · 24% Motion planning and robot control · 3%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
concept erasure
0.912025
Continuous Concepts Removal in Text-to-image Diffusion Models · NeurIPS 2025
Machine learning › Generative modeling
diffusion model
0.912025
Continuous Concepts Removal in Text-to-image Diffusion Models · NeurIPS 2025
Natural language and speech › Language models and text generation
knowledge editing
0.912025
Continuous Concepts Removal in Text-to-image Diffusion Models · NeurIPS 2025
Machine learning › Generative modeling › diffusion model › text-to-image generation
text-to-image diffusion model
0.912025
Continuous Concepts Removal in Text-to-image Diffusion Models · NeurIPS 2025
Machine learning › Optimization for machine learning › evolutionary computation
genetic algorithms
0.012004
A Knowledge based Genetic Algorithm for Path Planning of a Mobile Robot · ICRA 2004
Robotics › Motion planning and robot control
motion planning
0.012004
A Knowledge based Genetic Algorithm for Path Planning of a Mobile Robot · ICRA 2004
Robotics › Motion planning and robot control
path planning
0.012004
A Knowledge based Genetic Algorithm for Path Planning of a Mobile Robot · ICRA 2004
Robotics › Robot navigation and mapping
mobile robot navigation
0.012004
A Knowledge based Genetic Algorithm for Path Planning of a Mobile Robot · ICRA 2004

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

genetic algorithm · 0.9knowledge distillation · 0.9fuzzing · 0.9local search · 0.0domain knowledge · 0.0
YearPublicationVenuePosition
2026 Soy-Hybrid: A Hybrid Architecture for Accurate and Efficient Soybean Leaf Disease Recognition
Fanghao Nan, Qingyang Liu 0001, Yanrong Hu, Hongjiu Liu
ICIC (1)3
2025 Continuous Concepts Removal in Text-to-image Diffusion Models
abstract
Text-to-image diffusion models have shown an impressive ability to generate high-quality images from input textual descriptions/prompts. However, concerns have been raised about the potential for these models to create content that infringes on copyrights or depicts disturbing subject matter. Removing specific concepts from these models is a promising solution to this issue. However, existing methods for concept removal do not work well in practical but challenging scenarios where concepts need to be continuously removed. Specifically, these methods lead to poor alignment between the text prompts and the generated image after the continuous removal process. To address this issue, we propose a novel concept removal approach called CCRT that includes a designed knowledge distillation paradigm. CCRT constrains the text-image alignment behavior during the continuous concept removal process by using a set of text prompts. These prompts are generated through our genetic algorithm, which employs a designed fuzzing strategy. To evaluate the effectiveness of CCRT, we conduct extensive experiments involving the removal of various concepts, algorithmic metrics, and human studies. The results demonstrate that CCRT can effectively remove the targeted concepts from the model in a continuous manner while maintaining the high image generation quality (e.g., text-image alignment). The code of CCRT is available at https://github.com/wssun/CCRT.
Tingxu Han, Weisong Sun, Yanrong Hu, Chunrong Fang, Shiqing Ma, Tao Zheng 0005, Zhenyu Chen 0001, Zhenting Wang
NeurIPS3
2025 DPS: A Congestion-Aware Allreduce Job Placement for In-Network Aggregation
Yanrong Hu, Dezun Dong, Zihao Wei, Zhen Ruan
NPC (1)1
2025 TiM4Rec: An efficient sequential recommendation model based on time-aware structured state space duality model
Hao Fan 0007, Mengyi Zhu, Yanrong Hu, Hailin Feng, Zhijie He, Hongjiu Liu, Qingyang Liu 0001
Neurocomputing3
2025 A Novel Knowledge-Based Genetic Algorithm for Robot Path Planning in Complex Environments
abstract
This article presents a novel knowledge-based genetic algorithm (GA) to generate a collision-free path in complex environments. The proposed algorithm infuses specific domain knowledge into robot path planning through the development of five problem-specific operators that integrate a local search technique to improve efficiency. In addition, the proposed algorithm introduces a unique and straightforward representation of the robot path and an effective method for evaluating the path quality and accurately detecting collisions. The proposed algorithm is capable of finding optimal or suboptimal robot paths in both static and dynamic environments. Simulation and experimental studies are conducted to showcase the effectiveness and efficiency of the proposed algorithm. Furthermore, a comparative study is performed to highlight the indispensable role of specialized genetic operators within the proposed algorithm in solving the path planning problem.
Junfei Li, Yanrong Hu, Simon X. Yang
IEEE Trans. Evol. Comput.2
2024 Linking negative herding effect to online public opinion: A new BiGADG approach for sentiment classification
abstract
Abstract The negative herding effect tends to cause the spread of negative emotions among netizens, resulting in significant public opinion crises. Therefore, linking the negative herding effect and online public opinion, we aim to exploring the connection between netizens' emotions, opinions, and the negative herding effect. To better distinguish the emotions in texts, a new BiGADG ( Bi directional G ated recurrent unit based on A ttention with D istance‐based dependency syntax G raph convolutional network) model is proposed in this article. This model includes primarily the proposed dependency syntax based on dependency distance, Bidirectional Gated Recurrent Unit (BiGRU), multi‐head self‐attention and Graph Convolutional Network (GCN). Particularly, the dependency syntax based on dependency distances incorporates word‐to‐word dependency distances into the traditional dependency syntax, which enriches the syntactic structural features of the text. After the experiments, the accuracy of BiGADG model is 86.53%, which is 3.11% higher compared to BERT model. It is evident that our model for sentiment classification has been improved. Based on the results of sentiment classification, we investigate the existence of negative herding behaviour and its underlying motivation in online public opinion. We have found that the negative herding effect, if not effectively managed, may trigger large‐scale and uncontrollable public opinion crises.
Yiyin Zhou, Yanrong Hu, Hongjiu Liu, Dan Dai
Expert Syst. J. Knowl. Eng.2
2024 A novel combining method of dynamic and static web crawler with parallel computing
Qingyang Liu 0001, Ramin Yahyapour, Hongjiu Liu, Yanrong Hu
Multim. Tools Appl.4
2023 Financial performance evaluation and forecasting of enterprises by the combination of PCA and CNN deep learning
Ruisong Li, Hongjiu Liu, Yanrong Hu
Frontiers Comput. Sci.3
2022 Research on corporate financial performance prediction based on self-organizing and convolutional neural networks
abstract
Abstract Economic risks faced by manufacturing enterprises are gradually increasing and risk reduction whilst maintaining high financial performance has become key to their survival and development of enterprises. Enterprise performance affects not only enterprise development but also does the interests of investors and creditors. Therefore, a well‐performing model for financial performance prediction is particularly important. In this paper, we combine unsupervised and supervised learning, fusing self‐organizing mapping neural networks and convolutional neural networks, and apply deep learning to financial analysis to construct a new financial performance prediction model, called SNN‐CNN. This paper uses crawler technology to obtain financial data of listed manufacturing enterprises and classifies their financial performance into five levels. It finds that enterprises with high financial performance tend to have balanced financial indicators, strong corporate vitality and stable development of various capabilities, while enterprises with low financial performance have poor repayment and profitability, significant risks in corporate operation and limited growth and development. Compared with traditional risk prediction models, the SOM‐CNN model has a higher accuracy rate, up to 95.69%.
Maoze Zhou, Hongjiu Liu, Yanrong Hu
Expert Syst. J. Knowl. Eng.3
2004 A Knowledge based Genetic Algorithm for Path Planning of a Mobile Robot
abstract
In this paper, a knowledge based genetic algorithm (GA) for path planning of a mobile robot is proposed, which uses problem-specific genetic algorithms for robot path planning instead of the standard GAs. The proposed knowledge based genetic algorithm incorporates the domain knowledge into its specialized operators, where some also combine a local search technique. The proposed genetic algorithm also features a unique and simple path representation and a simple but effective evaluation method. The knowledge based genetic algorithm is capable of finding an optimal or near-optimal robot path in both complex static and dynamic environments. The effectiveness and efficiency of the proposed genetic algorithm is demonstrated by simulation studies. The irreplaceable role of the specialized genetic operators in the proposed GA for solving robot path planning problem is demonstrated by a comparison study.
Yanrong Hu, Simon X. Yang
ICRA1