Accurate medical time series (MedTS) classification is essential for effective clinical diagnosis, yet remains challenging due to complex multi-channel temporal dependencies, information redundancy, and label scarcity. While transformer-based models have shown promise in time series analysis, most are designed for forecasting tasks and fail to fully exploit the unique characteristics of MedTS. In this paper, we introduce MedSpaformer, a transformer-based framework tailored for MedTS classification. It incorporates a sparse token-based dual-attention mechanism that enables global context modeling and token sparsification, allowing dynamic feature refinement by focusing on informative tokens while reducing redundancy. This mechanism is integrated into a multi-granularity cross-channel encoding scheme to capture intra- and inter-granularity temporal dependencies and inter-channel correlations, enabling progressive refinement of task-relevant patterns in medical signals. The sparsification design allows our model to flexibly accommodate inputs with variable lengths and channel dimensions. We also introduce an adaptive label encoder to extract label semantics and address cross-dataset label space misalignment. Together, these components enhance the model’s transferability across heterogeneous medical datasets, which helps alleviate the challenge of label scarcity. Our model outperforms 13 baselines across 7 medical datasets under supervised learning. It also excels in few-shot learning and demonstrates zero-shot capability in both in-domain and cross-domain diagnostics. These results highlight MedSpaformer's robustness and its potential as a unified solution for MedTS classification across diverse settings.

The recent rapid advancements in language models (LMs) have garnered attention in medical time series-text multimodal learning. However, existing contrastive learning-based and prompt-based LM approaches tend to be biased, often assigning a primary role to time series modality while treating text modality as secondary. We classify these approaches under a temporal-primary paradigm, which may overlook the unique and critical task-relevant information embedded in text modality like clinical reports, thus failing to fully leverage mutual benefits and complementarity of different modalities. To fill this gap, we propose a novel textual-temporal multimodal learning paradigm that enables either modality to serve as the primary while being enhanced by the other, thereby effectively capturing modality-specific information and fostering cross-modal interaction. In specific, we design MedualTime, a language model composed of dual adapters to implement temporal-primary and textual-primary modeling simultaneously. Within each adapter, lightweight adaptation tokens are injected into the top layers of LM to encourage high-level modality fusion. The shared LM pipeline by dual adapters not only achieves adapter alignment but also enables efficient fine-tuning, reducing computational resources. Empirically, MedualTime demonstrates superior performance on medical data, achieving notable improvements of 8% accuracy and 12% F1 in supervised settings. Furthermore, MedualTime's transferability is validated by few-shot transfer experiments from coarse-grained to fine-grained medical data.

Short-term OD flow (i.e. the number of passenger traveling between stations) prediction is crucial to traffic management in metro systems. The delayed effect in latest complete OD flow collection and complex spatiotemporal correlations of OD flows in high dimension make it challengeable to predict short-term OD flow. Existing methods need to be improved due to not fully utilizing the real-time passenger mobility data and not sufficiently modeling the implicit correlation of the mobility patterns between stations. In this paper, we propose a Completion based Adaptive Heterogeneous Graph Convolution Spatiotemporal Predictor. The novelty is mainly reflected in two aspects. The first is to model real-time mobility evolution by establishing the implicit correlation between observed OD flows and the prediction target OD flows in high dimension based on a key data-driven insight: the destination distributions of the passengers departing from a station are correlated with other stations sharing similar attributes (e.g. geographical location, region function). The second is to complete the latest incomplete OD flows by estimating the destination distribution of unfinished trips through considering the real-time mobility evolution and the time cost between stations, which is the base of time series prediction and can improve the model’s dynamic adaptability. Extensive experiments on two real world metro datasets demonstrate the superiority of our model over other competitors with the biggest model performance improvement being nearly 4%. In addition, the data complete framework we propose can be integrated into other models to improve their performance up to 2.1%.

Abstract Real‐time individuals' destination prediction is of great significance for real‐time user tracking, service recommendation and other related applications. Traditional technology mainly used statistical methods based on the travel patterns mined from personal history travel data. However, it is not clear how to predict the destinations of individuals with only limited personal historical data. In this paper, taking the public transportation metro systems as example, we design a practical method called practical model with strong interpretability and predictability to predict each passenger's destination. Our main novelties are two aspects: (1) We propose to predict individuals' destination by combining personal and crowd behavior under certain context. (2) An explanatory model combining discrete choice model and neural network model is proposed to predict individuals' stochastic trip's destination, which can be applied to other transportation analysis scenarios about individuals' choice behavior such as travel mode choice or route choice. We validate our method based on extensive experiments, using smart card data collected by automatic fare collection system and weather data in Shenzhen, China. The experimental results demonstrate that our approach can achieve better performance than other baselines in terms of prediction accuracy.

