Yong Wang 0046

dblp:84/2694-46 · DBLP profile ↗
← Back
13ranked-venue papers in the field
0as first author
13since 2021 · last 2026
0000-0002-8699-8355ORCID · conflict

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 6Information Retrieval & Web Search · 6Database Systems & Data Management · 1
YearPublicationVenuePosition
2026 TAMEing Long Contexts in Personalization: Towards Training-Free and State-Aware MLLM Personalized Assistant
abstract
Multimodal Large Language Model (MLLM) Personalization is a critical research problem that facilitates personalized dialogues with MLLMs targeting specific entities (known as personalized concepts). However, existing methods and benchmarks focus on the simple, context-agnostic visual identification and textual replacement of the personalized concept (e.g., "A yellow puppy" -> "Your puppy Mochi"), overlooking the ability to support long-context conversations. An ideal personalized MLLM assistant is capable of engaging in long-context dialogues with humans and continually improving its experience quality by learning from past dialogue histories. To bridge this gap, we propose LCMP, the first Long-Context MLLM Personalization evaluation benchmark. LCMP assesses the capability of MLLMs in perceiving variations of personalized concepts and generating contextually appropriate personalized responses that reflect these variations. As a strong baseline for LCMP, we introduce a novel training-free and state-aware framework TAME. TAME endows MLLMs with double memories to manage the temporal and persistent variations of each personalized concept in a differentiated manner. In addition, TAME incorporates a new training-free Retrieve-then-Align Augmented Generation (RA2G) paradigm. RA2G introduces an alignment step to extract the contextually fitted information from the multi-memory retrieved knowledge to the current questions, enabling better interactions for complex real-world user queries. Experiments on LCMP demonstrate that TAME achieves the best performance, showcasing remarkable and evolving interaction experiences in long-context scenarios.
Rongpei Hong, Jian Lang, Ting Zhong, Yong Wang 0046, Fan Zhou 0002
KDD (1)4
2026 Nip Rumors in the Bud: Retrieval-Guided Topic-Level Adaptation for Test-Time Fake News Video Detection
Jian Lang, Rongpei Hong, Ting Zhong, Yong Wang 0046, Fan Zhou 0002
KDD (1)4
2026 Tracing paths, pruning noise: Toward robust IP geolocation via topology-guided shaping and refinement
Xueting Liu 0005, Wenxin Tai, Ting Zhong, Yong Wang 0046, Kai Chen 0005, Fan Zhou 0002
Inf. Process. Manag.4
2026 Invariant learning improves out-of-distribution generalization for IP geolocation
Xueting Liu 0005, Wenxin Tai, Joojo Walker, Yong Wang 0046, Kai Chen 0005, Fan Zhou 0002
Inf. Process. Manag.5
2025 Generative Thinking, Corrective Action: User-Friendly Composed Image Retrieval via Automatic Multi-Agent Collaboration
abstract
Zero-shot composed image retrieval (ZS-CIR) is a challenging task that aims to retrieve images similar to a composed query of a reference image and a description, without relying on training on triplet datasets. Existing methods for this task often rely on predefined, fixed retrieval processes that combine the image and the modified text through hand-crafted templates, which suffer from two main issues: non-adaptive retrieval queries and user-unfriendly retrieval processes. To address these limitations, we propose a novel framework - Automatic Multi-Agent Collaboration for Zero-Shot Composed Image Retrieval (AutoCIR). AutoCIR consists of three training-free agents - a planner, a retriever, and a corrector - that work together to iteratively identify and rectify mismatches. The planner guides the retriever by generating a customized target caption for the composed query and further refines this caption to resolve any semantic discrepancies based on feedback. The corrector, equipped with a chain-of-thought reasoning mechanism, conducts an in-depth evaluation of the retrieved results and generates appropriate self-correction actions. Extensive experiments on three benchmarks demonstrate that AutoCIR consistently outperforms previous competitive methods for ZS-CIR.
Zhangtao Cheng, Jian Lang, Kunpeng Zhang 0001, Ting Zhong, Yong Wang 0046, Fan Zhou 0002
KDD (2)6
2025 REDEEMing Modality Information Loss: Retrieval-Guided Conditional Generation for Severely Modality Missing Learning
abstract
Traditional multimodal learning approaches often assume that all modalities are available during both the training and inference phases. However, this assumption is often impractical in real-world scenarios due to challenges such as sensor failures, data corruption, or privacy concerns. While recent efforts focus on enhancing the robustness of pre-trained Multimodal Transformers (MTs) under missing modality conditions, mainstream work in this field often overlook reconstructing the missing modalities and rely on static, sample-agnostic prompt-tuning techniques, undermining their efficacy in severe modality missing scenarios. To address these limitations, we propose REDEEM, a novel REtrieval-guiDEd conditional gEnerative fraMework that largely alleviates the modality missing problems on pre-trained MTs. REDEEM consists of a new adaptive retrieval mechanism to identify relevant instances for both modality-complete and -incomplete samples. It then conditions on the remaining modalities and utilizes the retrieved data as experts to effectively recover the missing ones in modality-incomplete instances through a within-modal reconstruction manner. Finally, REDEEM generates sample-aware inter-modal prompts from the retrieved instances to guide MTs in tackling severe modality missing challenges. Comprehensive experiments on three diverse multimodal classification benchmarks demonstrate that REDEEM significantly outperforms competitive baselines.
Jian Lang, Rongpei Hong, Zhangtao Cheng, Ting Zhong, Yong Wang 0046, Fan Zhou 0002
KDD (2)5
2025 Echoes in the Feed: Evolution-aware Prompt-augmented Micro-video Popularity Prediction
abstract
Micro-video popularity prediction (MVPP) is a crucial research topic with important implications for social media marketing and stakeholders. Current works in MVPP utilized the pre-trained vision-language models (PVLs) to model the multimodal features for prediction, failing to capture the evolving popularity trend in micro-videos and leading to suboptimal results. To tackle this limitation, we propose EvoPro, an Evolution-aware Prompt-augmented framework that enhances MVPP. First, inspired by the powerful multimodal understanding and text generation skills of Large Multimodal Models (LMMs), an LMM-driven generative retriever is proposed to create contextually rich retrieval queries and perform precise video-to-video retrieval, forming dynamic micro-video support sets that effectively reflect evolving patterns. Building upon this, a graph-based prompter generates evolutionary prompts by capturing the relational structures within the support set. These prompts, representing the latest trend dynamics, serve as few-shot examples to guide PVLs. By integrating evolutionary prompts, the PVLs are empowered to model the evolving popularity trends more accurately, yielding stronger and more predictive representations. Extensive experiments conducted on three benchmarks demonstrate that EvoPro significantly outperforms competitive baselines.
Jian Lang, Zhangtao Cheng, Yong Wang 0046, Fan Zhou 0002
SIGIR5
2024 Analyzing and Mitigating Repetitions in Trip Recommendation
abstract
Trip recommendation has emerged as a highly sought-after service over the past decade. Although current studies significantly understand human intention consistency, they struggle with undesired repetitive outcomes that need resolution. We make two pivotal discoveries using statistical analyses and experimental designs: (1) The occurrence of repetitions is intricately linked to the models and decoding strategies. (2) During training and decoding, adding perturbations to logits can reduce repetition. Motivated by these observations, we introduce AR-Trip (Anti Repetition for Trip Recommendation), which incorporates a cycle-aware predictor comprising three mechanisms to avoid duplicate Points-of-Interest (POIs) and demonstrates their effectiveness in alleviating repetition. Experiments on four public datasets illustrate that AR-Trip successfully mitigates repetition issues while enhancing precision.
Wenzheng Shu, Kangqi Xu, Wenxin Tai, Ting Zhong, Yong Wang 0046, Fan Zhou 0002
SIGIR5
2024 Self-Explainable Next POI Recommendation
abstract
Point-of-Interest (POI) recommendation involves predicting users' next preferred POI and is becoming increasingly significant in location-based social networks. However, users are often reluctant to trust recommended results due to the lack of transparency in these systems. While recent work on explaining recommender systems has gained attention, prevailing methods only provide post-hoc explanations based on results or rudimentary explanations according to attention scores. Such limitations hinder reliability and applicability in risk-sensitive scenarios. Inspired by the information theory, we propose a self-explainable framework with an ante-hoc view called \M~for next POI recommendation aimed at overcoming these limitations. Specifically, we endow self-explainability to POI recommender systems through compact representation learning using a variational information bottleneck approach. The learned representation further improves accuracy by reducing redundancy behind massive spatial-temporal trajectories, which, in turn, boosts the recommendation performance. Experiments on three real-world datasets show significant improvements in both model explainability and recommendation performance.
Yi Yang 0042, Qiang Gao 0003, Ting Zhong, Yong Wang 0046, Fan Zhou 0002
SIGIR5
2023 TrustGeo: Uncertainty-Aware Dynamic Graph Learning for Trustworthy IP Geolocation
abstract
The rising popularity of online social network services has attracted a lot of research focusing on mining various user patterns. Among them, accurate IP geolocation is essential for a plethora of location-aware applications. However, despite extensive research efforts and significant advances, the "accurate and reliable'' desideratum is yet to be achieved at a higher quality level. This work presents a graph neural network (GNN)-based model, called TrustGeo, for trustworthy street-level IP geolocation. A distinct and important aspect of TrustGeo is the incorporation of sources of uncertainty in the learning process. The results of our extensive experimental evaluations on three real-world datasets demonstrate the superiority of our framework in significantly improving the accuracy and trustworthiness of street-level IP geolocation. Our code and datasets are available at https://github.com/ICDM-UESTC/TrustGeo.
Wenxin Tai, Bin Chen 0030, Fan Zhou 0002, Ting Zhong, Goce Trajcevski, Yong Wang 0046, Kai Chen 0005
KDD6
2023 RIPGeo: Robust Street-Level IP Geolocation
abstract
IP geolocation refers to the process of determining the geographic locations of Internet Protocol (IP) addresses, which is important for mobile computing and spatial data management. Despite extensive research efforts, a client-independent geolocation service with high accuracy and reliability has not yet been developed. This paper presents a graph neural network (GNN) model, dubbed RIPGeo, for robust street-level IP geolocation. Three factors that affect data quality are identified, and the importance of considering data quality in algorithm development is emphasized. Two novel self-supervised perturbational training strategies are proposed to enhance the generalization and robustness of the model. A multi-task learning framework is introduced to solve the homogenized representation problem caused by perturbational training, demonstrating much more efficiency than prevailing solutions. Theoretical analysis and experimental results demonstrate the superiority of our framework in significantly improving the accuracy and stability of street-level IP geolocation.
Wenxin Tai, Bin Chen 0030, Ting Zhong, Yong Wang 0046, Kai Chen 0005, Fan Zhou 0002
MDM4
2022 Connecting the Hosts: Street-Level IP Geolocation with Graph Neural Networks
abstract
Pinpointing the geographic location of an IP address is important for a range of location-aware applications spanning from targeted advertising to fraud prevention. The majority of traditional measurement-based and recent learning-based methods either focus on the efficient employment of topology or utilize data mining to find clues of the target IP in publicly available sources. Motivated by the limitations in existing works, we propose a novel framework named GraphGeo, which provides a complete processing methodology for street-level IP geolocation with the application of graph neural networks. It incorporates IP hosts knowledge and kinds of neighborhood relationships into the graph to infer spatial topology for high-quality geolocation prediction. We explicitly consider and alleviate the negative impact of uncertainty caused by network jitter and congestion, which are pervasive in complicated network environments. Extensive evaluations across three large-scale real-world datasets demonstrate that GraphGeo significantly reduces the geolocation errors compared to the state-of-the-art methods. Moreover, the proposed framework has been deployed on the web platform as an online service for 6 months.
Zhiyuan Wang 0006, Fan Zhou 0002, Wenxuan Zeng, Goce Trajcevski, Chunjing Xiao, Yong Wang 0046, Kai Chen 0005
KDD6
2021 Vector-Quantized Autoencoder With Copula for Collaborative Filtering
abstract
In theory, the variational auto-encoder (VAE) is not suitable for recommendation tasks, although it has been successfully utilized for collaborative filtering (CF) models. In this paper, we propose a Gaussian Copula-Vector Quantized Autoencoder (GC-VQAE) model that differs prior arts in two key ways: (1) Gaussian Copula helps to model the dependencies among latent variables which are used to construct a more complex distribution compared with the mean-field theory; and (2) by incorporating a vector quantisation method into encoders our model can learn discrete representations which are consistent with the observed data rather than directly sampling from the simple Gaussian distributions. Our approach is able to circumvent the "posterior collapse'' issue and break the prior constraint to improve the flexibility of latent vector encoding and learning ability. Empirically, GC-VQAE can significantly improve the recommendation performance compared to existing state-of-the-art methods.
Guanyu Wang 0006, Ting Zhong, Xovee Xu, Kunpeng Zhang 0001, Fan Zhou 0002, Yong Wang 0046
CIKM6