EDBT 2026 Demo / reviewers in the wild / expert
Dan Guo 0001
dblp:44/6570-1
· DBLP profile ↗
9ranked-venue papers in the field
0as first author
9since 2021 · last 2026
0000-0003-2594-254XORCID · conflict
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 4Other / Interdisciplinary · 3Database Systems & Data Management · 1Data Mining & Knowledge Discovery · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | SIGaze: Toward Pixel-Level Single-Instance Gaze Object PredictionabstractGaze object prediction aims to accurately predict the object that humans are gazing at in a scene. Existing methods often adopt a two-stage pipeline, matching the target from candidate instances via gaze heatmaps, which can easily fail due to uneven energy distribution or spatial offset of the heatmaps. To address this, we explore a direct end-to-end framework for Single-Instance Gaze object prediction (SIGaze). However, we find this is not easy, with two main challenges: 1) the weak correlation between head cues and global scene cues, 2) the difficulty of jointly optimizing segmentation and classification objectives. To address the above challenges, SIGaze contains two key modules: (1) Head-Conditioned Scene Interactive module, which captures the correlation between head position and scene semantics via self-attention mechanism, effectively focusing on regions consistent with gaze intent. (2) Cross-Interactive Dual Decoder module, which performs instance-level segmentation prediction and category recognition in parallel within a shared feature space, better optimizing the segmentation-classification joint objective to achieve semantically clear and geometrically precise single-instance prediction. We evaluate the proposed method under the wUoC and mSoC metrics, and extensive experiments on the GOO dataset demonstrate that our method significantly outperforms existing methods in the single-instance gaze object prediction task. Dongxing Duan, Dan Guo 0001 |
ICMR | 5 |
| 2026 | XInsight: Integrative Stage-Consistent Psychological Counseling Support Agents for Digital Well-Being
Fei Wang 0073, Jiangnan Yang, Kun Li 0008, Yanyan Wei, Dan Guo 0001, Meng Wang 0001 |
WWW | 7 |
| 2025 | EmoSEM: Segment and Explain Emotion Stimuli in Visual ArtabstractThis paper focuses on a key challenge in visual emotion understanding: given an art image, the model pinpoints pixel regions that trigger a specific human emotion, and generates linguistic explanations for it. Despite advances in general segmentation, pixel-level emotion understanding still faces a dual challenge: first, the subjectivity of emotion prevents general segmentation models like SAM from adapting to emotion-oriented segmentation; and second, the abstract nature of art hinders captioning models from balancing pixel-level semantics and emotion reasoning. To solve the above problems, this paper proposes the Emotion stimuli Segmentation and Explanation Model (EmoSEM) model to endow the segmentation framework with emotion comprehension capability. First, to enable the model to perform segmentation under the guidance of emotional intent well, we introduce an emotional prompt with a learnable mask token as the conditional input for segmentation decoding. Then, we design an emotion projector to establish the association between emotion and visual features. Next, more importantly, to align emotion with visual stimuli, we develop a lightweight prefix adapter that fuses the learned emotional mask with the corresponding emotion into a unified representation compatible with the language model. Finally, we input the joint visual, mask, and emotional tokens into the language model and output the emotional explanations. This ensures the generated interpretations stay semantically and emotionally aligned with the visual stimuli. Our method realizes end-to-end modeling from low-level pixel features to high-level emotion interpretation, delivering the first interpretable fine-grained framework for visual emotion analysis. Extensive experiments validate the effectiveness of our model. Jing Zhang 0089, Dan Guo 0001, Zhangbin Li, Meng Wang 0001 |
MMAsia | 2 |
| 2025 | Alleviating Confirmation Bias in Learning with Noisy Labels via Two-Network CollaborationabstractDeep neural networks (DNNs) have achieved remarkable success in various computer vision tasks, e.g., image classification. However, most of the existing models depend heavily on annotated data, where label noise is inevitable. Training with such noisy data negatively impacts the generalization performance of DNNs. To this end, recent advances in learning with noisy labels (LNL) adopt the sample selection strategy that identifies clean samples from the noisy dataset to update DNNs, using semi-supervised learning where rejected samples are treated as unlabeled data. However, existing LNL methods often overlook the varying fitting difficulties of different classes, resulting in suboptimal sample selection and confirmation bias, and consequently, the errors accumulate during semi-supervised training. In this article, we propose a novel method, TNCollab, which aims at alleviating confirmation bias in both sample selection and semi-supervised training stages via two-network collaboration. Specifically, we introduce a class-adaptive threshold for sample selection to address the varying fitting difficulties across different classes. Additionally, we construct a hard set consisting of samples where the two networks disagree and introduce a noise-robust loss to extract potentially useful information while maintaining robustness against label noise. Furthermore, we propose a dual consistency loss to ensure consistent predictions between the networks across different augmented views of the same sample, facilitating mutual learning. Extensive experiments demonstrate that TNCollab achieves state-of-the-art performance on image classification and facial expression recognition tasks, particularly on CIFAR-10, CIFAR-100, WebVision, Clothing1M, Tiny-ImageNet, and RAF-DB datasets, showing improved visual understanding and generalization capabilities. Our codes are available at https://github.com/Delete12137/TNCollab . Peipei Song, Shengeng Tang, Dan Guo 0001, Xun Yang 0001 |
ACM Trans. Intell. Syst. Technol. | 4 |
| 2024 | Repetitive Action Counting with Feature Interaction Enhancement and Adaptive Gate Fusion
Kun Li 0008, Yanyan Wei, Fei Wang 0073, Jinxing Zhou, Dan Guo 0001 |
MMAsia | 7 |
| 2024 | Multimodal Graph Causal Embedding for Multimedia-Based RecommendationabstractMultimedia-based recommendation (MMRec) models typically rely on observed user-item interactions and the multimodal content of items, such as visual images and textual descriptions, to predict user preferences. Among these, the user's preference for the displayed multimodal content of items is crucial for interacting with a particular item. We argue that users' preference behaviors (i.e., user-item interactions) for the modality content of items, beyond stemming from their real interest in the modality content, may also be influenced by their conformity to the popularity of items' modality-specific content (e.g., a user might be motivated to interact with a lipstick due to enthusiastic discussions among other users regarding textual reviews of the product). In essence, user-item interactions are jointly triggered by real interest and conformity. However, most existing MMRec models primarily concentrate on modeling users' interest preferences when capturing multimodal user preferences, neglecting the modeling of their conformity preferences, which results in sub-optimal recommendation performance. In this work, we resort to causal theory to propose a novel MMRec model, termed Multimodal Graph Causal Embedding (MGCE), revealing insights into the crucial causal relations of users' modality-specific interest and conformity in interaction behaviors within MMRec scenarios. Inspired by the colliding effect in causal inference and integrating the characteristics of real interest and conformity, we devise multimodal causal embedding learning networks to facilitate the learning of high-quality causal embeddings (multimodal interest and multimodal conformity embeddings) from both the structure-level and feature-level, yielding state-of-the-art performance. Extensive experimental results on three datasets demonstrate the effectiveness of MGCE. Shuaiyang Li 0001, Feng Xue 0002, Kang Liu 0024, Dan Guo 0001, Richang Hong |
IEEE Trans. Knowl. Data Eng. | 4 |
| 2023 | Multimodal Counterfactual Learning Network for Multimedia-based RecommendationabstractMultimedia-based recommendation (MMRec) utilizes multimodal content (images, textual descriptions, etc.) as auxiliary information on historical interactions to determine user preferences. Most MMRec approaches predict user interests by exploiting a large amount of multimodal contents of user-interacted items, ignoring the potential effect of multimodal content of user-uninteracted items. As a matter of fact, there is a small portion of user preference-irrelevant features in the multimodal content of user-interacted items, which may be a kind of spurious correlation with user preferences, thereby degrading the recommendation performance. In this work, we argue that the multimodal content of user-uninteracted items can be further exploited to identify and eliminate the user preference-irrelevant portion inside user-interacted multimodal content, for example by counterfactual inference of causal theory. Going beyond multimodal user preference modeling only using interacted items, we propose a novel model called Multimodal Counterfactual Learning Network (MCLN), in which user-uninteracted items' multimodal content is additionally exploited to further purify the representation of user preference-relevant multimodal content that better matches the user's interests, yielding state-of-the-art performance. Extensive experiments are conducted to validate the effectiveness and rationality of MCLN. We release the complete codes of MCLN at https://github.com/hfutmars/MCLN. Shuaiyang Li 0001, Dan Guo 0001, Kang Liu 0024, Richang Hong, Feng Xue 0002 |
SIGIR | 2 |
| 2023 | MEGCF: Multimodal Entity Graph Collaborative Filtering for Personalized RecommendationabstractIn most E-commerce platforms, whether the displayed items trigger the user’s interest largely depends on their most eye-catching multimodal content. Consequently, increasing efforts focus on modeling multimodal user preference, and the pressing paradigm is to incorporate complete multimodal deep features of the items into the recommendation module. However, the existing studies ignore the mismatch problem between multimodal feature extraction (MFE) and user interest modeling (UIM) . That is, MFE and UIM have different emphases. Specifically, MFE is migrated from and adapted to upstream tasks such as image classification. In addition, it is mainly a content-oriented and non-personalized process, while UIM, with its greater focus on understanding user interaction, is essentially a user-oriented and personalized process. Therefore, the direct incorporation of MFE into UIM for purely user-oriented tasks, tends to introduce a large number of preference-independent multimodal noise and contaminate the embedding representations in UIM. This paper aims at solving the mismatch problem between MFE and UIM, so as to generate high-quality embedding representations and better model multimodal user preferences. Towards this end, we develop a novel model, m ultimodal e ntity g raph c ollaborative f iltering, short for MEGCF. The UIM of the proposed model captures the semantic correlation between interactions and the features obtained from MFE, thus making a better match between MFE and UIM. More precisely, semantic-rich entities are first extracted from the multimodal data, since they are more relevant to user preferences than other multimodal information. These entities are then integrated into the user-item interaction graph. Afterwards, a symmetric linear Graph Convolution Network (GCN) module is constructed to perform message propagation over the graph, in order to capture both high-order semantic correlation and collaborative filtering signals. Finally, the sentiment information from the review data are used to fine-grainedly weight neighbor aggregation in the GCN, as it reflects the overall quality of the items, and therefore it is an important modality information related to user preferences. Extensive experiments demonstrate the effectiveness and rationality of MEGCF. 1 Kang Liu 0024, Feng Xue 0002, Dan Guo 0001, Le Wu 0001, Shujie Li 0002, Richang Hong |
ACM Trans. Inf. Syst. | 3 |
| 2022 | Visual feature synthesis with semantic reconstructor for traditional and generalized zero-shot object classificationabstractZero-shot learning (ZSL) addresses the novel object recognition problem by leveraging semantic embedding to transfer knowledge from seen categories to unseen categories. Generative ZSL models synthesize the visual features of unseen classes and convert ZSL task into a classical supervised learning problem. These generative ZSL models are trained by using the seen classes. Although promising progress has been achieved in the ZSL and generalized zero-shot learning (GZSL) tasks. The existing approaches still suffer from a strong bias problem between unseen and seen classes, where unseen objects in the target domain tend to be recognized as seen classes in the source domain. To deal with the problem, we propose a novel named semantic consistent Wasserstein generative adversarial network (scWGAN), which uses a semantic reconstructor to reconstruct semantic embeddings from generated visual features by incorporating a novel Semantic Consistent Loss noted L rec . The Semantic Consistent Loss guides our proposed scWGAN to generate visual features that mirror the semantic relationships between seen and unseen classes. We also introduce a visual classifier to constrain visual feature generator. Extensive experiments show that the proposed approach is superior to previous state-of-the-art works under both traditional ZSL and challenging GZSL settings on six popular data sets AWA1, AWA2, CUB, APY, and SUN. Ye Zhao 0001, Xueliang Liu, Dan Guo 0001, Zhenzhen Hu 0004, Hengchang Liu, Yicong Li 0004 |
Int. J. Intell. Syst. | 4 |