Short-term Origin-Destination(OD) matrix prediction in metro systems aims to predict the number of passenger demands from one station to another during a short time period. That is crucial for dynamic traffic operations, e.g., route recommendation, metro scheduling. However, existing methods need further improvement due to that they fail to take full use of the real-time traffic information and model the complex spatiotemporal correlation of traffic flows. In this paper, aMulti-ViewPassengerFlow (MVPF) evolution trend based OD matrix prediction method is proposed. It consists of two components focusing on individual station and cross-station learning. Specifically, the individual station level part uses Gate Recurrent Unit and Extended Graph Attention Networks combined model to learn the high-level spatiotemporal-dependent representation of each station as the roles of origin and destination respectively, by considering multiple views of real-time traffic information (i.e., Inflow, destination allocation of Inflow, Outflow, origin allocations of Outflow). The cross-station part aims to learn passenger mobility pattern from each origin to destination through defining a transition matrix under spatiotemporal context. Compared with state-of-the-art solutions, MVPF increases the OD prediction performance metric of WMAPE by 2.5% on average. The experimental results demonstrate the superiority of MVPF against other competitors. The source code is available athttps://github.com/zfrInSIAT/MVPF-code.

In recent years, various deep learning architectures have been proposed to solve complex challenges (e.g. spatial dependency, temporal dependency) in traffic domain, which have achieved satisfactory performance. These architectures are composed of multiple deep learning techniques in order to tackle various challenges in traffic tasks. Traditionally, convolution neural networks (CNNs) are utilized to model spatial dependency by decomposing the traffic network as grids. However, many traffic networks are graph-structured in nature. In order to utilize such spatial information fully, it’s more appropriate to formulate traffic networks as graphs mathematically. Recently, various novel deep learning techniques have been developed to process graph data, called graph neural networks (GNNs). More and more works combine GNNs with other deep learning techniques to construct an architecture dealing with various challenges in a complex traffic task, where GNNs are responsible for extracting spatial correlations in traffic network. These graph-based architectures have achieved state-of-the-art performance. To provide a comprehensive and clear picture of such emerging trend, this survey carefully examines various graph-based deep learning architectures in many traffic applications. We first give guidelines to formulate a traffic problem based on graph and construct graphs from various kinds of traffic datasets. Then we decompose these graph-based architectures to discuss their shared deep learning techniques, clarifying the utilization of each technique in traffic tasks. What’s more, we summarize some common traffic challenges and the corresponding graph-based deep learning solutions to each challenge. Finally, we provide benchmark datasets, open source codes and future research directions in this rapidly growing field.

Understanding and predicting each individual’s real-time travel destination given the origin information in urban public transportation systems is crucial for personalized traveler recommendation, targeted demand management, dynamic traffic operations and so on. Existing methods are often based on modeling the regular travel patterns through analyzing the long-term personal travel information. They are suitable for destination prediction of individual regular trips with regular travel patterns, but may not work well for occasional trips with strong randomness and uncertainty, especially for the individuals with a few historical travel data. In this paper, we focus on more challenging issue about destination prediction of occasional trips. We design a general Multi-View Deep Learning Framework (MDLF) based on the data-driven insight that a location where a user will destine to is not only related to the user’s own travel preference to the location, but also influenced by crowd’s travel preference and the region’s characteristics of the location under certain spatiotemporal contexts. The destination of an individual’s occasional trip can be predicted by combining all these complementary influencing factors. The novelty of MDLF is mainly reflected in two aspects. The first is the effective feature extraction from multiple and complementary views. The second is that a CNN (Recurrent Neural Network) based deep learning component for predicting each occasional trip’s destination by calculating a moving trend score for each possible destination. We evaluate the MDLF based on two real-world smart card datasets collected by AFC (Automatic Fare Collection) Systems. The experimental results demonstrate the superiority of MDLF against other competitors.

