EDBT 2026 Demo / reviewers in the wild / expert
Tengjiao Li
dblp:272/0721
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0003-2247-1105ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 |
Recommender systems · 62% Knowledge graphs · 19% Information retrieval · 19% | |
| Artificial intelligence
1 paper |
Trustworthy machine learning · 100% | |
| Network and information security
1 paper |
Security and privacy of machine learning · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems › interactive recommendation
conversational recommendation |
0.8 | 1 | 2024 | Improving Conversational Recommendation System Through Personalized Preference Modeling and Knowledge Graph · IEEE Trans. Knowl. Data Eng. 2024 |
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial transferability |
0.4 | 1 | 2020 | Towards Transferable Targeted Attack · CVPR 2020 |
Machine learning › Trustworthy machine learning
robustness |
0.4 | 1 | 2020 | Towards Transferable Targeted Attack · CVPR 2020 |
Security and privacy of machine learning
adversarial attack |
0.4 | 1 | 2020 | Towards Transferable Targeted Attack · CVPR 2020 |
Security and privacy of machine learning › adversarial attack › transferable adversarial attack
transferable targeted attack |
0.4 | 1 | 2020 | Towards Transferable Targeted Attack · CVPR 2020 |
Information retrieval
dialogue systems |
0.2 | 1 | 2024 | Improving Conversational Recommendation System Through Personalized Preference Modeling and Knowledge Graph · IEEE Trans. Knowl. Data Eng. 2024 |
Knowledge graphs
knowledge graph reasoning |
0.2 | 1 | 2024 | Improving Conversational Recommendation System Through Personalized Preference Modeling and Knowledge Graph · IEEE Trans. Knowl. Data Eng. 2024 |
Methods — techniques the papers use, named apart from their topics
poincaré distance · 0.9momentum iterative attack · 0.9metric learning · 0.9slot filling · 0.8language model · 0.8knowledge graph embedding · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Improving Conversational Recommendation System Through Personalized Preference Modeling and Knowledge GraphabstractConversational recommendation systems (CRS) can actively discover users’ preferences and perform recommendations during conversations. The majority of works on CRS tend to focus on a single conversation and dig it using knowledge graphs, language models, etc. However, they often overlook the abundant and rich preference information that exists in the user's historical conversations. Meanwhile, end-to-end generation of recommendation results may lead to a decrease in recommendation quality. In this work, we propose a personalized conversational recommendation system infused with historical interaction information. This framework leverages users’ preferences extracted from their historical conversations and integrates them with the users’ preferences in current conversations. We find that this contributes to higher accuracy in recommendations and fewer recommendation turns. Moreover, we improve the interactive pattern between the recommendation module and the dialogue generation module by utilizing the slot filling method. This enables the results inferred by the recommendation module to be integrated into the conversation naturally and accurately. Our experiments on the benchmark dataset demonstrate that our model significantly outperforms the state-of-the-art methods in the evaluation of recommendations and dialogue generation. Guoshuai Zhao 0001, Tengjiao Li, Jialie Shen 0001, Xueming Qian |
IEEE Trans. Knowl. Data Eng. | 3 |
| 2023 | Frequency domain regularization for iterative adversarial attacks
Tengjiao Li, Maosen Li, Yanhua Yang, Cheng Deng 0002 |
Pattern Recognit. | 1 |
| 2020 | Towards Transferable Targeted AttackabstractAn intriguing property of adversarial examples is their transferability, which suggests that black-box attacks are feasible in real-world applications. Previous works mostly study the transferability on non-targeted setting. However, recent studies show that targeted adversarial examples are more difficult to transfer than non-targeted ones. In this paper, we find there exist two defects that lead to the difficulty in generating transferable examples. First, the magnitude of gradient is decreasing during iterative attack, causing excessive consistency between two successive noises in accumulation of momentum, which is termed as noise curing. Second, it is not enough for targeted adversarial examples to just get close to target class without moving away from true class. To overcome the above problems, we propose a novel targeted attack approach to effectively generate more transferable adversarial examples. Specifically, we first introduce the Poincar\'{e} distance as the similarity metric to make the magnitude of gradient self-adaptive during iterative attack to alleviate noise curing. Furthermore, we regularize the targeted attack process with metric learning to take adversarial examples away from true label and gain more transferable targeted adversarial examples. Experiments on ImageNet validate the superiority of our approach achieving 8\% higher attack success rate over other state-of-the-art methods on average in black-box targeted attack. Maosen Li, Cheng Deng 0002, Tengjiao Li, Junchi Yan, Xinbo Gao 0001, Heng Huang 0001 |
CVPR | 3 |