Xue Dong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Xue Dong has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Xuemeng Song
Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, China
4 shared publications - Jianlong Wu
Harbin Institute of Technology, Shenzhen, Shenzhen, China and Shenzhen Loop Area Institute, Shenzhen, China
2 shared publications - Liqiang Nie
Harbin Institute of Technology (Shenzhen), Shenzhen, China
2 shared publications - Biao Li
Kuaishou Technology, Beijing, China
1 shared publication - Chuanhou Sun
School of Computer Science and Engineering, Northeastern University, Shenyang, Liaoning, China
1 shared publication - Hongjun Dai
Shandong University
1 shared publication
Latest Publications
- 22 January 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (4)
TaNSP: An efficient target pattern mining algorithm based on negative sequential pattern
- 22 January 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (4)
TaNSP: An efficient target pattern mining algorithm based on negative sequential pattern
- 23 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 47 (8) , 6876-6887
Prompt-Based Multi-Interest Learning Method for Sequential Recommendation
Multi-interest learning method for sequential recommendation aims to predict the next item according to user multi-faceted interests given the user historical interactions. Existing methods mainly consist of a multi-interest extractor that embeds the user interactions into the user multi-interest embeddings, and a multi-interest aggregator that aggregates the learned multi-interest embeddings to the final user embedding, used for predicting the user rating to an item. Despite their effectiveness, existing methods have two key limitations: 1) they directly feed the user interactions into the multi-interest extractor and aggregator, while ignoring their different learning objectives, and 2) they merely consider the centrality of the user interactions to capture the user interests, while overlooking their dispersion. To tackle these limitations, we propose a prompt-based multi-interest learning method (PoMRec), where specific prompts are inserted into the inputted user interactions to make them adaptive to the multi-interest extractor and aggregator. Moreover, we utilize both the mean and variance embeddings of user interactions to embed the user multiple interests for the comprehensively user interest learning. We conduct extensive experiments on three public datasets, and the results verify that our proposed PoMRec outperforms the state-of-the-art multi-interest learning methods.
- 23 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 47 (8) , 6876-6887
Prompt-Based Multi-Interest Learning Method for Sequential Recommendation
Multi-interest learning method for sequential recommendation aims to predict the next item according to user multi-faceted interests given the user historical interactions. Existing methods mainly consist of a multi-interest extractor that embeds the user interactions into the user multi-interest embeddings, and a multi-interest aggregator that aggregates the learned multi-interest embeddings to the final user embedding, used for predicting the user rating to an item. Despite their effectiveness, existing methods have two key limitations: 1) they directly feed the user interactions into the multi-interest extractor and aggregator, while ignoring their different learning objectives, and 2) they merely consider the centrality of the user interactions to capture the user interests, while overlooking their dispersion. To tackle these limitations, we propose a prompt-based multi-interest learning method (PoMRec), where specific prompts are inserted into the inputted user interactions to make them adaptive to the multi-interest extractor and aggregator. Moreover, we utilize both the mean and variance embeddings of user interactions to embed the user multiple interests for the comprehensively user interest learning. We conduct extensive experiments on three public datasets, and the results verify that our proposed PoMRec outperforms the state-of-the-art multi-interest learning methods.
- 11 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (7) , 6712-6725
Preview-Based Category Contrastive Learning for Knowledge Distillation
Knowledge distillation is a mainstream algorithm in model compression by transferring knowledge from the larger model (teacher) to the smaller model (student) to improve the performance of student. Despite many efforts, existing methods mainly investigate the consistency between instance-level feature representation or prediction, which neglects the category-level information and the difficulty of each sample, leading to undesirable performance. To address these issues, we propose a novel preview-based category contrastive learning method for knowledge distillation (PCKD). It first distills the structural knowledge of both instance-level feature correspondence and the relation between instance features and category centers in a contrastive learning fashion, which can explicitly optimize the category representation and explore the distinct correlation between representations of instances and categories, contributing to discriminative category centers and better classification results. Besides, we introduce a novel preview strategy to dynamically determine how much the student should learn from each sample according to their difficulty. Different from existing methods that treat all samples equally and curriculum learning that simply filters out hard samples, our method assigns a small weight for hard instances as a preview to better guide the student training. Extensive experiments on several challenging datasets, including CIFAR-100, ImageNet and Pascal VOC, demonstrate the superiority over state-of-the-art methods.
- 11 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (7) , 6712-6725
Preview-Based Category Contrastive Learning for Knowledge Distillation
Knowledge distillation is a mainstream algorithm in model compression by transferring knowledge from the larger model (teacher) to the smaller model (student) to improve the performance of student. Despite many efforts, existing methods mainly investigate the consistency between instance-level feature representation or prediction, which neglects the category-level information and the difficulty of each sample, leading to undesirable performance. To address these issues, we propose a novel preview-based category contrastive learning method for knowledge distillation (PCKD). It first distills the structural knowledge of both instance-level feature correspondence and the relation between instance features and category centers in a contrastive learning fashion, which can explicitly optimize the category representation and explore the distinct correlation between representations of instances and categories, contributing to discriminative category centers and better classification results. Besides, we introduce a novel preview strategy to dynamically determine how much the student should learn from each sample according to their difficulty. Different from existing methods that treat all samples equally and curriculum learning that simply filters out hard samples, our method assigns a small weight for hard instances as a preview to better guide the student training. Extensive experiments on several challenging datasets, including CIFAR-100, ImageNet and Pascal VOC, demonstrate the superiority over state-of-the-art methods.
- 31 August 2023
- Published by Elsevier in Information Fusion
- Vol. 101
Prompt-based and weak-modality enhanced multimodal recommendation
- 31 August 2023
- Published by Elsevier in Information Fusion
- Vol. 101
Prompt-based and weak-modality enhanced multimodal recommendation
- 10 July 2023
- Published by Elsevier in Information Sciences
- Vol. 646
Latent evolution model for change point detection in time-varying networks
- 10 July 2023
- Published by Elsevier in Information Sciences
- Vol. 646
Latent evolution model for change point detection in time-varying networks
- Open Access
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 366-370
Divide and Conquer: Towards Better Embedding-based Retrieval for Recommender Systems from a Multi-task Perspective
Embedding-based retrieval (EBR) methods are widely used in modern recommender systems thanks to its simplicity and effectiveness. However, along the journey of deploying and iterating on EBR in production, we still identify some fundamental issues in existing methods. First, when dealing with large corpus of candidate items, EBR models often have difficulties in balancing the performance on distinguishing highly relevant items (positives) from both irrelevant ones (easy negatives) and from somewhat related yet not competitive ones (hard negatives). Also, we have little control in the diversity and fairness of the retrieval results because of the “greedy” nature of nearest vector search. These issues compromise the performance of EBR methods in large-scale industrial scenarios. This paper introduces a simple and proven-in-production solution to overcome these issues. The proposed solution takes a divide-and-conquer approach: the whole set of candidate items are divided into multiple clusters and we run EBR to retrieve relevant candidates from each cluster in parallel; top candidates from each cluster are then combined by some controllable merging strategies. This approach allows our EBR models to only concentrate on discriminating positives from mostly hard negatives. It also enables further improvement from a multi-tasking learning (MTL) perspective: retrieval problems within each cluster can be regarded as individual tasks; inspired by recent successes in prompting and prefix-tuning, we propose an efficient task adaption technique further boosting the retrieval performance within each cluster with negligible overheads. The presented solution has been deployed in Kuaishou, one of the most popular short-video streaming platforms in China with hundreds of millions of active users.
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 366-370
Open AccessDivide and Conquer: Towards Better Embedding-based Retrieval for Recommender Systems from a Multi-task Perspective
Embedding-based retrieval (EBR) methods are widely used in modern recommender systems thanks to its simplicity and effectiveness. However, along the journey of deploying and iterating on EBR in production, we still identify some fundamental issues in existing methods. First, when dealing with large corpus of candidate items, EBR models often have difficulties in balancing the performance on distinguishing highly relevant items (positives) from both irrelevant ones (easy negatives) and from somewhat related yet not competitive ones (hard negatives). Also, we have little control in the diversity and fairness of the retrieval results because of the “greedy” nature of nearest vector search. These issues compromise the performance of EBR methods in large-scale industrial scenarios. This paper introduces a simple and proven-in-production solution to overcome these issues. The proposed solution takes a divide-and-conquer approach: the whole set of candidate items are divided into multiple clusters and we run EBR to retrieve relevant candidates from each cluster in parallel; top candidates from each cluster are then combined by some controllable merging strategies. This approach allows our EBR models to only concentrate on discriminating positives from mostly hard negatives. It also enables further improvement from a multi-tasking learning (MTL) perspective: retrieval problems within each cluster can be regarded as individual tasks; inspired by recent successes in prompting and prefix-tuning, we propose an efficient task adaption technique further boosting the retrieval performance within each cluster with negligible overheads. The presented solution has been deployed in Kuaishou, one of the most popular short-video streaming platforms in China with hundreds of millions of active users.
- Open Access
- 7 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (3) , 1-22
Dual Preference Distribution Learning for Item Recommendation
Recommender systems can automatically recommend users with items that they probably like. The goal of them is to model the user-item interaction by effectively representing the users and items. Existing methods have primarily learned the user’s preferences and item’s features with vectorized embeddings, and modeled the user’s general preferences to items by the interaction of them. In fact, users have their specific preferences to item attributes and different preferences are usually related. Therefore, exploring the fine-grained preferences as well as modeling the relationships among user’s different preferences could improve the recommendation performance. Toward this end, we propose a dual preference distribution learning framework (DUPLE) , which aims to jointly learn a general preference distribution and a specific preference distribution for a given user, where the former corresponds to the user’s general preference to items and the latter refers to the user’s specific preference to item attributes. Notably, the mean vector of each Gaussian distribution can capture the user’s preferences, and the covariance matrix can learn their relationship. Moreover, we can summarize a preferred attribute profile for each user, depicting his/her preferred item attributes. We then can provide the explanation for each recommended item by checking the overlap between its attributes and the user’s preferred attribute profile. Extensive quantitative and qualitative experiments on six public datasets demonstrate the effectiveness and explainability of the DUPLE method.
- 7 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (3) , 1-22
Open AccessDual Preference Distribution Learning for Item Recommendation
Recommender systems can automatically recommend users with items that they probably like. The goal of them is to model the user-item interaction by effectively representing the users and items. Existing methods have primarily learned the user’s preferences and item’s features with vectorized embeddings, and modeled the user’s general preferences to items by the interaction of them. In fact, users have their specific preferences to item attributes and different preferences are usually related. Therefore, exploring the fine-grained preferences as well as modeling the relationships among user’s different preferences could improve the recommendation performance. Toward this end, we propose a dual preference distribution learning framework (DUPLE) , which aims to jointly learn a general preference distribution and a specific preference distribution for a given user, where the former corresponds to the user’s general preference to items and the latter refers to the user’s specific preference to item attributes. Notably, the mean vector of each Gaussian distribution can capture the user’s preferences, and the covariance matrix can learn their relationship. Moreover, we can summarize a preferred attribute profile for each user, depicting his/her preferred item attributes. We then can provide the explanation for each recommended item by checking the overlap between its attributes and the user’s preferred attribute profile. Extensive quantitative and qualitative experiments on six public datasets demonstrate the effectiveness and explainability of the DUPLE method.
- 16 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (1) , 246-257
TryonCM2: Try-on-Enhanced Fashion Compatibility Modeling Framework
Recently, fashion compatibility modeling, which can score the matching degree of several complementary fashion items, has gained increasing research attention. Previous studies have primarily learned the features of fashion items and utilize their interaction as the fashion compatibility. However, the try-on looking of an outfit help us to learn the fashion compatibility in a combined manner, where items are spatially distributed and partially covered by other items. Inspired by this, we design a try-on-enhanced fashion compatibility modeling framework, named TryonCM2, which incorporates the try-on appearance with the item interaction to enhance the fashion compatibility modeling. Specifically, we treat each outfit as a sequence of items and adopt the bidirectional long short-term memory (LSTM) network to capture the latent interaction of fashion items. Meanwhile, we synthesize a try-on template image to depict the try-on appearance of an outfit. And then, we regard the outfit as a sequence of multiple image stripes, i.e., local content, of the try-on template, and adopt the bidirectional LSTM network to capture the contextual structure in the try-on appearance. Ultimately, we combine the fashion compatibility lying in the item interaction and try-on appearance as the final compatibility of the outfit. Both the objective and subjective experiments on the existing FOTOS dataset demonstrate the superiority of our framework over the state-of-the-art methods.
- 16 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (1) , 246-257
TryonCM2: Try-on-Enhanced Fashion Compatibility Modeling Framework
Recently, fashion compatibility modeling, which can score the matching degree of several complementary fashion items, has gained increasing research attention. Previous studies have primarily learned the features of fashion items and utilize their interaction as the fashion compatibility. However, the try-on looking of an outfit help us to learn the fashion compatibility in a combined manner, where items are spatially distributed and partially covered by other items. Inspired by this, we design a try-on-enhanced fashion compatibility modeling framework, named TryonCM2, which incorporates the try-on appearance with the item interaction to enhance the fashion compatibility modeling. Specifically, we treat each outfit as a sequence of items and adopt the bidirectional long short-term memory (LSTM) network to capture the latent interaction of fashion items. Meanwhile, we synthesize a try-on template image to depict the try-on appearance of an outfit. And then, we regard the outfit as a sequence of multiple image stripes, i.e., local content, of the try-on template, and adopt the bidirectional LSTM network to capture the contextual structure in the try-on appearance. Ultimately, we combine the fashion compatibility lying in the item interaction and try-on appearance as the final compatibility of the outfit. Both the objective and subjective experiments on the existing FOTOS dataset demonstrate the superiority of our framework over the state-of-the-art methods.
- Open Access
- 18 May 2021
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 35 (18) , 15939-15940
Improving the Morphology and Control Policy of Self-reconfiguring Modular Robots in Dynamic Environment (Student Abstract)
Ideally, self-reconfiguration modular robots (SMR) can change their morphology and perform actions related to a specific task in any scene. However, most SMRs only adapt to several specific scenes because their morphology and control policies are designed or trained based on these scenes. Once SMRs meet an unknown scene, especially multiply unknown scenes (called dynamic environment), these policies will be useless. Although some of these policies import evolutionary algorithms to enhance the ability of SMR to explore unknown scenes, they are very time-consuming. The reason is that individual fitness depends on the interaction between SMR and these scenes. We propose a two-stage reconfiguration algorithm (TSRA) without any prior knowledge to address the time-consuming problem. In the two stages, the reconfiguration methods use the evolutionary algorithm (GA) to simultaneously generate scene-fitted morphology and actions. The first stage method uses the estimation neural network to evaluate the individual fitness to run faster and can recommend better policies to the second stage. The second stage method obtains this fitness from scenes and updates the neural network to approximate these scenes. Through experiments, TSRA can find better morphology and control policies than the other two canonical algorithms --- GA and GEM-RL.
- 18 May 2021
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 35 (18) , 15939-15940
Open AccessImproving the Morphology and Control Policy of Self-reconfiguring Modular Robots in Dynamic Environment (Student Abstract)
Ideally, self-reconfiguration modular robots (SMR) can change their morphology and perform actions related to a specific task in any scene. However, most SMRs only adapt to several specific scenes because their morphology and control policies are designed or trained based on these scenes. Once SMRs meet an unknown scene, especially multiply unknown scenes (called dynamic environment), these policies will be useless. Although some of these policies import evolutionary algorithms to enhance the ability of SMR to explore unknown scenes, they are very time-consuming. The reason is that individual fitness depends on the interaction between SMR and these scenes. We propose a two-stage reconfiguration algorithm (TSRA) without any prior knowledge to address the time-consuming problem. In the two stages, the reconfiguration methods use the evolutionary algorithm (GA) to simultaneously generate scene-fitted morphology and actions. The first stage method uses the estimation neural network to evaluate the individual fitness to run faster and can recommend better policies to the second stage. The second stage method obtains this fitness from scenes and updates the neural network to approximate these scenes. Through experiments, TSRA can find better morphology and control policies than the other two canonical algorithms --- GA and GEM-RL.