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

Chunlai Dong

dblp:329/7435 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0007-5143-4000ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 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
Recommender systems · 100%
Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 62% Graph learning · 38%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
ordinal regression
0.912025
Dual-level Fuzzy Learning with Patch Guidance for Image Ordinal Regression · IJCAI 2025
Recommender systems
graph-based recommendation
0.912025
A Progressively-Passing-Then-Disentangling Approach to Recipe Recommendation · IEEE Trans. Multim. 2025
Recommender systems › domain-specific recommendation
recipe recommendation
0.912025
A Progressively-Passing-Then-Disentangling Approach to Recipe Recommendation · IEEE Trans. Multim. 2025
Machine learning › Graph learning
graph neural network
0.312025
A Progressively-Passing-Then-Disentangling Approach to Recipe Recommendation · IEEE Trans. Multim. 2025
Machine learning › Graph learning
heterogeneous graph
0.312025
A Progressively-Passing-Then-Disentangling Approach to Recipe Recommendation · IEEE Trans. Multim. 2025

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

progressive message passing · 1.7mutual information regularization · 1.7disentanglement · 1.7contrastive learning · 1.7patch guidance · 0.9fuzzy learning · 0.9dual-level learning · 0.9
YearPublicationVenuePosition
2025 Dual-level Fuzzy Learning with Patch Guidance for Image Ordinal Regression
abstract
Ordinal regression bridges regression and classification by assigning objects to ordered classes. While human experts rely on discriminative patch-level features for decisions, current approaches are limited by the availability of only image-level ordinal labels, overlooking fine-grained patch-level characteristics. In this paper, we propose a Dual-level Fuzzy Learning with Patch Guidance framework, named DFPG that learns precise feature-based grading boundaries from ambiguous ordinal labels, with patch-level supervision. Specifically, we propose patch-labeling and filtering strategies to enable the model to focus on patch-level features exclusively with only image-level ordinal labels available. We further design a dual-level fuzzy learning module, which leverages fuzzy logic to quantitatively capture and handle label ambiguity from both patch-wise and channel-wise perspectives. Extensive experiments on various image ordinal regression datasets demonstrate the superiority of our proposed method, further confirming its ability in distinguishing samples from difficult-to-classify categories. The code is available at https://github.com/ZJUMAI/DFPG-ord.
Chunlai Dong, Haochao Ying, Qibo Qiu, Danny Ziyi Chen, Jian Wu 0001
IJCAI1
2025 A Progressively-Passing-Then-Disentangling Approach to Recipe Recommendation
abstract
The increasing popularity of online food blogs and food ordering services has made personalized recipe recommendation a vital aspect of our emotional well-being. However, existing solutions, mainly based on graph neural networks, still face significant challenges, such as (a) focusing on exploiting the user-recipe interactions while neglecting other crucial pairwise and high-order relationships, and (b) failing to explicitly distinguish the distinct factors, e.g., hedonic and healthy, that influence recipe selection. To address these issues, we propose a progressively-passing-then-disentangling approach named P2D. Our approach utilizes a three-stage progressive message-passing mechanism for better representation learning. Specifically, we incorporate the extra pairwise relationships between recipes and nutrients, ingredients, and visual contents to create fine-grained and multimodal recipe representations. We next refine these representations via message passing between high-order recipe relationships to learn people's shared food preferences. Based on them, we could derive comprehensive user representations, which are subsequently transformed into disentangled forms that correspond to various decision factors through contrastive and mutual information regularization. Experimental results demonstrate both the superiority and the rationality of our method: (a) P2D outperforms the state-of-the-art recipe recommendation methods by a large margin under various metrics, (b) ablation studies confirm the positive impact of each of its components, and (c) our visualization analysis empirically supports the advantage of explicitly disentangling decision factors.
Chunlai Dong, Haochao Ying, Renjun Hu, Yuyang Xu, Jintai Chen, Fuzhen Zhuang, Jian Wu 0001
IEEE Trans. Multim.1