Demo Data from EDBT 2026 / reviewers in the wild / expert
Chen Dang
dblp:290/1506
· DBLP profile ↗
5ranked-venue papers
3as first author
5since 2021 · last 2024
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 |
Optimization for machine learning · 50% Reinforcement learning · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning
combinatorial optimization |
0.7 | 1 | 2023 | Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping · AAAI 2023 |
Machine learning › Reinforcement learning › online decision making
optimal stopping |
0.7 | 1 | 2023 | Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping · AAAI 2023 |
Methods — techniques the papers use, named apart from their topics
online learning · 0.7monte carlo tree search · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | DeepFake detection based on high-frequency enhancement network for highly compressed content
Zhaoqiang Xia, Gian Luca Marcialis, Chen Dang, Xiaoyi Feng |
Expert Syst. Appl. | 4 |
| 2024 | SCPAD: An approach to explore optical characteristics for robust static presentation attack detection
Chen Dang, Zhaoqiang Xia, Lei Li 0008, Xiaoyi Feng |
Multim. Tools Appl. | 1 |
| 2023 | Warm-Starting Nested Rollout Policy Adaptation with Optimal StoppingabstractNested Rollout Policy Adaptation (NRPA) is an approach using online learning policies in a nested structure. It has achieved a great result in a variety of difficult combinatorial optimization problems. In this paper, we propose Meta-NRPA, which combines optimal stopping theory with NRPA for warm-starting and significantly improves the performance of NRPA. We also present several exploratory techniques for NRPA which enable it to perform better exploration. We establish this for three notoriously difficult problems ranging from telecommunication, transportation and coding theory namely Minimum Congestion Shortest Path Routing, Traveling Salesman Problem with Time Windows and Snake-in-the-Box. We also improve the lower bounds of the Snake-in-the-Box problem for multiple dimensions. Chen Dang, Cristina Bazgan, Tristan Cazenave, Morgan Chopin, Pierre-Henri Wuillemin |
AAAI | 1 |
| 2021 | Monte Carlo Search Algorithms for Network Traffic Engineering
Chen Dang, Cristina Bazgan, Tristan Cazenave, Morgan Chopin, Pierre-Henri Wuillemin |
ECML/PKDD (4) | 1 |
| 2021 | Online Gait Planning of Lower-Limb Exoskeleton Robot for Paraplegic Rehabilitation Considering Weight Transfer ProcessabstractPeople who suffer from paraplegia completely lose sensory and locomotor functions; there are no known treatment methods for their recovery at this time. Exoskeleton robots have the potential to dramatically improve the locomotor ability of these individuals. Although some exoskeleton robots for paraplegic patients have been commercialized and are able to restore walking motion at present, the pilot must acquire the ability to maintain their balance and shift their weight using forearm crutches, which is very challenging for paraplegics. To make this easier, we propose a new automated intelligent gait planning method that integrates a finite-state machine (FSM) model as an underlying foundation and a gait generation model in addition to the exoskeleton system. The underlying FSM model is defined using an inverted pendulum model and a minimum jerk algorithm. To compare the planning gait, 33 volunteers provide normal walking gaits; there are two more volunteers (paraplegic and nonparaplegic) wearing the Shenzhen Institute of Advanced Technology (SIAT) exoskeleton robot to validate the effects of the proposed gait and offer the groups of surface electromyogram (sEMG) data for analysis. As a result, the input of the proposed gait planning method is simplified to two parameters. The proposed walking gait significantly reduces the arm muscle output. Note to Practitioners-This article was motivated by the problem that the four-degree of freedom (DoF) underactuated paraplegic rehabilitation lower limb exoskeleton robot lacks of the center of gravity (COG) transfer process when coordinating with paraplegia patients during the training process for beginner. The existing approach to deal with this problem generally is to train the pilot for obtaining the COG transfer ability by using crutches. This article suggests a gait planning method for the four-DOF underactuated rehabilitation lower limb exoskeleton robot considering the COG transfer process to make the exoskeleton robot coordinate with a pilot and ensure safety. The gait planning method is based on the inverted pendulum model and simplified to several parameters. By adjusting these parameters, the step length, step height, walking speed, and the shape of gait can be adjusted according to the requirements of the exoskeleton robot and pilot. In this article, we mathematically characterize a gait planning method for the exoskeleton control strategy. Preliminary online experiments suggest that this approach is feasible and can significantly reduce the arm muscle output of pilot. In future research, we will adjust the gait by estimating the velocity of center of mass (COM) of the pilot to make the exoskeleton robot coordinate with pilot actively. Yue Ma 0006, Xinyu Wu 0001, Simon X. Yang, Chen Dang, Can Wang 0002, Chunjie Chen 0001 |
IEEE Trans Autom. Sci. Eng. | 4 |