XWXiang Wu

Xiang Wu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xiang Wu has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    H-Mem: Hawkes-driven Adaptive Forgetting for Long-Horizon Agent Memory

    by Xiang Wu, Hongchao Qin, Guang Zeng, Rong-Hua Li, Kangfei Zhao

  • ScaDyG: A New Paradigm for Large-Scale Dynamic Graph Learning

    by Xiang Wu, Xunkai Li, Rong-Hua Li, Kangfei Zhao, Guoren Wang

    Dynamic graphs (DGs), which capture time-evolving relationships between graph entities, have widespread real-world applications. To efficiently encode DGs for downstream tasks, most DG neural networks (DGNNs) follow the traditional message-passing mechanism and extend it with time-based techniques. Despite their effectiveness, the growth of historical interactions introduces significant scalability issues, particularly in industry scenarios. To address this limitation, we propose ScaDyG, with the core idea of designing a time-aware scalable learning paradigm as follows: 1) time-aware topology reformulation (TTR): ScaDyG first segments historical interactions into time steps (intra and inter) based on dynamic modeling, enabling weight-free and time-aware graph propagation within preprocessing; 2) dynamic temporal encoding (DTE): To further achieve fine-grained graph propagation within time steps, ScaDyG integrates temporal encoding through a combination of exponential functions in a scalable manner; and 3) hypernetwork-driven message aggregation: after obtaining the propagated features (i.e., messages), ScaDyG utilizes a hypernetwork to analyze historical dependencies, implementing node-wise representation by an adaptive temporal fusion. Extensive experiments on 12datasets demonstrate that ScaDyG performs comparably or even outperforms other SOTA methods in both node and link-level downstream tasks, with fewer learnable parameters and higher efficiency. Our code is available at https://github.com/BITNEO/ScaDyG


  • GRPCI: Harnessing Temporal-Spatial Dynamics for Graph Representation Learning

    by Xiang Wu, Rong-Hua Li, Zhaoxin Fan, Kai Chen, Yujin Gao, Hongchao Qin, Guoren Wang

    Temporal interactions form the crux of numerous real-world scenarios, thus necessitating effective modeling in temporal graph representation learning. Despite extensive research within this domain, we identify a significant oversight in current methodologies: the temporal-spatial dynamics in graphs, encompassing both structural and temporal coherence, remain largely unaddressed. In an effort to bridge this research gap, we present a novel framework termed Graph Representation learning enhanced by Periodic and Community Interactions (GRPCI). GRPCI consists of two primary mechanisms devised explicitly to tackle the aforementioned challenge. Firstly, to utilize latent temporal dynamics, we propose a novel periodicity-based neighborhood aggregation mechanism that underscores neighbors engaged in a periodic interaction pattern. This mechanism seamlessly integrates the element of periodicity into the model. Secondly, to exploit structural dynamics, we design a novel contrastive-based local community representation learning mechanism. This mechanism features a heuristic dynamic contrastive pair sampling strategy aimed at enhancing the modeling of the latent distribution of local communities within the graphs. Through the incorporation of these two mechanisms, GRPCI markedly augments the performance of graph networks. Empirical evaluations, conducted via a temporal link prediction task across five real-life datasets, attest to the superior performance of GRPCI in comparison to existing state-of-the-art methodologies. The results of this study validate the efficacy of GRPCI, thereby establishing a new benchmark for future research in the field of temporal graph representation learning. Our findings underscore the importance of considering both temporal and structural consistency in temporal graph learning, and advocate for further exploration of this paradigm.

  • Encoding Group Interests With Persistent Homology for Personalized Search

    by Yuchen Meng, Rong-Hua Li, Hongchao Qin, Xiang Wu, Huanzhong Duan, Yanxiong Lu, Guoren Wang

    Personalized search aims to customize search results based on users’ search history. The key of personalized search is to learn the representations of users’ interests from users’ search history. The state-of-the-art personalized search methods often encode group-level features of similar users to improve personalized search. However, existing group-level feature encoding methods are sensitive to noisy users, which are often contained in real-world search data. To overcome this problem, we propose a novel approach to encode group features based on a topological data analysis technique, namely, persistent homology analysis. Such topological features are typically robust to noisy data, thus can improve the personalized search quality. To the best of our knowledge, we are the first to use topological features for improving personalized Web search. We conduct extensive experiments on two real-life datasets to evaluate the proposed approach; and the results show that our solution is significantly better than the state-of-the-art personalized search models in terms of several widely used precision measures.


  • Effective Personalized Search With Heterogeneous Graph Based Hawkes Process

    by Xiang Wu, Hongchao Qin, Rong-Hua Li, Yuchen Meng, Huanzhong Duan, Yanxiong Lu, Yujing Gao, Fusheng Jin, Guoren Wang

    Personalized search aims at re-ranking search results with reference to users’ background information. The state-of-the-art personalized search methods often consider both the short-term search interests from current session behaviors and the long-term search interests from previous session behaviors. However, sessions in real-world search scenarios are usually very short, and a large number of sessions contain only one query, which makes it difficult to model short-term search interests. Intuitively, apart from current session behaviors, some recent historical session behaviors could also contribute to the current search interests, and the influence of these behaviors typically decays over time. Based on this intuition, we propose a novel heterogeneous graph based Hawkes process to improve the effectiveness of personalized search. Specifically, we first construct a heterogeneous graph to model multiple relations between users, queries, and documents. Then, we propose a heterogeneous graph neural network based algorithm to encode the representations of users’ historical search behaviors. After that, we develop a multivariate Hawkes process to capture the influence of historical search behaviors on the current search intent. Our approach can dynamically model the influence of historical behaviors in a continuous time space. Thus, both the current session behaviors and the historical session behaviors can be utilized to characterize a more accurate current search intent. We evaluate our method using three real-life datasets, and the results show that our approach significantly outperforms the state-of-the-art methods in terms of several widely-used precision metrics.