Hongjie Chen

Hongjie Chen

Auto-generated profile, based on publicly available information

Hongjie Chen

Dolby Laboratories, Atlanta, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 February 2024 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
HCHongjie Chen
Hongjie Chen
HEHoda Eldardiry
Hoda Eldardiry
Time-series and graphs have been extensively studied for their ubiquitous existence in numerous domains. Both topics have been separately explored in the field of deep learning. For time-series modeling, recurrent neural networks or convolutional neural networks model the relations between values across timesteps, while for graph modeling, graph neural networks model the inter-relations between nodes. Recent research in deep learning requires simultaneous modeling for time-series and graphs when both representations are present. For example, both types of modeling are necessary for time-series classification, regression, and anomaly detection in graphs. This article aims to provide a comprehensive summary of these models, which we call graph time-series models. To the best of our knowledge, this is the first survey article that provides a picture of related models from the perspective of deep graph time-series modeling to address a range of time-series tasks, including regression, classification, and anomaly detection. Graph time-series models are split into two categories: (a) graph recurrent/convolutional neural networks and (b) graph attention neural networks. Under each category, we further categorize models based on their properties. Additionally, we compare representative models and discuss how distinctive model characteristics are utilized with respect to various model components and data challenges. Pointers to commonly used datasets and code are included to facilitate access for further research. In the end, we discuss potential directions for future research.

20 February 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
HCHongjie Chen
Hongjie Chen
RRRyan Rossi
Ryan Rossi
KMKanak Mahadik
Kanak Mahadik
SKSungchul Kim
Sungchul Kim
HEHoda Eldardiry
Hoda Eldardiry
Effective time-series forecasting methods are of significant importance to solve a broad spectrum of research problems. Deep probabilistic forecasting techniques have recently been proposed for modeling large collections of time-series. However, these techniques explicitly assume either complete independence (local model) or complete dependence (global model) between time-series in the collection. This corresponds to the two extreme cases where every time-series is disconnected from every other time-series in the collection or likewise, that every time-series is related to every other time-series resulting in a completely connected graph. In this work, we propose a deep hybrid probabilistic graph-based forecasting framework called Graph Deep Factors (GraphDF) that goes beyond these two extremes by allowing nodes and their time-series to be connected to others in an arbitrary fashion. GraphDF is a hybrid forecasting framework that consists of a relational global and relational local model. In particular, a relational global model learns complex non-linear time-series patterns globally using the structure of the graph to improve both forecasting accuracy and computational efficiency. Similarly, instead of modeling every time-series independently, a relational local model not only considers its individual time-series but also the time-series of nodes that are connected in the graph. The experiments demonstrate the effectiveness of the proposed deep hybrid graph-based forecasting model compared to the state-of-the-art methods in terms of its forecasting accuracy, runtime, and scalability. Our case study reveals that GraphDF can successfully generate cloud usage forecasts and opportunistically schedule workloads to increase cloud cluster utilization by 47.5% on average. Furthermore, we target addressing the common nature of many time-series forecasting applications where time-series are provided in a streaming version; however, most methods fail to leverage the newly incoming time-series values and result in worse performance over time. In this article, we propose an online incremental learning framework for probabilistic forecasting. The framework is theoretically proven to have lower time and space complexity. The framework can be universally applied to many other machine learning-based methods.

20 July 2025
Verified
Conference Paper
Open access
HCHongjie Chen
Hongjie Chen
RRRyan Rossi
Ryan Rossi
SKSungchul Kim
Sungchul Kim
KMKanak Mahadik
Kanak Mahadik
HEHoda Eldardiry
Hoda Eldardiry

25 April 2024
Verified
Book Chapter
Closed access
PDF file
HCHongjie Chen
Hongjie Chen
RRRyan Rossi
Ryan Rossi
SKSungchul Kim
Sungchul Kim
KMKanak Mahadik
Kanak Mahadik
HEHoda Eldardiry
Hoda Eldardiry

27 April 2026
Verified
Conference Paper
Open access
DSDebopam Sanyal
Debopam Sanyal
HCHongjie Chen
Hongjie Chen
ATAlexey Tumanov
Alexey Tumanov
JKJoshua Kimball
Joshua Kimball

31 August 2026
Verified
Conference Paper
Open access
BNBo Ni
Bo Ni
FDFranck Derononcourt
Franck Derononcourt
HCHongjie Chen
Hongjie Chen
YWYu Wang
Yu Wang
NANesreen Ahmed
Nesreen Ahmed
RRRyan Rossi
Ryan Rossi