Demo Data from EDBT 2026 / reviewers in the wild / expert
Weilun Chen
dblp:182/2044
· DBLP profile ↗
5ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 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.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% | |
| Network and information security
1 paper |
Security and privacy of machine learning · 100% | |
| Artificial intelligence
2 papers |
Trustworthy machine learning · 85% Transfer learning and domain adaptation · 15% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.4 | 1 | 2020 | Boosting Decision-Based Black-Box Adversarial Attacks with Random Sign Flip · ECCV (15) 2020 |
Security and privacy of machine learning
adversarial attack |
0.4 | 1 | 2020 | Boosting Decision-Based Black-Box Adversarial Attacks with Random Sign Flip · ECCV (15) 2020 |
Security and privacy of machine learning › adversarial attack
black-box attack |
0.4 | 1 | 2020 | Boosting Decision-Based Black-Box Adversarial Attacks with Random Sign Flip · ECCV (15) 2020 |
Information retrieval
cross-modal retrieval |
0.2 | 1 | 2016 | Zero-Shot Hashing via Transferring Supervised Knowledge · ACM Multimedia 2016 |
Information retrieval
hashing |
0.2 | 1 | 2016 | Zero-Shot Hashing via Transferring Supervised Knowledge · ACM Multimedia 2016 |
Information retrieval › similarity search › semantic hashing
zero-shot hashing |
0.2 | 1 | 2016 | Zero-Shot Hashing via Transferring Supervised Knowledge · ACM Multimedia 2016 |
Information retrieval › image retrieval › semantic image retrieval
zero-shot image retrieval |
0.2 | 1 | 2016 | Zero-Shot Hashing via Transferring Supervised Knowledge · ACM Multimedia 2016 |
Machine learning › Transfer learning and domain adaptation
zero-shot learning |
0.1 | 1 | 2016 | Zero-Shot Hashing via Transferring Supervised Knowledge · ACM Multimedia 2016 |
Methods — techniques the papers use, named apart from their topics
random sign flip · 0.9decision-based attack · 0.9semantic embedding · 0.5discrete hashing · 0.5alternating optimization · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Knowing Me, Knowing AU: How Should We Design Agent-Mediated Mimicry?
Agnes Johanna Axelsson, Weilun Chen, Deborah van Sinttruije, Iulia Lefter, Laurens Rook, Catholijn M. Jonker, Catharine Oertel |
Conference on Designing Interactive Systems | 2 |
| 2025 | Vehicle Sensor Configuration Optimization for Tire Force Estimation based on Min-Max SDPabstractAccurate wheel load estimation is essential for vehicle durability assessment and performance optimization. This paper presents a novel framework that integrates a noncausal Multiple-Input Single-Output Finite Impulse Response (MISO-FIR) model with a Bayesian-based sensor selection strategy. By incorporating both past and future sensor measurements, the proposed model effectively captures the inherent bidirectional dynamics in vehicles. To ensure robust estimation performance across diverse operating conditions, a min-max optimization formulation is developed, and the associated mixed-integer problem is efficiently relaxed via semi-definite programming (SDP). Experimental evaluations on data collected under real varying road conditions demonstrate that the proposed approach not only enhances estimation accuracy but also reduces sensor deployment requirements, offering a cost-effective and reliable solution for modern automotive applications. Xu Ge, Weilun Chen, Mian Li 0001 |
IECON | 4 |
| 2022 | Resto Quest - A Serious Game on the Restorative Effects of Immersive Virtual Environments
Weilun Chen, Conchita Martin Hoogerwaard, Jeffrey Lim, Tim Polderdijk, Tom Saveur, Asror Wali, Suzanne Brinkman, Ineke J. M. van der Ham, Rafael Bidarra |
ISAGA | 1 |
| 2020 | Boosting Decision-Based Black-Box Adversarial Attacks with Random Sign Flip
Weilun Chen, Zhaoxiang Zhang 0001, Xiaolin Hu 0001, Baoyuan Wu |
ECCV (15) | 1 |
| 2016 | Zero-Shot Hashing via Transferring Supervised KnowledgeabstractHashing has shown its efficiency and effectiveness in facilitating large-scale multimedia applications. Supervised knowledge (\emph{e.g.}, semantic labels or pair-wise relationship) associated to data is capable of significantly improving the quality of hash codes and hash functions. However, confronted with the rapid growth of newly-emerging concepts and multimedia data on the Web, existing supervised hashing approaches may easily suffer from the scarcity and validity of supervised information due to the expensive cost of manual labelling. In this paper, we propose a novel hashing scheme, termed \emph{zero-shot hashing} (ZSH), which compresses images of "unseen" categories to binary codes with hash functions learned from limited training data of "seen" categories. Specifically, we project independent data labels (i.e., 0/1-form label vectors) into semantic embedding space, where semantic relationships among all the labels can be precisely characterized and thus seen supervised knowledge can be transferred to unseen classes. Moreover, in order to cope with the semantic shift problem, we rotate the embedded space to more suitably align the embedded semantics with the low-level visual feature space, thereby alleviating the influence of semantic gap. In the meantime, to exert positive effects on learning high-quality hash functions, we further propose to preserve local structural property and discrete nature in binary codes. Besides, we develop an efficient alternating algorithm to solve the ZSH model. Extensive experiments conducted on various real-life datasets show the superior zero-shot image retrieval performance of ZSH as compared to several state-of-the-art hashing methods. Yang Yang 0002, Yadan Luo, Weilun Chen, Fumin Shen, Jie Shao 0001, Heng Tao Shen |
ACM Multimedia | 3 |