Jie Xu 0015

dblp:37/5126-15 · DBLP profile ↗
← Back
17ranked-venue papers
6as first author
13since 2021 · last 2025
0000-0003-3708-2823ORCID · conflict

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

Artificial intelligence and machine learning · 10 · 4 first-author · 7 since 2021Databases, data management, data science and information retrieval · 7 · 2 first-author · 6 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2025 Advancing Session-Based Recommendations with Atten-Mixer+: Dynamic and Adaptive Multi-Level Intent Mining
abstract
Session-Based Recommendation (SBR) systems, traditionally reliant on complex Graph Neural Networks (GNNs), often face challenges with marginal performance improvements despite increased model complexity. In this article, we dissect the classical GNN-based SBR models and empirically find that the sophisticated GNN propagations might be redundant, given the readout module plays a significant role in GNN-based models. Based on this observation, we introduce Atten-Mixer+, an advanced iteration of our previously developed Multi-Level Attention Mixture Network (Atten-Mixer). Atten-Mixer+ forgoes GNN propagation in favor of a dynamic and adaptive readout process, tailored to the unique characteristics of each session. Different from the vanilla version, Atten-Mixer+ features the Adaptive Intent Scaler (AIS) layer, which dynamically determines the depth of multi-level user intent analysis and a soft allocation approach for generating user intent queries across entire user interaction sequences. This innovative design allows Atten-Mixer+ to capture a nuanced and comprehensive understanding of user behaviors, overcoming the limitations of fixed-length analysis. Empirical evaluations on benchmark datasets highlight Atten-Mixer+’s superior efficiency and effectiveness, marking a significant step forward in the predictive accuracy of SBR systems.
Peiyan Zhang, Jiayan Guo, Chaozhuo Li, Liying Kang, Jae Boum Kim, Jie Xu 0015, Xi Zhang 0008, Yan Zhang 0117, Haohan Wang, Sung Hun Kim 0003
ACM Trans. Intell. Syst. Technol.6
2024 Context-Aware Structural Adaptive Graph Neural Networks
Jiakun Chen, Jie Xu 0015, LiQiang Qiao, Feiran Huang, Chaozhuo Li
PRICAI (1)2
2024 Detaching Range from Depth: Personalized Recommendation Meets Personalized PageRank
Jie Xu 0015, Jiakun Chen, LiQiang Qiao, Jilu Wang, Feiran Huang, Chaozhuo Li
PRICAI (1)2
2024 Sinkhorn Distance Minimization for Adaptive Semi-Supervised Social Network Alignment
abstract
Social network alignment, aiming at linking identical identities across different social platforms, is a fundamental task in social graph mining. Most existing approaches are supervised models and require a large number of manually labeled data, which are infeasible in practice considering the yawning gap between social platforms. Recently, isomorphism across social networks is incorporated as complementary to link identities from the distribution level, which contributes to alleviating the dependency on sample-level annotations. Adversarial learning is adopted to learn a shared projection function by minimizing the distance between two social distributions. However, the hypothesis of isomorphism might not always hold true as social user behaviors are generally unpredictable, and thus a shared projection function is insufficient to handle the sophisticated cross-platform correlations. In addition, adversarial learning suffers from training instability and uncertainty, which may hinder model performance. In this article, we propose a novel meta-learning-based social network alignment model Meta-SNA to effectively capture the isomorphism and the unique characteristics of each identity. Our motivation lies in learning a shared meta-model to preserve the global cross-platform knowledge and an adaptor to learn a specific projection function for each identity. Sinkhorn distance is further introduced as the distribution closeness measurement to tackle the limitations of adversarial learning, which owns an explicitly optimal solution and can be efficiently computed by the matrix scaling algorithm. Empirically, we evaluate the proposed model over multiple datasets, and the experimental results demonstrate the superiority of Meta-SNA.
Jie Xu 0015, Chaozhuo Li, Feiran Huang, Zhoujun Li 0001, Xing Xie 0001, Philip S. Yu
IEEE Trans. Neural Networks Learn. Syst.1
2023 Geometry Interaction Augmented Graph Collaborative Filtering
abstract
Graph collaborative filtering, which could capture the abundant collaborative signal from the high-order connectivity of the tree-likeness user-item interaction graph, has received considerable research attention recently. Most graph collaborative filtering methods embed graphs in the Euclidean spaces, but that could have high distortion when embedding graphs with tree-likeness structure. Recently, some researchers address this problem by learning the feature representations in the hyperbolic spaces. However, because the user-item interaction graphs also have cyclic structure, the high-order collaborative signal cannot be well captured by hyperbolic spaces. From this point of view, neither Euclidean spaces nor hyperbolic spaces can capture the full information from the complexity of user-item interactions. Therefore, how to construct a suitable embedding space for graph collaboration filtering is an important problem. In this paper, we analyze the properties of hyperbolic geometry in graph collaborative filtering tasks and proposed a novel geometry interaction augmented graph collaborative filtering (GeoGCF) method, which leverages both Euclidean and hyperbolic geometry to model the user-item interactions. Experimental results show the effectiveness of the proposed method.
Jie Xu 0015, Chaozhuo Li
CIKM1
2023 Generative Sentiment Transfer via Adaptive Masking
Yingze Xie, Jie Xu 0015, LiQiang Qiao, Yun Liu 0017, Feiran Huang, Chaozhuo Li
PAKDD (4)2
2023 Improving Conversational Recommender Systems via Knowledge-Enhanced Temporal Embedding
Jilu Wang, Jie Xu 0015, Wenxiao Liu, Zihong Yang, Feiran Huang, Chaozhuo Li
WISE3
2023 Semi-Supervised Variational User Identity Linkage via Noise-Aware Self-Learning
abstract
User identity linkage, which aims to link identities of a natural person across different social platforms, has attracted increasing research interest recently. Existing approaches usually first embed the identities as deterministic vectors in a shared latent space, and then learn a classifier based on the available annotations. However, the formation and characteristics of real-world social platforms are full of uncertainties, which makes these deterministic embedding based methods sub-optimal. Besides, semi-supervised models utilize the unlabeled data to help capture the intrinsic data distribution. However, the existing semi-supervised linkage methods heavily rely on the heuristically defined similarity measurements to incorporate the innate closeness between labeled and unlabeled samples. Such manually designed assumptions may not be consistent with the actual linkage signals and further introduce the noises. To address the mentioned limitations, in this paper we propose a novel Noise-aware Semi-supervised Variational User Identity Linkage (NSVUIL) model. Specifically, we first propose a novel supervised linkage module to incorporate the available annotations. Each social identity is represented by a Gaussian distribution in the Wasserstein space to simultaneously preserve the fine-grained social profiles and model the uncertainty of identities. Then, a noise-aware self-learning module is designed to faithfully augment the few available annotations, which is capable of filtering noises from the pseudo-labels generated by the supervised module. The filtered reliable candidates are added into the labeled set to provide enhanced training guidance for the next training iteration. Empirically, we evaluate the NSVUIL model over multiple real-world datasets, and the experimental results demonstrate its superiority.
Chaozhuo Li, Senzhang Wang, Jie Xu 0015, Zheng Liu 0011, Hao Wang 0068, Xing Xie 0001, Lei Chen 0002, Philip S. Yu
IEEE Trans. Knowl. Data Eng.3
2022 Visual Sentiment Analysis With Social Relations-Guided Multiattention Networks
abstract
These days, social media users tend to express their feelings through sharing images online. Capturing the emotions embedded in these social images involves great research challenges and practical values. Most existing works concentrate on extracting the visual feature from a global view, while ignoring the fact that visual objects are also rich in emotion. How to leverage the multilevel visual features to improve the sentiment analysis performance is important yet challenging. Besides, existing works view each social image as an independent sample while ignoring the rich correlations among social images, which may be helpful in detecting visual emotion. In this article, we propose a novel model called social relations-guided multiattention networks (SRGMANs) to incorporate both the multilevel (region-level and object-level) visual features of a single image and the correlations among multiple social images to conduct visual sentiment analysis. Specifically, we first construct a heterogeneous network consisting of various types of social relations and introduce a heterogeneous network embedding method to learn the network representation for each image. Then, two visual attention branches (region attention network and object attention network) are devised to extract emotional and discriminative visual features. For each branch, we design a self-attention module to capture the emotional dependencies among visual parts. Besides, a network-guided attention module is also designed in each branch to focus on more network-related emotional visual parts with the guidance of the topology information. Finally, the attended visual features from the two attention models, together with network representation features, are combined within a holistic framework to predict the sentiment of social images. Extensive experiments demonstrate the superiority of our model on three benchmark datasets.
Jie Xu 0015, Zhoujun Li 0001, Feiran Huang, Chaozhuo Li, Philip S. Yu
IEEE Trans. Cybern.1
2021 Hubness-aware User Identity Linkage
abstract
Nowadays, it is common for one natural person to join multiple social networks to enjoy different types of services. User identity linkage (UIL), which aims to link identical identities across different social platforms, has attracted increasing research interests recently. Most existing approaches focus on the sophisticated architecture engineering of the linkage model but ignore the challenge of hubness in the post-processing nearest neighbor search phase. Hubness appears as some identities in a social platform, called hubs, being extra-ordinary close to the identities in the other platform, which will degrade the alignment performance. Different from existing heuristic methods, in this paper we propose a hubness-aware user identity linkage model HAUIL to smoothly learn hubless linkage signals. A carefully-designed objective function is presented to explicitly mitigate the hubness information from the pre-learned linkage guidance. HAUIL can be easily adapted to most existing UIL models. Empirically, we evaluate HAUIL over multiple publicly available datasets, and the experimental results demonstrate its superiority.
Chaozhuo Li, Senzhang Wang, Feiran Huang, Jie Xu 0015, Philip S. Yu
CIKM4
2021 Multimodal Learning of Social Image Representation by Exploiting Social Relations
abstract
Learning the representation for social images has recently made remarkable achievements for many tasks, such as cross-modal retrieval and multilabel classification. However, since social images contain both multimodal contents (e.g., visual images and textual descriptions) and social relations among images, simply modeling the content information may lead to suboptimal embedding. In this paper, we propose a novel multimodal representation learning model for social images, that is, correlational multimodal variational autoencoder (CMVAE) via triplet network. Specifically, in order to mine the highly nonlinear correlation between the visual content and the textual content, a CMVAE is proposed to learn a unified representation for the multiple modalities of social images. Both common information in all modalities and private information in each modality are encoded for the representation learning. To incorporate the social relations among images, we employ the triplet network to embed multiple types of social links in the representation learning. Then, a joint embedding model is proposed to combine the social relations for representation learning of the multimodal contents. Comprehensive experiment results on four datasets confirm the effectiveness of our method in two tasks, namely, multilabel classification and cross-modal retrieval. Our method outperforms the state-of-the-art multimodal representation learning methods with significant improvement of performance.
Feiran Huang, Xiaoming Zhang 0001, Jie Xu 0015, Zhonghua Zhao, Zhoujun Li 0001
IEEE Trans. Cybern.3
2021 Social Image Sentiment Analysis by Exploiting Multimodal Content and Heterogeneous Relations
abstract
In the circumstance of social big data, sentiment analysis is attracting increasing attention for its capacity in understanding individuals' attitudes and feelings. Traditional sentiment analysis methods focus on single modality and become ineffective as enormous data are emerging on the social websites with multiple manifestations. In this article, multimodal learning approaches are proposed to capture the relations between image and text, which only stay at the region level and ignore the fact that the channels are also closely correlated with the semantic information. In addition, social images in the social platforms are closely connected by various types of relations, which are also conducice to sentiment classification but neglected by most existing works. In this article, we propose an attention-based heterogeneous relational model to improve the multimodal sentiment analysis performance by incorporating rich social information. Specifically, we propose a progressive dual attention module to capture the correlations between image and text, and then learn the joint image-text representation from the perspective of content information. A channel attention schema is proposed here to highlight semantically rich image channels and a region attention schema is further designed to highlight the emotional regions based on the attended channels. After that, we construct a heterogeneous relation network and extend graph convolutional network to aggregate the content information from social contexts as complements to learn high-quality representations of social images. Our proposal is thoroughly evaluated on two benchmark datasets, and experimental results demonstrate the superiority of the proposed model.
Jie Xu 0015, Zhoujun Li 0001, Feiran Huang, Chaozhuo Li, Philip S. Yu
IEEE Trans. Ind. Informatics1
2021 Multi-Task Travel Route Planning With a Flexible Deep Learning Framework
abstract
Travel route planning aims to map out a feasible sightseeing itinerary for a traveler covering famous attractions and meeting the tourist's desire. It is very useful for tourists to plan their travel routes when they want to travel at unfamiliar scenic cities. Existing methods for travel route planning mainly concentrate on a single planning problem for a special task, but is not capable of being applied to other tasks. For example, previous must-visit planning methods cannot be applied to the next-point recommendation, despite these two tasks are closely related to each other in travel route planning. Besides, most of the existing work do not consider the important auxiliary information such as Point of Interests (POI) attributes, user preference, and historical route data in their approaches. In this paper, we propose a flexible Multi-task Deep Travel Route Planning framework named MDTRP to integrate rich auxiliary information for more effective planning. Specifically, we first construct a heterogeneous network through the relations between users and POIs and employ a heterogeneous network embedding method to learn the features of users and POIs. Then we present an attention-based deep model to integrate the auxiliary information and focus on important visited points for the prediction of next POIs. Finally, a beam search algorithm is introduced to flexibly generate multiple feasible route candidates for three types of planning tasks (next-point recommendation, general route planning, and must-visit planning). We introduce six public datasets to conduct extensive experiments, of which the results demonstrate the flexibility and superiority of the proposed approach in travel route planning.
Feiran Huang, Jie Xu 0015, Jian Weng 0001
IEEE Trans. Intell. Transp. Syst.2
2019 Network embedding by fusing multimodal contents and links
Feiran Huang, Xiaoming Zhang 0001, Jie Xu 0015, Chaozhuo Li, Zhoujun Li 0001
Knowl. Based Syst.3
2019 Image-text sentiment analysis via deep multimodal attentive fusion
Feiran Huang, Xiaoming Zhang 0001, Zhonghua Zhao, Jie Xu 0015, Zhoujun Li 0001
Knowl. Based Syst.4
2019 Visual-textual sentiment classification with bi-directional multi-level attention networks
Jie Xu 0015, Feiran Huang, Xiaoming Zhang 0001, Senzhang Wang, Chaozhuo Li, Zhoujun Li 0001, Yueying He
Knowl. Based Syst.1
2017 DTRP: A Flexible Deep Framework for Travel Route Planning
Jie Xu 0015, Chaozhuo Li, Senzhang Wang, Feiran Huang, Zhoujun Li 0001, Yueying He, Zhonghua Zhao
WISE (1)1