In this paper, we investigate an efficient way for identifying passengers in a metro system across two heterogeneous but complementary trajectory data sources: AFC data recording two points per trip about when and where a passenger enters or leaves the metro system, and WiFi data recording a few points passed by a passenger in the way of some of his/her trips. The identification result can help us to complete individuals’ mobility, and benefits to lots of services, e.g., individual route choice analysis, epidemic case detecting and so on. The problem is similar to calculate the similarity between two trajectories from two data sources, where a trajectory refers to a sequence of points where a passenger appeared in a metro system on observed days. However, due to the small location space in a metro network, large number of passengers with similar travel pattern, and so on, there are lots of trip overlaps or point co-occurrences between different passengers. That results in a large number of passengers mismatched by existing trajectory similarity measurement. To address the problem, this paper proposes a novel global-local correlation based trajectory similarity measurement GLTC. Specifically, GLTC first extracts all overlapping trip pairs of two trajectories by considering the spatiotemporal inclusions from global level. Then it gets the similarity by aggregating each overlapping trip pair’s local similarity, which is calculated by considering some data-driven insights helpful to uniquely identify a passenger (e.g., uneven passenger flow distribution in different cross-sections of a metro network, the number of trips in same travel pattern of a trajectory, and so on). We evaluate GLTC based on real-world data, and the experimental result shows that GLTC outperforms other baselines.

Stock price movement prediction is commonly accepted as a very challenging task due to the volatile nature of financial markets. Previous works typically predict the stock price mainly based on its own information, neglecting the cross effect among involved stocks. However, it is well known that an individual stock price is correlated with prices of other stocks in complex ways. To take the cross effect into consideration, we propose a deep learning framework, called Multi-GCGRU, which comprises graph convolutional network (GCN) and gated recurrent unit (GRU) to predict stock movement. Specifically, we first encode multiple relationships among stocks into graphs based on financial domain knowledge and utilize GCN to extract the cross effect based on these pre-defined graphs. To further get rid of prior knowledge, we explore an adaptive relationship learned by data automatically. The cross-correlation features produced by GCN are concatenated with historical records and then fed into GRU to model the temporal dependency of stock prices. Experiments on two stock indexes in China market show that our model outperforms other baselines. Note that our model is rather feasible to incorporate more effective stock relationships containing expert knowledge, as well as learn data-driven relationship.

Graph Convolutional Network (GCN) is adopted to tackle the problem of convolution operation in non-Euclidean space. Previous works on GCN have made some progress, however, one of their limitations is that the design of Adjacency Matrix (AM) as GCN input requires domain knowledge and such process is cumbersome, tedious and error-prone. In addition, entries of a fixed Adjacency Matrix are generally designed as binary values (i.e., ones and zeros) which can not reflect the real relationship between nodes. Meanwhile, many applications require a weighted and dynamic Adjacency Matrix instead of an unweighted and fixed AM, and there are few works focusing on designing a more flexible Adjacency Matrix. To that end, we propose an end-to-end algorithm to improve the GCN performance by focusing on the Adjacency Matrix. We first provide a calculation method callednodeinformationentropyto update the matrix. Then, we perform the search strategy in a continuous space and introduce the Deep Deterministic Policy Gradient (DDPG) method to overcome the drawback of the discrete space search. Finally, we integrate the GCN and reinforcement learning into an end-to-end framework. Our method can automatically define the Adjacency Matrix without prior knowledge. At the same time, the proposed approach can deal with any size of the matrix and provide a better AM for network. Four popular datasets are selected to evaluate the capability of our algorithm. The method in this paper achieves the state-of-the-art performance onCoraandPubmeddatasets, with the accuracy of 84.6% and 81.6% respectively.

Subway passenger flow forecasting, an essential component of intelligent transportation system, is critical for traffic management, public safety, urban planning. However, it is very challenging due to the high nonlinearities and complex dynamic spatio-temporal dependencies of passenger flows. In this paper, we model the subway system as a directed weighted graph and propose a novel spatio-temporal deep learning framework, Multi-STGCnet, for forecasting short-term subway passenger flow at a station level. Specifically, Multi-STGCnet is mainly composed of two components, temporal component and spatial component. (1) The temporal component employs three long short-term memory network (LSTM)-based modules to capture three temporal properties of the target station, which are the interval closeness, daily periodicity, weekly trend. (2) The spatial component designs three spatial matrixes to extract spatial correlation of a target station with all other stations classified as near neighbors, middle neighbors and distant neighbors. Respectively, it adopts three graph convolution network (GCN) and LSTM combined modules to capture the spatio-temporal influences from different neighbors. Finally, the outputs of the two components are fused with different weights to generate prediction. We evaluate Multi-STGCnet on a real world dataset from the metro system in Shenzhen, China. Experiment results demonstrate that our model outperforms multiple baselines.