Demo Data from SIGIR 2026 / reviewers in the wild / expert
Tong Xia
dblp:217/5581
· DBLP profile ↗
38ranked-venue papers
10as first author
32since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 21 · 6 first-author · 17 since 2021Artificial intelligence and machine learning · 16 · 3 first-author · 13 since 2021Applied, interdisciplinary, general and emerging computing · 11 · 2 first-author · 9 since 2021Graphics, computer vision, multimedia, augmented reality and games · 7 · 3 first-author · 6 since 2021Computer networks · 4 · 3 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
8 papers |
Data mining · 61% Spatial and temporal data management · 29% Graph data management · 8% | |
| Interdisciplinary, comprehensive, and emerging computing
9 papers |
Medical and health informatics · 49% Smart cities and intelligent transportation · 27% Bioinformatics and computational biology · 12% | |
| Artificial intelligence
6 papers |
Deep learning architectures and training · 37% Trustworthy machine learning · 26% Efficient and distributed learning · 22% | |
| Computer networks
2 papers |
Cellular and mobile networks · 37% Edge and fog computing · 30% Network optimization and economics · 26% | |
| Computer graphics and multimedia
2 papers |
Audio and music processing · 100% |
Topics — the 30 heaviest of 46, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
uncertainty estimation |
0.9 | 1 | 2025 | SurvUnc: A Meta-Model Based Uncertainty Quantification Framework for Survival Analysis · KDD (2) 2025 |
Bioinformatics and computational biology
survival analysis |
0.9 | 1 | 2025 | SurvUnc: A Meta-Model Based Uncertainty Quantification Framework for Survival Analysis · KDD (2) 2025 |
Computational science and engineering
uncertainty quantification |
0.9 | 1 | 2025 | SurvUnc: A Meta-Model Based Uncertainty Quantification Framework for Survival Analysis · KDD (2) 2025 |
Data mining
spatiotemporal data mining |
0.8 | 3 | 2022 | DeepFlowGen: Intention-Aware Fine Grained Crowd Flow Generation via Deep Neural Networks · IEEE Trans. Knowl. Data Eng. 2022 Understanding Urban Dynamics via State-Sharing Hidden Markov Model · IEEE Trans. Knowl. Data Eng. 2021 Understanding Urban Dynamics via State-sharing Hidden Markov Model · WWW 2019 |
Machine learning › Efficient and distributed learning
federated learning |
0.8 | 1 | 2024 | FLea: Addressing Data Scarcity and Label Skew in Federated Learning via Privacy-preserving Feature Augmentation · KDD 2024 |
Machine learning › Deep learning architectures and training › neural differential equations
neural ordinary differential equations |
0.7 | 1 | 2023 | Conditional Neural ODE Processes for Individual Disease Progression Forecasting: A Case Study on COVID-19 · KDD 2023 |
Medical and health informatics
disease progression modeling |
0.7 | 1 | 2023 | Conditional Neural ODE Processes for Individual Disease Progression Forecasting: A Case Study on COVID-19 · KDD 2023 |
Graph data management
graph embedding |
0.7 | 1 | 2023 | Understanding the Long-Term Dynamics of Mobile App Usage Context via Graph Embedding · IEEE Trans. Knowl. Data Eng. 2023 |
Data mining › structured data mining
graph mining |
0.7 | 1 | 2023 | Understanding the Long-Term Dynamics of Mobile App Usage Context via Graph Embedding · IEEE Trans. Knowl. Data Eng. 2023 |
Smart cities and intelligent transportation › spatio-temporal prediction
crowd flow prediction |
0.6 | 1 | 2022 | DeepFlowGen: Intention-Aware Fine Grained Crowd Flow Generation via Deep Neural Networks · IEEE Trans. Knowl. Data Eng. 2022 |
Medical and health informatics › public health
epidemic control |
0.6 | 1 | 2022 | Precise Mobility Intervention for Epidemic Control Using Unobservable Information via Deep Reinforcement Learning · KDD 2022 |
Data mining › pattern mining › behavioral pattern mining
activity mining |
0.6 | 1 | 2022 | To What Extent We Repeat Ourselves? Discovering Daily Activity Patterns Across Mobile App Usage · IEEE Trans. Mob. Comput. 2022 |
Data mining › behavior analysis
activity recognition |
0.6 | 1 | 2022 | To What Extent We Repeat Ourselves? Discovering Daily Activity Patterns Across Mobile App Usage · IEEE Trans. Mob. Comput. 2022 |
Data mining
clustering |
0.6 | 1 | 2022 | To What Extent We Repeat Ourselves? Discovering Daily Activity Patterns Across Mobile App Usage · IEEE Trans. Mob. Comput. 2022 |
Data mining › clustering
hierarchical clustering |
0.6 | 1 | 2022 | To What Extent We Repeat Ourselves? Discovering Daily Activity Patterns Across Mobile App Usage · IEEE Trans. Mob. Comput. 2022 |
Spatial and temporal data management › trajectory data management
map matching |
0.6 | 1 | 2022 | DeepMM: Deep Learning Based Map Matching With Data Augmentation · IEEE Trans. Mob. Comput. 2022 |
Data mining
pattern mining |
0.6 | 1 | 2022 | To What Extent We Repeat Ourselves? Discovering Daily Activity Patterns Across Mobile App Usage · IEEE Trans. Mob. Comput. 2022 |
Spatial and temporal data management
trajectory data management |
0.6 | 1 | 2022 | DeepMM: Deep Learning Based Map Matching With Data Augmentation · IEEE Trans. Mob. Comput. 2022 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model |
0.5 | 1 | 2021 | Understanding Urban Dynamics via State-Sharing Hidden Markov Model · IEEE Trans. Knowl. Data Eng. 2021 |
Smart cities and intelligent transportation
urban computing |
0.5 | 1 | 2021 | Understanding Urban Dynamics via State-Sharing Hidden Markov Model · IEEE Trans. Knowl. Data Eng. 2021 |
Spatial and temporal data management
trajectory data |
0.5 | 1 | 2021 | AttnMove: History Enhanced Trajectory Recovery via Attentional Network · AAAI 2021 |
Spatial and temporal data management › trajectory data management
trajectory recovery |
0.5 | 1 | 2021 | AttnMove: History Enhanced Trajectory Recovery via Attentional Network · AAAI 2021 |
Edge and fog computing › edge offloading
device-to-device offloading |
0.5 | 1 | 2021 | Portfolio Optimization in Traffic Offloading: Concept, Model, and Algorithms · IEEE Trans. Mob. Comput. 2021 |
Cellular and mobile networks
mobile data offloading |
0.5 | 1 | 2021 | Portfolio Optimization in Traffic Offloading: Concept, Model, and Algorithms · IEEE Trans. Mob. Comput. 2021 |
Machine learning › Deep learning architectures and training
convolutional neural network |
0.4 | 1 | 2020 | A Sequential Convolution Network for Population Flow Prediction with Explicitly Correlation Modelling · IJCAI 2020 |
Medical and health informatics › clinical diagnosis
COVID-19 diagnosis |
0.4 | 1 | 2020 | Exploring Automatic Diagnosis of COVID-19 from Crowdsourced Respiratory Sound Data · KDD 2020 |
Medical and health informatics › biomedical signal processing › physiological signal analysis
respiratory sound analysis |
0.4 | 1 | 2020 | Exploring Automatic Diagnosis of COVID-19 from Crowdsourced Respiratory Sound Data · KDD 2020 |
Network optimization and economics › pricing
data pricing |
0.4 | 1 | 2020 | Mobile App Usage Patterns Aware Smart Data Pricing · IEEE J. Sel. Areas Commun. 2020 |
Smart cities and intelligent transportation › urban computing
urban dynamics |
0.4 | 1 | 2019 | Understanding Urban Dynamics via State-sharing Hidden Markov Model · WWW 2019 |
Medical and health informatics
clinical decision support |
0.3 | 1 | 2025 | SurvUnc: A Meta-Model Based Uncertainty Quantification Framework for Survival Analysis · KDD (2) 2025 |
Methods — techniques the papers use, named apart from their topics
recurrent neural network · 2.0neural ODE · 2.0hidden markov model · 1.8meta-model · 1.7concordance-based ranking · 1.7anchor-based learning · 1.7obfuscation · 1.5foundation model · 1.5feature augmentation · 1.5activation mix-up · 1.5conditional neural process · 1.3probabilistic topic model · 1.1hierarchical clustering · 1.1attention mechanism · 1.1self-supervised pretraining · 0.8self-supervised pre-training · 0.8graph embedding · 0.7conditional neural processes · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Electrocardiogram Report Generation and Question Answering via Retrieval-Augmented Self-Supervised ModelingabstractInterpreting electrocardiograms (ECGs) and generating comprehensive reports remain challenging tasks in cardiology, often requiring specialized expertise and significant time investment. To address these critical issues, we propose ECG-ReGen, a retrieval-based approach for ECG-to-text report generation and question answering. Our method leverages self-supervised learning for the ECG encoder, enabling efficient similarity searches and report retrieval. By combining pre-training with dynamic retrieval and Large Language Model (LLM)-based refinement, ECG-ReGen effectively analyzes ECG data and answers related queries, with the potential of improving patient care. Experiments conducted on the PTB-XL and MIMIC-IV-ECG datasets demonstrate superior performance in both in-domain and cross-domain scenarios for report generation. Furthermore, our approach exhibits competitive performance on the ECG-QA dataset compared to fully supervised methods when utilizing off-the-shelf LLMs for zero-shot question answering. This approach, effectively combining self-supervised encoder and LLMs, offers a scalable and efficient solution for accurate ECG interpretation, holding significant potential to enhance clinical decision-making. Jialu Tang, Tong Xia, Cecilia Mascolo, Aaqib Saeed |
ICASSP | 2 |
| 2025 | SurvUnc: A Meta-Model Based Uncertainty Quantification Framework for Survival AnalysisabstractSurvival analysis, which estimates the probability of event occurrence over time from censored data, is fundamental in numerous real-world applications, particularly in high-stakes domains such as healthcare and risk assessment. Despite advances in numerous survival models, quantifying the uncertainty of predictions from these models remains underexplored and challenging. The lack of reliable uncertainty quantification limits the interpretability and trustworthiness of survival models, hindering their adoption in clinical decision-making and other sensitive applications. To bridge this gap, in this work, we introduce SurvUnc, a novel meta-model based framework for post-hoc uncertainty quantification for survival models. SurvUnc introduces an anchor-based learning strategy that integrates concordance knowledge into meta-model optimization, leveraging pairwise ranking performance to estimate uncertainty effectively. Notably, our framework is model-agnostic, ensuring compatibility with any survival model without requiring modifications to its architecture or access to its internal parameters. Especially, we design a comprehensive evaluation pipeline tailored to this critical yet overlooked problem. Through extensive experiments on four publicly available benchmarking datasets and five representative survival models, we demonstrate the superiority of SurvUnc across multiple evaluation scenarios, including selective prediction, misprediction detection, and out-of-domain detection. Our results highlight the effectiveness of SurvUnc in enhancing model interpretability and reliability, paving the way for more trustworthy survival predictions in real-world Yu Liu 0016, Weiyao Tao, Tong Xia, Simon Knight 0005, Tingting Zhu 0001 |
KDD (2) | 3 |
| 2025 | Deep Reinforcement Learning for Demand-Driven Services in Logistics and Transportation Systems: A SurveyabstractRecent technology development brings the boom of numerous new Demand-Driven Services (DDS) into urban lives, including ridesharing, on-demand delivery, express systems, and warehousing. In DDS, a service loop is an elemental structure, including its service worker, the service providers, and corresponding service targets. The service workers should transport either people or parcels from the providers to the target locations. Various planning tasks within DDS can thus be classified into two individual stages: (1) Dispatching, which is to form service loops from demand/supply distributions, and (2) Routing, which is to decide specific serving orders within the constructed loops. Generating high-quality strategies in both stages is important to develop DDS but faces several challenges. Meanwhile, deep reinforcement learning (DRL) has been developed rapidly in recent years. It is a powerful tool to solve these problems since DRL can learn a parametric model without relying on too many problem-based assumptions and optimize long-term effects by learning sequential decisions. In this survey, we first define DDS, then highlight common applications and important decision/control problems within. For each problem, we comprehensively introduce the existing DRL solutions. We also introduce open simulation environments for development and evaluation of DDS applications. Finally, we analyze remaining challenges and discuss further research opportunities in DRL solutions for DDS. Zefang Zong, Jingwei Wang 0002, Tong Xia, Yong Li 0008 |
ACM Trans. Knowl. Discov. Data | 4 |
| 2024 | GUI: A Comprehensive Dataset of Global Urban Infrastructure Based on Geospatial Visual Foundation ModelsabstractThe substantial social and financial costs of infrastructure identification impede in-depth analyses of sustainable urban design, especially in developing countries. In this paper, we present a novel framework with interactive web visualization based on geospatial visual foundation models. Leveraging this framework, we examine the urban infrastructure information in 1,178 cities worldwide, covering 93, 088 km2 areas. Cross-validation reveals that the overall accuracy of identified infrastructure achieves 67.0%. It sheds light on the sustainable development of cities and exposes the stark inequity in urban infrastructure provision for vulnerable populations. The identified urban infrastructure dataset of this study are available at https://github.com/tsinghua-fib-lab/GUI, and the interactive web application is at https://tinyurl.com/yz7xbfy3. Zhenyu Han, Xin Zhang 0106, Yanxin Xi, Tong Xia, Yong Li 0008 |
SIGSPATIAL/GIS | 5 |
| 2024 | FLea: Addressing Data Scarcity and Label Skew in Federated Learning via Privacy-preserving Feature AugmentationabstractFederated Learning (FL) enables model development by leveraging data distributed across numerous edge devices without transferring local data to a central server. However, existing FL methods still face challenges when dealing with scarce and label-skewed data across devices, resulting in local model overfitting and drift, consequently hindering the performance of the global model. In response to these challenges, we propose a pioneering framework called FLea, incorporating the following key components: i) A global feature buffer that stores activation-target pairs shared from multiple clients to support local training. This design mitigates local model drift caused by the absence of certain classes; ii) A feature augmentation approach based on local and global activation mix-ups for local training. This strategy enlarges the training samples, thereby reducing the risk of local overfitting; iii) An obfuscation method to minimize the correlation between intermediate activations and the source data, enhancing the privacy of shared features. To verify the superiority of FLea, we conduct extensive experiments using a wide range of data modalities, simulating different levels of local data scarcity and label skew. The results demonstrate that FLea consistently outperforms state-of-the-art FL counterparts (among 13 of the experimented 18 settings, the improvement is over 5%) while concurrently mitigating the privacy vulnerabilities associated with shared features. Tong Xia, Abhirup Ghosh, Xinchi Qiu, Cecilia Mascolo |
KDD | 1 |
| 2024 | Towards Open Respiratory Acoustic Foundation Models: Pretraining and BenchmarkingabstractRespiratory audio, such as coughing and breathing sounds, has predictive power for a wide range of healthcare applications, yet is currently under-explored. The main problem for those applications arises from the difficulty in collecting large labeled task-specific data for model development. Generalizable respiratory acoustic foundation models pretrained with unlabeled data would offer appealing advantages and possibly unlock this impasse. However, given the safety-critical nature of healthcare applications, it is pivotal to also ensure openness and replicability for any proposed foundation model solution. To this end, we introduce OPERA, an OPEn Respiratory Acoustic foundation model pretraining and benchmarking system, as the first approach answering this need. We curate large-scale respiratory audio datasets ($\sim$136K samples, over 400 hours), pretrain three pioneering foundation models, and build a benchmark consisting of 19 downstream respiratory health tasks for evaluation. Our pretrained models demonstrate superior performance (against existing acoustic models pretrained with general audio on 16 out of 19 tasks) and generalizability (to unseen datasets and new respiratory audio modalities). This highlights the great promise of respiratory acoustic foundation models and encourages more studies using OPERA as an open resource to accelerate research on respiratory audio for health. The system is accessible from https://github.com/evelyn0414/OPERA. Yuwei Zhang 0001, Tong Xia, Jing Han 0010, Yu Wu 0021, Georgios Rizos, Yang Liu 0101, Mohammed Mosuily, Jagmohan Chauhan, Cecilia Mascolo |
NeurIPS | 2 |
| 2024 | Nonstationary Prestack Linear Bayesian Stochastic InversionabstractBayesian inversion is capable of integrating seismic data, well-log data, and geological data to obtain a posterior probability distribution function (PPDF) of elastic parameters. Due to the absorption of strata, amplitude attenuation and phase distortion inevitably occur during the propagation of seismic wave, resulting in low resolution of seismic data. The traditional linear Bayesian inversion method is based on the stationary convolution model, and amplitude compensation and phase correction are needed to be conducted in advance. Uncertainties exist in both compensation and inversion, and the inversion results cannot account for the uncertainties in the directly observed seismic data resulting in accurate inversion results. To estimate uncertainty more accurately and improve inversion accuracy, in this article, we develop a nonstationary prestack linear Bayesian stochastic inversion (NSPLBSI) method. Through the proposed method, prior information from well-log data can be effectively introduced to constrain inversion. Compensation and inversion are integrated into one procedure, which can estimate the posterior uncertainties more accurately directly from seismic data compared with traditional two-step inversion methods, i.e., first compensating attenuation and second performing inversion. Also, more accurate inversion results are obtained. In order to verify the rationality and effectiveness of our proposed method, we conduct inversions using synthetic seismic data on the Marmousi model and a field seismic dataset. Numerical examples show that it can not only compensate amplitude well but also obtain high-precision inversion results with smaller prediction interval. Bangbang Gao, Hui Zhou 0002, Lingqian Wang, Yamei Cao, Bo Yu 0015, Tong Xia, Zhefeng Wei, Hongliang Zhang 0005 |
IEEE Trans. Geosci. Remote. Sens. | 6 |
| 2024 | Reinforcement Learning for Solving Multiple Vehicle Routing Problem with Time WindowabstractVehicle routing problem with time window (VRPTW) is of great importance for a wide spectrum of services and real-life applications, such as online take-out and car-hailing platforms. A promising method should generate high-qualified solutions within limited inference time, and there are three major challenges: (a) directly optimizing the goal with several practical constraints; (b) efficiently handling individual time-window limits; and (c) modeling the cooperation among the vehicle fleet. In this article, we present an end-to-end reinforcement learning framework to solve VRPTW. First, we propose an agent model that encodes constraints into features as the input and conducts harsh policy on the output when generating deterministic results. Second, we design a time penalty augmented reward to model the time-window limits during gradient propagation. Third, we design a task handler to enable the cooperation among different vehicles. We perform extensive experiments on two real-world datasets and one public benchmark dataset. Results demonstrate that our solution improves the performance by up to 11.7% compared to other RL baselines and could generate solutions for instances within seconds, while existing heuristic baselines take for minutes as well as maintain the quality of solutions. Moreover, our solution is thoroughly analyzed with meaningful implications due to the real-time response ability. Zefang Zong, Tong Xia, Meng Zheng 0003, Yong Li 0008 |
ACM Trans. Intell. Syst. Technol. | 2 |
| 2024 | Uncertainty-Aware Health Diagnostics via Class-Balanced Evidential Deep LearningabstractUncertainty quantification is critical for ensuring the safety of deep learning-enabled health diagnostics, as it helps the model account for unknown factors and reduces the risk of misdiagnosis. However, existing uncertainty quantification studies often overlook the significant issue of class imbalance, which is common in medical data. In this paper, we propose a class-balanced evidential deep learning framework to achieve fair and reliable uncertainty estimates for health diagnostic models. This framework advances the state-of-the-art uncertainty quantification method of evidential deep learning with two novel mechanisms to address the challenges posed by class imbalance. Specifically, we introduce a pooling loss that enables the model to learn less biased evidence among classes and a learnable prior to regularize the posterior distribution that accounts for the quality of uncertainty estimates. Extensive experiments using benchmark data with varying degrees of imbalance and various naturally imbalanced health data demonstrate the effectiveness and superiority of our method. Our work pushes the envelope of uncertainty quantification from theoretical studies to realistic healthcare application scenarios. By enhancing uncertainty estimation for class-imbalanced data, we contribute to the development of more reliable and practical deep learning-enabled health diagnostic systems. Tong Xia, Ting Dang, Jing Han 0010, Lorena Qendro, Cecilia Mascolo |
IEEE J. Biomed. Health Informatics | 1 |
| 2024 | History-enhanced and Uncertainty-aware Trajectory Recovery via Attentive Neural NetworkabstractA considerable amount of mobility data has been accumulated due to the proliferation of location-based services. Nevertheless, compared with mobility data from transportation systems like the GPS module in taxis, this kind of data is commonly sparse in terms of individual trajectories in the sense that users do not access mobile services and contribute their data all the time. Consequently, the sparsity inevitably weakens the practical value of the data even if it has a high user penetration rate. To solve this problem, we propose a novel attentional neural network-based model, named AttnMove, to densify individual trajectories by recovering unobserved locations at a fine-grained spatial-temporal resolution. To tackle the challenges posed by sparsity, we design various intra- and inter- trajectory attention mechanisms to better model the mobility regularity of users and fully exploit the periodical pattern from long-term history. In addition, to guarantee the robustness of the generated trajectories to avoid harming downstream applications, we also exploit the Bayesian approximate neural network to estimate the uncertainty of each imputation. As a result, locations generated by the model with high uncertainty will be excluded. We evaluate our model on two real-world datasets, and extensive results demonstrate the performance gain compared with the state-of-the-art methods. In-depth analyses of each design of our model have been conducted to understand their contribution. We also show that, by providing high-quality mobility data, our model can benefit a variety of mobility-oriented downstream applications. Tong Xia, Yong Li 0008, Yunhan Qi, Jie Feng 0002, Fengli Xu, Funing Sun, Diansheng Guo, Depeng Jin |
ACM Trans. Knowl. Discov. Data | 1 |
| 2023 | Devil in the Landscapes: Inferring Epidemic Exposure Risks from Street View ImageryabstractBuilt environment supports all the daily activities and shapes our health. Leveraging informative street view imagery, previous research has established the profound correlation between the built environment and chronic, non-communicable diseases; however, predicting the exposure risk of infectious diseases remains largely unexplored. The person-to-person contacts and interactions contribute to the complexity of infectious disease, which is inherently different from non-communicable diseases. Besides, the complex relationships between street view imagery and epidemic exposure also hinder accurate predictions. To address these problems, we construct a regional mobility graph informed by the gravity model, based on which we propose a transmission-aware graph neural network (GNN) to capture disease transmission patterns arising from human mobility. Experiments show that the proposed model significantly outperforms baseline models by 8.54% in weighted F1, shedding light on a low-cost, scalable approach to assess epidemic exposure risks from street view imagery. Zhenyu Han, Yanxin Xi, Tong Xia, Yu Liu 0016, Yong Li 0008 |
SIGSPATIAL/GIS | 3 |
| 2023 | Cross-Device Federated Learning for Mobile Health Diagnostics: A First Study on COVID-19 DetectionabstractFederated learning (FL) aided health diagnostic models can incorporate data from a large number of personal edge devices (e.g., mobile phones) while keeping the data local to the originating devices, largely ensuring privacy. However, such a cross-device FL approach for health diagnostics still imposes many challenges due to both local data imbalance (as extreme as local data consists of a single disease class) and global data imbalance (the disease prevalence is generally low in a population). Since the federated server has no access to data distribution information, it is not trivial to solve the imbalance issue towards an unbiased model. In this paper, we propose FedLoss, a novel cross-device FL framework for health diagnostics. Here the federated server averages the models trained on edge devices according to the predictive loss on the local data, rather than using only the number of samples as weights. As the predictive loss better quantifies the data distribution at a device, FedLoss alleviates the impact of data imbalance. Through a real-world dataset on respiratory sound and symptom-based COVID-19 detection task, we validate the superiority of FedLoss. It achieves competitive COVID-19 detection performance compared to a centralised model with an AUC-ROC of 79%. It also outperforms the state-of-the-art FL baselines in sensitivity and convergence speed. Our work not only demonstrates the promise of federated COVID-19 detection but also paves the way to a plethora of mobile health model development in a privacy-preserving fashion. Tong Xia, Jing Han 0010, Abhirup Ghosh, Cecilia Mascolo |
ICASSP | 1 |
| 2023 | Conditional Neural ODE Processes for Individual Disease Progression Forecasting: A Case Study on COVID-19abstractTime series forecasting, as one of the fundamental machine learning areas, has attracted tremendous attentions over recent years. The solutions have evolved from statistical machine learning (ML) methods to deep learning techniques. One emerging sub-field of time series forecasting is individual disease progression forecasting, e.g., predicting individuals' disease development over a few days (e.g., deteriorating trends, recovery speed) based on few past observations. Despite the promises in the existing ML techniques, a variety of unique challenges emerge for disease progression forecasting, such as irregularly-sampled time series, data sparsity, and individual heterogeneity in disease progression. To tackle these challenges, we propose novel Conditional Neural Ordinary Differential Equations Processes (CNDPs), and validate it in a COVID-19 disease progression forecasting task using audio data. CNDPs allow for irregularly-sampled time series modelling, enable accurate forecasting with sparse past observations, and achieve individual-level progression forecasting. CNDPs show strong performance with an Unweighted Average Recall (UAR) of 78.1%, outperforming a variety of commonly used Recurrent Neural Networks based models. With the proposed label-enhancing mechanism (i.e., including the initial health status as input) and the customised individual-level loss, CNDPs further boost the performance reaching a UAR of 93.6%. Additional analysis also reveals the model's capability in tracking individual-specific recovery trend, implying the potential usage of the model for remote disease progression monitoring. In general, CNDPs pave new pathways for time series forecasting, and provide considerable advantages for disease progression monitoring. Ting Dang, Jing Han 0010, Tong Xia, Erika Bondareva, Chloë Siegele-Brown, Jagmohan Chauhan, Andreas Grammenos, Dimitris Spathis, Pietro Cicuta, Cecilia Mascolo |
KDD | 3 |
| 2023 | CholecTriplet2021: A benchmark challenge for surgical action triplet recognition
Chinedu Innocent Nwoye, Deepak Alapatt, Tong Yu 0009, Armine Vardazaryan, Fangfang Xia, Tong Xia, Fucang Jia, Yuxuan Yang 0007, Hao Wang 0081, Derong Yu, Guoyan Zheng, Xiaotian Duan, Neil Getty, Ricardo Sanchez-Matilla, Maria Robu, Li Zhang 0040, Huabin Chen, Jiacheng Wang 0002, Liansheng Wang 0002, Beerend G. A. Gerats, Sista Raviteja, Rachana Sathish, Rong Tao, Satoshi Kondo, Winnie Pang, Hongliang Ren 0001, Julian Ronald Abbing, Mohammad Hasan Sarhan, Sebastian Bodenstedt, Nithya Bhasker, Bruno Oliveira 0002, Helena R. Torres, Finn Gaida, Tobias Czempiel, João L. Vilaça, Pedro Morais, Jaime C. Fonseca 0001, Ruby Mae Egging, Inge Nicole Wijma, Chen Qian 0006, Guibin Bian, Zhen Li 0026, Velmurugan Balasubramanian, Debdoot Sheet, Imanol Luengo, Yuanbo Zhu, Shuai Ding 0001, Jakob-Anton Aschenbrenner, Nicolas Elini van der Kar, Mengya Xu, Mobarakol Islam, Seenivasan Lalithkumar, Alexander Jenke, Danail Stoyanov, Didier Mutter, Pietro Mascagni, Barbara Seeliger, Cristians Gonzalez, Nicolas Padoy |
Medical Image Anal. | 7 |
| 2023 | Comparative validation of machine learning algorithms for surgical workflow and skill analysis with the HeiChole benchmarkabstractPURPOSE: Surgical workflow and skill analysis are key technologies for the next generation of cognitive surgical assistance systems. These systems could increase the safety of the operation through context-sensitive warnings and semi-autonomous robotic assistance or improve training of surgeons via data-driven feedback. In surgical workflow analysis up to 91% average precision has been reported for phase recognition on an open data single-center video dataset. In this work we investigated the generalizability of phase recognition algorithms in a multicenter setting including more difficult recognition tasks such as surgical action and surgical skill. METHODS: To achieve this goal, a dataset with 33 laparoscopic cholecystectomy videos from three surgical centers with a total operation time of 22 h was created. Labels included framewise annotation of seven surgical phases with 250 phase transitions, 5514 occurences of four surgical actions, 6980 occurences of 21 surgical instruments from seven instrument categories and 495 skill classifications in five skill dimensions. The dataset was used in the 2019 international Endoscopic Vision challenge, sub-challenge for surgical workflow and skill analysis. Here, 12 research teams trained and submitted their machine learning algorithms for recognition of phase, action, instrument and/or skill assessment. RESULTS: F1-scores were achieved for phase recognition between 23.9% and 67.7% (n = 9 teams), for instrument presence detection between 38.5% and 63.8% (n = 8 teams), but for action recognition only between 21.8% and 23.3% (n = 5 teams). The average absolute error for skill assessment was 0.78 (n = 1 team). CONCLUSION: Surgical workflow and skill analysis are promising technologies to support the surgical team, but there is still room for improvement, as shown by our comparison of machine learning algorithms. This novel HeiChole benchmark can be used for comparable evaluation and validation of future work. In future studies, it is of utmost importance to create more open, high-quality datasets in order to allow the development of artificial intelligence and cognitive robotics in surgery. Martin Wagner 0001, Beat P. Müller-Stich, Anna Kisilenko, Patrick Heger, Lars Mündermann, David M. Lubotsky, Tornike Davitashvili, Manuela Capek, Annika Reinke, Carissa Reid, Tong Yu 0009, Armine Vardazaryan, Chinedu Innocent Nwoye, Nicolas Padoy, Eungjoo Lee 0001, Constantin Disch, Hans Meine, Tong Xia, Fucang Jia, Satoshi Kondo, Wolfgang Reiter, Yueming Jin, Yonghao Long 0001, Meirui Jiang, Qi Dou 0001, Pheng-Ann Heng, Isabell Twick, Kadir Kirtaç, Enes Hosgor, Jon Lindström Bolmgren, Michael Stenzel, Björn von Siemens, Zhenxiao Ge, Haiming Sun, Di Xie, Mengqi Guo, Daochang Liu, Hannes Kenngott, Felix Nickel, Moritz von Frankenberg, Franziska Mathis-Ullrich, Annette Kopp-Schneider, Lena Maier-Hein, Stefanie Speidel, Sebastian Bodenstedt |
Medical Image Anal. | 21 |
| 2023 | MT-FiST: A Multi-Task Fine-Grained Spatial-Temporal Framework for Surgical Action Triplet RecognitionabstractSurgical action triplet recognition plays a significant role in helping surgeons facilitate scene analysis and decision-making in computer-assisted surgeries. Compared to traditional context-aware tasks such as phase recognition, surgical action triplets, comprising the instrument, verb, and target, can offer more comprehensive and detailed information. However, current triplet recognition methods fall short in distinguishing the fine-grained subclasses and disregard temporal correlation in action triplets. In this article, we propose a multi-task fine-grained spatial-temporal framework for surgical action triplet recognition named MT-FiST. The proposed method utilizes a multi-label mutual channel loss, which consists of diversity and discriminative components. This loss function decouples global task features into class-aligned features, enabling the learning of more local details from the surgical scene. The proposed framework utilizes partial shared-parameters LSTM units to capture temporal correlations between adjacent frames. We conducted experiments on the CholecT50 dataset proposed in the MICCAI 2021 Surgical Action Triplet Recognition Challenge. Our framework is evaluated on the private test set of the challenge to ensure fair comparisons. Our model apparently outperformed state-of-the-art models in instrument, verb, target, and action triplet recognition tasks, with mAPs of 82.1% (+4.6%), 51.5% (+4.0%), 45.50% (+7.8%), and 35.8% (+3.1%), respectively. The proposed MT-FiST boosts the recognition of surgical action triplets in a context-aware surgical assistant system, further solving multi-task recognition by effective temporal aggregation and fine-grained features. Yuchong Li, Tong Xia, Huoling Luo, Baochun He, Fucang Jia |
IEEE J. Biomed. Health Informatics | 2 |
| 2023 | Contact Tracing and Epidemic Intervention via Deep Reinforcement LearningabstractThe recent outbreak of COVID-19 poses a serious threat to people’s lives. Epidemic control strategies have also caused damage to the economy by cutting off humans’ daily commute. In this article, we develop an Individual-based Reinforcement Learning Epidemic Control Agent (IDRLECA) to search for smart epidemic control strategies that can simultaneously minimize infections and the cost of mobility intervention. IDRLECA first hires an infection probability model to calculate the current infection probability of each individual. Then, the infection probabilities together with individuals’ health status and movement information are fed to a novel GNN to estimate the spread of the virus through human contacts. The estimated risks are used to further support an RL agent to select individual-level epidemic-control actions. The training of IDRLECA is guided by a specially designed reward function considering both the cost of mobility intervention and the effectiveness of epidemic control. Moreover, we design a constraint for control-action selection that eases its difficulty and further improve exploring efficiency. Extensive experimental results demonstrate that IDRLECA can suppress infections at a very low level and retain more than 95% of human mobility. Sirui Song, Tong Xia, Yong Li 0008 |
ACM Trans. Knowl. Discov. Data | 3 |
| 2023 | Understanding the Long-Term Dynamics of Mobile App Usage Context via Graph EmbeddingabstractWith the increasing diversity of mobile apps, users install many apps in their smartphones and often use several apps together to meet a specific requirement. Because of the evolution of user habits and app functions, the set of apps using at the same time, i.e., app usage context, may change over time, which represents the dynamic correlation of different apps and even the evolution trend of the whole app ecosystem. Therefore, understanding how an apps usage context changes over time is very meaningful. In this paper, based on a seven-year app usage dataset, we explore the long-term app usage context dynamics and understand the underlying reasons and influence factors behind. Specifically, we build app co-occurrence graphs in different periods and learn app embeddings accordingly by leveraging graph embedding algorithm. We then measure the change of app usage context by the distance between neighboring app embeddings. As for the whole app ecosystem, we find that the change rate of app usage context undergoes up and down phrases, and varies in different app-categories. Furthermore, we explore three influence factors correlated with such dynamics. These results will be helpful for stakeholders to better understand the evolution of mobile users app usage behavior. Yali Fan, Zhen Tu, Tong Li 0013, Hancheng Cao, Tong Xia, Yong Li 0008, Xiang Chen 0007, Lin Zhang 0023 |
IEEE Trans. Knowl. Data Eng. | 5 |
| 2022 | Reviving the economy while saving lives: a deep reinforcement learning approach for smart POI reopeningabstractWith the gradual improvements in COVID-19 metrics and the accelerated immunization progress, countries around the world have began to focus on reviving the economy while continuously strengthening epidemic control. POInt-of-Interest (POI) reopening, as a necessity for restoring human mobilities, has become a crucial step to recouple economic recovery and public health management. In contrast to the lock-down policy, POI reopening demands a dynamic trade-off between epidemic interventions and economic costs. In the urban scenario, there exist three key challenges in developing effective POI reopening strategies as follows. (1) During the POI reopening process, there are multiple urban factors affecting the epidemic transmission, which are difficult to simultaneously incorporate and balance in a single reopening strategy; (2) the effects of POI reopening on both economic recovery and epidemic control are long-term, which are hard to capture by static models; and (3) the dual objectives of minimizing infections and maintaining POIs' visits are conflicting, making it difficult to achieve a flexible and scalable trade-off. To tackle the above challenges, we propose Reopener, a deep reinforcement learning (RL) framework for smart POI reopening. First, we utilize a bipartite graph neural network to automatically encode all urban factors that would affect the epidemic prevention and POI visit restriction. Second, we employ a RL-based deep policy network to enable flexible updates in restrictions on POIs along with the trend of epidemic. Third, we design a novel reward function to guide the RL agent to learn smartly, thus comprehensively trading off infections and visit sustainability of POIs. Extensive experimental results demonstrate that Reopener outperforms all baseline methods with remarkable improvements, by reducing the overall economic cost by at least 6.42%. Reopener can effectively suppress infections and support a phase-based POI reopening process, which provides valuable insights for strategy design in post-COVID-19 economic recovery. Huandong Wang, Xiaochen Fan, Tong Xia, Yong Li 0008 |
SIGSPATIAL/GIS | 4 |
| 2022 | Precise Mobility Intervention for Epidemic Control Using Unobservable Information via Deep Reinforcement LearningabstractTo control the outbreak of COVID-19, efficient individual mobility intervention for EPidemic Control (EPC) strategies are of great importance, which cut off the contact among people at epidemic risks and reduce infections by intervening the mobility of individuals. Reinforcement Learning (RL) is powerful for decision making, however, there are two major challenges in developing an RL-based EPC strategy: (1) the unobservable information about asymptomatic infections in the incubation period makes it difficult for RL's decision-making, and (2) the delayed rewards for RL causes the deficiency of RL learning. Since the results of EPC are reflected in both daily infections (including unobservable asymptomatic infections) and long-term cumulative cases of COVID-19, it is quite daunting to design an RL model for precise mobility intervention. In this paper, we propose a Variational hiErarcHICal reinforcement Learning method for Epidemic control via individual-level mobility intervention, namely Vehicle. To tackle the above challenges, Vehicle first exploits an information rebuilding module that consists of a contact-risk bipartite graph neural network and a variational LSTM to restore the unobservable information. The contact-risk bipartite graph neural network estimates the possibility of an individual being an asymptomatic infection and the risk of this individual spreading the epidemic, as the current state of RL. Then, the Variational LSTM further encodes the state sequence to model the latency of epidemic spreading caused by unobservable asymptomatic infections. Finally, a Hierarchical Reinforcement Learning framework is employed to train Vehicle, which contains dual-level agents to solve the delayed reward problem. Extensive experimental results demonstrate that Vehicle can effectively control the spread of the epidemic. Vehicle outperforms the state-of-the-art baseline methods with remarkably high-precision mobility interventions on both symptomatic and asymptomatic infections. Tong Xia, Xiaochen Fan, Huandong Wang, Zefang Zong, Yong Li 0008 |
KDD | 2 |
| 2022 | DeepFlowGen: Intention-Aware Fine Grained Crowd Flow Generation via Deep Neural NetworksabstractObtaining crowd flow distribution with recognized human intention is extremely valuable for a series of applications for metropolitan cities. Previous solutions look at spatial correlation and temporal periodicity based on historical crowd flow information to calculate future crowd flow distribution. However, these mechanisms cannot recognize the intention behind crowd flow. We address this problem by leveraging a key insight – people's intention behind their movement is highly correlated with the point-of-interest (POI) distribution of the corresponding regions and adjacent regions. Therefore, we proposeDeepFlowGento model the complicated relationship between crowd flow, POI, check-ins, and time to generate intention-aware crowd flow. Specifically, we solve the conflict between dynamic crowd flow and static POI distribution by fusing the information in both time and POI domains. Besides, we employ a sequence of residual blocks inDeepFlowGento address the challenges of modeling the diverse temporal rhythms and heterogeneous influence of POI. Furthermore, we examine the generated intention-aware crowd flow from two aspects to substantiate the reasonability ofDeepFlowGen. Extensive experiments demonstrate that our model outperforms the state-of-the-art solutions by at most 30 percent in terms of NRMSE of total crowd flow. Moreover, the correlation between the generated intention-aware crowd flow and the check-in distribution across different categories of POIs is as high as 0.90 and 0.80 in Beijing and Shanghai. Combined with extensive case studies, we demonstrate the strong ability of our model in generating intention-aware crowd flow. Erzhuo Shao, Huandong Wang, Jie Feng 0002, Tong Xia, Hedong Yang, Lu Geng, Depeng Jin, Yong Li 0008 |
IEEE Trans. Knowl. Data Eng. | 4 |
| 2022 | DeepMM: Deep Learning Based Map Matching With Data AugmentationabstractAs a fundamental component in map service, map matching is of great importance for many trajectory-based applications, e.g., route optimization, traffic scheduling, and fleet management. In practice, Hidden Markov Model and its variants are widely used to provide accurate and efficient map matching service. However, HMM-based methods fail to utilize the knowledge (e.g., the mobility pattern) of enormous trajectory big data, which are useful for intelligent map matching. Furthermore, with many following-up works, they are still easily influenced by the common noisy and sparse records in the reality. In this paper, we revisit the map matching task from the data perspective and propose to utilize the great power of massive data and deep learning to solve these problems. Based on the seq2seq learning framework, we build a trajectory2road model with attention mechanism to map the sparse and noisy trajectory into the accurate road network. Different from previous algorithms, our deep learning based model complete the map matching in the latent space, which provides the high tolerance to the noisy trajectory and also enhances the matching with the knowledge of mobility pattern. Extensive experiments demonstrate that the proposed model outperforms the widely used HMM-based methods by more than 10 percent (absolute accuracy) in various situations especially the noisy and sparse settings. Jie Feng 0002, Yong Li 0008, Zhao Xu 0006, Tong Xia, Jinglin Zhang 0003, Depeng Jin |
IEEE Trans. Mob. Comput. | 5 |
| 2022 | To What Extent We Repeat Ourselves? Discovering Daily Activity Patterns Across Mobile App UsageabstractWith the prevalence of smartphones, people have left abundant behavior records in cyberspace. Discovering and understanding individuals’ cyber activities can provide useful implications for policymakers, service providers, and app developers. In this paper, we propose a framework to discover daily cyber activity patterns across people's mobile app usage. The framework first segments app usage traces into short time windows and then applies a probabilistic topic model to infer users’ cyber activities in each window. By constructing and exploring the coherence of users’ activity sequences, the framework can identify individuals’ daily patterns. Next, the framework uses a hierarchical clustering algorithm to recognize the common patterns across diverse groups of individuals. We apply the framework on a large-scale and real-world dataset, consisting of 653,092 users with 971,818,946 usage records of 2,000 popular mobile apps. Our analysis shows that people usually follow yesterday's activity patterns, but the patterns tend to deviate as the time-lapse increases. We also discover five common daily cyber activity patterns, including afternoon reading, nightly entertainment, pervasive socializing, commuting, and nightly socializing. Our findings have profound implications on identifying the demographics of users and their lifestyles, habits, service requirements, and further detecting other disrupting trends such as working overtime and addiction to the game and social media. Tong Li 0013, Yong Li 0008, Mohammad Ashraful Hoque, Tong Xia, Sasu Tarkoma, Pan Hui 0001 |
IEEE Trans. Mob. Comput. | 4 |
| 2021 | AttnMove: History Enhanced Trajectory Recovery via Attentional NetworkabstractA considerable amount of mobility data has been accumulated due to the proliferation of location-based service. Nevertheless, compared with mobility data from transportation systems like the GPS module in taxis, this kind of data is commonly sparse in terms of individual trajectories in the sense that users do not access mobile services and contribute their data all the time. Consequently, the sparsity inevitably weakens the practical value of the data even it has a high user penetration rate. To solve this problem, we propose a novel attentional neural network-based model, named AttnMove, to densify individual trajectories by recovering unobserved locations at a fine-grained spatial-temporal resolution. To tackle the challenges posed by sparsity, we design various intra- and inter- trajectory attention mechanisms to better model the mobility regularity of users and fully exploit the periodical pattern from long-term history. We evaluate our model on two real-world datasets, and extensive results demonstrate the performance gain compared with the state-of-the-art methods. This also shows that, by providing high-quality mobility data, our model can benefit a variety of mobility-oriented down-stream applications. Tong Xia, Yunhan Qi, Jie Feng 0002, Fengli Xu, Funing Sun, Diansheng Guo, Yong Li 0008 |
AAAI | 1 |
| 2021 | Mobility-based Individual POI Recommendation to Control the COVID-19 SpreadabstractSocietal functions have stalled during COVID-19 to reduce its spread in the population. It has been shown that visits to different venues have a large effect on spreading the virus. Hence, population-level mobility interventions like reopening selective category of venues have been proposed, for example, opening schools and offices but preventing people from visiting restaurants. These measures, although help to mitigate infection, still fail to satisfy people’s needs and hope of going back to normality. In this context, here we propose an individual level POI recommendation system that can recommend venues to users according to their preference and at the same time, can lead to as few infections as possible. The key idea behind the system is that the risk of getting infected grows with the number of unique customers that had visited the venue previously, and it is safer to visit a less crowded place during a specific time slot. We evaluate the proposed system using both theory and real check-in datasets from three cities. Based on simulation on real-world data, we present a surprising result: it is possible to recommend POIs in such a way that the total infected population reduces by up to 50% compared to that following original check-ins. This result is comparable to that when 50% of the visits are blocked, yet our method allows all check-in needs. Abhirup Ghosh, Tong Xia |
IEEE BigData | 2 |
| 2021 | One-shot Transfer Learning for Population MappingabstractFine-grained population distribution data is of great importance for many applications, e.g., urban planning, traffic scheduling, epidemic modeling, and risk control. However, due to the limitations of data collection, including infrastructure density, user privacy, and business security, such fine-grained data is hard to collect and usually, only coarse-grained data is available. Thus, obtaining fine-grained population distribution from coarse-grained distribution becomes an important problem. To tackle this problem, existing methods mainly rely on sufficient fine-grained ground truth for training, which is not often available for the majority of cities. That limits the applications of these methods and brings the necessity to transfer knowledge between data-sufficient source cities to data-scarce target cities. Erzhuo Shao, Jie Feng 0002, Yingheng Wang, Tong Xia, Yong Li 0008 |
CIKM | 4 |
| 2021 | Exploring Automatic COVID-19 Diagnosis via Voice and Symptoms from Crowdsourced DataabstractThe development of fast and accurate screening tools, which could facilitate testing and prevent more costly clinical tests, is key to the current pandemic of COVID-19. In this context, some initial work shows promise in detecting diagnostic signals of COVID-19 from audio sounds. In this paper, we propose a voice-based framework to automatically detect individuals who have tested positive for COVID-19. We evaluate the performance of the proposed framework on a subset of data crowdsourced from our app, containing 828 samples from 343 participants. By combining voice signals and reported symptoms, an AUC of 0.79 has been attained, with a sensitivity of 0.68 and a specificity of 0.82. We hope that this study opens the door to rapid, low-cost, and convenient pre-screening tools to automatically detect the disease. Jing Han 0010, Chloë Siegele-Brown, Jagmohan Chauhan, Andreas Grammenos, Apinan Hasthanasombat, Dimitris Spathis, Tong Xia, Pietro Cicuta, Cecilia Mascolo |
ICASSP | 7 |
| 2021 | The INTERSPEECH 2021 Computational Paralinguistics Challenge: COVID-19 Cough, COVID-19 Speech, Escalation & PrimatesabstractThe INTERSPEECH 2021 Computational Paralinguistics Challenge addresses four different problems for the first time in a research competition under well-defined conditions: In the COVID-19 Cough and COVID-19 Speech Sub-Challenges, a binary classification on COVID-19 infection has to be made based on coughing sounds and speech; in the Escalation SubChallenge, a three-way assessment of the level of escalation in a dialogue is featured; and in the Primates Sub-Challenge, four species vs background need to be classified. We describe the Sub-Challenges, baseline feature extraction, and classifiers based on the 'usual' COMPARE and BoAW features as well as deep unsupervised representation learning using the AuDeep toolkit, and deep feature extraction from pre-trained CNNs using the Deep Spectrum toolkit; in addition, we add deep end-to-end sequential modelling, and partially linguistic analysis. Björn W. Schuller, Anton Batliner, Christian Bergler, Cecilia Mascolo, Jing Han 0010, Iulia Lefter, Heysem Kaya, Shahin Amiriparian, Alice Baird, Lukas Stappen, Sandra Ottl, Maurice Gerczuk, Panagiotis Tzirakis, Chloë Siegele-Brown, Jagmohan Chauhan, Andreas Grammenos, Apinan Hasthanasombat, Dimitris Spathis, Tong Xia, Pietro Cicuta, Léon J. M. Rothkrantz, Joeri A. Zwerts, Jelle Treep, Casper S. Kaandorp |
Interspeech | 19 |
| 2021 | Uncertainty-Aware COVID-19 Detection from Imbalanced Sound DataabstractRecently, sound-based COVID-19 detection studies have shown great promise to achieve scalable and prompt digital prescreening.However, there are still two unsolved issues hindering the practice.First, collected datasets for model training are often imbalanced, with a considerably smaller proportion of users tested positive, making it harder to learn representative and robust features.Second, deep learning models are generally overconfident in their predictions.Clinically, false predictions aggravate healthcare costs.Estimation of the uncertainty of screening would aid this.To handle these issues, we propose an ensemble framework where multiple deep learning models for sound-based COVID-19 detection are developed from different but balanced subsets from original data.As such, data are utilized more effectively compared to traditional up-sampling and down-sampling approaches: an AUC of 0.74 with a sensitivity of 0.68 and a specificity of 0.69 is achieved.Simultaneously, we estimate uncertainty from the disagreement across multiple models.It is shown that false predictions often yield higher uncertainty, enabling us to suggest the users with certainty higher than a threshold to repeat the audio test on their phones or to take clinical tests if digital diagnosis still fails.This study paves the way for a more robust sound-based COVID-19 automated screening system. Tong Xia, Jing Han 0010, Lorena Qendro, Ting Dang, Cecilia Mascolo |
Interspeech | 1 |
| 2021 | 3DGCN: 3-Dimensional Dynamic Graph Convolutional Network for Citywide Crowd Flow PredictionabstractCrowd flow prediction is an essential task benefiting a wide range of applications for the transportation system and public safety. However, it is a challenging problem due to the complex spatio-temporal dependence and the complicated impact of urban structure on the crowd flow patterns. In this article, we propose a novel framework, 3- D imensional G raph C onvolution N etwork (3DGCN), to predict citywide crowd flow. We first model it as a dynamic spatio-temporal graph prediction problem, where each node represents a region with time-varying flows, and each edge represents the origin–destination (OD) flow between its corresponding regions. As such, OD flows among regions are treated as a proxy for the spatial interactions among regions. To tackle the complex spatio-temporal dependence, our proposed 3DGCN can model the correlation among graph spatial and temporal neighbors simultaneously. To learn and incorporate urban structures in crowd flow prediction, we design the GCN aggregator to be learned from both crowd flow prediction and region function inference at the same time. Extensive experiments with real-world datasets in two cities demonstrate that our model outperforms state-of-the-art baselines by 9.6%∼19.5% for the next-time-interval prediction. Tong Xia, Yong Li 0008, Jie Feng 0002, Pan Hui 0001, Funing Sun, Diansheng Guo, Depeng Jin |
ACM Trans. Knowl. Discov. Data | 1 |
| 2021 | Understanding Urban Dynamics via State-Sharing Hidden Markov ModelabstractWith the ever-increasing urbanization process, systematically modeling people's activities in the urban space is being recognized as a crucial socioeconomic task. It is extremely challenging due to the lack of reliable data and suitable methods, yet the emergence of population-scale urban mobility data sheds new light on it. However, recent works on discovering activity patterns from urban mobility data are still limited in terms of concisely and specifically modeling the temporal dynamics of people's urban activities. To bridge the gap, we present a State-sharing Hidden Markov Model (SSHMM), a novel time-series modeling method that uncovers urban dynamics with massive urban mobility data. SSHMM models the urban dynamics from two aspects. First, it extracts the urban states from the whole city, which captures the volume of population flows as well as the frequency of each type of Point of Interests (PoIs) visited. Second, it characterizes the urban dynamics of each urban region as the state transition on the shared-states, which reveals distinct daily rhythms of urban activities. We evaluate our method via large-scale real-life mobility dataset. The results demonstrate that SSHMM learns semantics-rich urban dynamics, which are highly correlated with the functions of the region. Besides, it recovers the urban dynamics in different time slots with RMSE of 0.0793 when only learn limited states for the whole city, which outperforms the general HMM by 54.2 percent. Tong Xia, Yong Li 0008, Fengli Xu, Qingmin Liao, Depeng Jin |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2021 | Portfolio Optimization in Traffic Offloading: Concept, Model, and AlgorithmsabstractDue to explosive growth of mobile data over the overburdened cellular network, opportunistic offloading is proposed to transmit the traffic originally transmitted through infrastructure network to delay-tolerant device-to-device networks at the edge of mobile networks. Existing offloading schemes mainly focus on selecting a subset of mobile nodes to work as offloadees, who first download the contents through the infrastructure, and then transmit them to subscriber nodes. However, when there is large amount of contents to be offloaded, and if all contents are disseminated through only one fixed set of offloadees every time, it may result in the risk of extreme cases that only extremely few nodes received the content, even if the expectation is large. This is like putting all of your eggs in one basket. To deal with this problem, we introduce an economic concept, conditional value at risk (CVaR) to measure the risk in offloadee set selection. CVaR is a widely used risk assessment measure for investments, which provides a unified and comprehensive risk evaluation framework for complex investment portfolio. We propose an algorithm to compute a portfolio over multiple offloadee sets with a guarantee on CVaR. Moreover, we prove the feasibility of our methodology from the mathematical point of view. Extensive evaluations with real-world traces show that our proposed offloading scheme can obtain a portfolio with significantly better CVaR, i.e., 91.53 percent performance gain at most, compared with the state-of-the-art solutions. Dianlei Xu, Yong Li 0008, Tong Xia, Pan Hui 0001 |
IEEE Trans. Mob. Comput. | 3 |
| 2020 | A Sequential Convolution Network for Population Flow Prediction with Explicitly Correlation ModellingabstractPopulation flow prediction is one of the most fundamental components in many applications from urban management to transportation schedule. It is challenging due to the complicated spatial-temporal correlation.While many studies have been done in recent years, they fail to simultaneously and effectively model the spatial correlation and temporal variations among population flows. In this paper, we propose Convolution based Sequential and Cross Network (CSCNet) to solve them. On the one hand, we design a CNN based sequential structure with progressively merging the flow features from different time in different CNN layers to model the spatial-temporal information simultaneously. On the other hand, we make use of the transition flow as the proxy to efficiently and explicitly capture the dynamic correlation between different types of population flows. Extensive experiments on 4 datasets demonstrate that CSCNet outperforms the state-of-the-art baselines by reducing the prediction error around 7.7%∼10.4%. Jie Feng 0002, Ziqian Lin, Tong Xia, Funing Sun, Diansheng Guo, Yong Li 0008 |
IJCAI | 3 |
| 2020 | Exploring Automatic Diagnosis of COVID-19 from Crowdsourced Respiratory Sound DataabstractAudio signals generated by the human body (e.g., sighs, breathing, heart, digestion, vibration sounds) have routinely been used by clinicians as indicators to diagnose disease or assess disease progression. Until recently, such signals were usually collected through manual auscultation at scheduled visits. Research has now started to use digital technology to gather bodily sounds (e.g., from digital stethoscopes) for cardiovascular or respiratory examination, which could then be used for automatic analysis. Some initial work shows promise in detecting diagnostic signals of COVID-19 from voice and coughs. In this paper we describe our data analysis over a large-scale crowdsourced dataset of respiratory sounds collected to aid diagnosis of COVID-19. We use coughs and breathing to understand how discernible COVID-19 sounds are from those in asthma or healthy controls. Our results show that even a simple binary machine learning classifier is able to classify correctly healthy and COVID-19 sounds. We also show how we distinguish a user who tested positive for COVID-19 and has a cough from a healthy user with a cough, and users who tested positive for COVID-19 and have a cough from users with asthma and a cough. Our models achieve an AUC of above 80% across all tasks. These results are preliminary and only scratch the surface of the potential of this type of data and audio-based machine learning. This work opens the door to further investigation of how automatically analysed respiratory patterns could be used as pre-screening signals to aid COVID-19 diagnosis. Chloë Siegele-Brown, Jagmohan Chauhan, Andreas Grammenos, Jing Han 0010, Apinan Hasthanasombat, Dimitris Spathis, Tong Xia, Pietro Cicuta, Cecilia Mascolo |
KDD | 7 |
| 2020 | Mobile App Usage Patterns Aware Smart Data PricingabstractThe explosive growth of traffic-consumption by mobile devices is leading to severe cellular network congestion, which is posing challenges for Internet Service Providers (ISPs) to provide good quality services with limited cellular capacity and impacting the user's experience. Data pricing has been proven to be an effective way to enhance both the service quality and ISP's profit. However, traditional data pricing schemes do not consider the real Mobile Application (App) Usage Patterns (MAUPs) among large scale cellular networks. In this paper, MAUPs aware smart data pricing scheme is proposed. In our work, we firstly extract and model the users' app usage behaviors of approximately 9,600 cellular towers as two-dimensional MAUPs (time, app category). Then 7 distinct derived MAUPs are considered to be incorporated into the user satisfaction model and ISP's profit model. The performance of our proposal is evaluated and verified by numerical experiments from the aspects of ISP's profit, consumption surplus, capacity utilization and traffic efficiency. The MAUPs based pricing scheme can be periodically updated according to the operational conditions and therefore significantly instructive for ISPs. Jieli Yin, Yali Fan, Tong Xia, Yong Li 0008, Xiang Chen 0007, Zhi Zhou 0006, Xu Chen 0004 |
IEEE J. Sel. Areas Commun. | 3 |
| 2020 | DeepApp: Predicting Personalized Smartphone App Usage via Context-Aware Multi-Task LearningabstractSmartphone mobile application (App) usage prediction, i.e., which Apps will be used next, is beneficial for user experience improvement. Through an in-depth analysis on a real-world dataset, we find that App usage is highly spatio-temporally correlated and personalized. Given the ability to model complex spatio-temporal contexts, we aim to apply deep learning to achieve high prediction accuracy. However, the personalization yields a problem: training one network for each individual suffers from data scarcity, yet training one deep neural network for all users often fails to uncover user preference. In this article, we propose a novel App usage prediction framework, named DeepApp , to achieve context-aware prediction via multi-task learning. To tackle the challenge of data scarcity, we train one general network for multiple users to share common patterns. To better utilize the spatio-temporal contexts, we supplement a location prediction task in the multi-task learning framework to learn spatio-temporal relations. As for the personalization, we add a user identification task to capture user preference. We evaluate DeepApp on the large-scale dataset by extensive experiments. Results demonstrate that DeepApp outperforms the start-of-the-art baseline by 6.44%. Tong Xia, Yong Li 0008, Jie Feng 0002, Depeng Jin, Hengliang Luo, Qingmin Liao |
ACM Trans. Intell. Syst. Technol. | 1 |
| 2019 | DeepMM: Deep Learning Based Map Matching with Data AugmentationabstractMap matching is important in many trajectory based applications like route optimization and traffic schedule, etc. As the widely used methods, Hidden Markov Model and its variants are well studied to provide accurate and efficient map matching service. However, HMM based methods fail to utilize the value of enormous trajectory big data, which are useful for the map matching task. Furthermore, with many following-up works, they are still easily influenced by the noisy records, which are very common in the real system. To solve these problems, we revisit the map matching task from the data perspective, and propose to utilize the great power of data to help solve these problems. We build a deep learning based model to utilize all the trajectory data for joint training and knowledge sharing. With the help of embedding techniques and sequence learning model with attention enhancement, our system does the map matching in the latent space, which is tolerant to the noise in the physical space. Extensive experiments demonstrate that our model outperforms the widely used HMM based methods more than 10% (absolute accuracy) and works robustly in the noisy settings in the meantime. Jie Feng 0002, Zhao Xu 0006, Tong Xia, Lin Chen 0002, Funing Sun, Diansheng Guo, Depeng Jin, Yong Li 0008 |
SIGSPATIAL/GIS | 4 |
| 2019 | Understanding Urban Dynamics via State-sharing Hidden Markov ModelabstractModeling people's activities in the urban space is a crucial socio-economic task but extremely challenging due to the deficiency of suitable methods. To model the temporal dynamics of human activities concisely and specifically, we present State-sharing Hidden Markov Model (SSHMM). First, it extracts the urban states from the whole city, which captures the volume of population flows as well as the frequency of each type of Point of Interests (PoIs) visited. Second, it characterizes the urban dynamics of each urban region as the state transition on the shared-states, which reveals distinct daily rhythms of urban activities. We evaluate our method via a large-scale real-life mobility dataset and results demonstrate that SSHMM learns semantics-rich urban dynamics, which are highly correlated with the functions of the region. Besides, it recovers the urban dynamics in different time slots with an error of 0.0793, which outperforms the general HMM by 54.2%. Tong Xia, Fengli Xu, Funing Sun, Diansheng Guo, Depeng Jin, Yong Li 0008 |
WWW | 1 |