CWChen Wang

Chen Wang

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Chen Wang has a total of 79 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A comprehensive CFD lifecycle dataset for marine vessel hydrodynamics

    by Song Wang, Chen Wang, Jianchun Wang, Xin Yu, Zhe Xu, Shengguo Li, Linjie Zhang, Yuchao Guo, Jun Ding

    Recent advances in artificial intelligence offer considerable promise for enhancing industrial computational simulation workflows, yet practical adoption is limited by a shortage of high-quality, real-world datasets. Most existing CFD-related datasets focus on a single phase of the simulation lifecycle, typically post-processed flow snapshots, and lack the upstream information needed to train models that can exploit the full pipeline. In this work, we present three such datasets, collected from the China Ship Scientific Research Center during operational industrial workflows. The data cover three marine vessels-two tanker ships and a submarine-whose low-speed, high-block-coefficient hull forms produce complex, separated stern flows. Uniquely, and in contrast to conventional repositories, our dataset spans the complete CFD lifecycle: pre-processing (experimental documentation and geometries), solving (the linear systems A x = b resulting from discretisation), and post-processing (numerical solutions and computational meshes). By assembling these interdependent stages into a single, coherent resource, the dataset is designed to support the development of robust AI models that can learn across phases, while also facilitating research in solver performance evaluation, data management, and flow visualization. Beyond AI, the dataset serves a wider range of research topics, such as benchmark-driven solver evaluation, data-management studies, and flow-field visualization, enhancing its overall utility and impact.

  • Top Cited Papers

    Deep Time Series Models: A Comprehensive Survey and Benchmark

    by Yuxuan Wang, Haixu Wu, Jiaxiang Dong, Yong Liu, Chen Wang, Mingsheng Long, Jianmin Wang

    Time series, characterized by a sequence of data points organized in a discrete-time order, are ubiquitous in real-world scenarios. Unlike other data modalities, time series present unique challenges in learning and modeling due to their intricate and dynamic nature, including the entanglement of nonlinear patterns and time-variant trends. Recent years have witnessed remarkable breakthroughs in time series analysis, with techniques shifting from traditional statistical methods to contemporary deep learning models. In this paper, we delve into the design of deep time series models across various analysis tasks and review the existing literature from two perspectives: basic modules and model architectures. Further, we develop and release Time Series Library (TSLib) as a fair benchmark of deep time series models for diverse analysis tasks. TSLib implements 41 prominent models, including both small- and large-scale time series models, covers 30 datasets from different domains, and supports 5 prevalent analysis tasks. Based on TSLib, we evaluate 16 popular deep time series models and 6 advanced time series foundation models. Empirical findings indicate that models with specific structures are apt only at distinct analytical tasks, providing insights for research and adoption of deep time series models. Code and datasets are available at https://github.com/thuml/Time-Series-Library.


  • Open Access

    Apache IoTDB: A Time Series Database for Large Scale IoT Applications

    by Chen Wang, Jialin Qiao, Xiangdong Huang, Shaoxu Song, Haonan Hou, Tian Jiang, Lei Rui, Jianmin Wang, Jiaguang Sun

    A typical industrial scenario encounters thousands of devices with millions of sensors, consistently generating billions of data points. It poses new requirements of time series data management, not well addressed in existing solutions, including (1) device-defined ever-evolving schema, (2) mostly periodical data collection, (3) strongly correlated series, (4) variously delayed data arrival, and (5) highly concurrent data ingestion. In this paper, we present a time series database management system, Apache IoTDB. It consists of (i) a time series native file format, TsFile, with specially designed data encoding, and (ii) an IoTDB engine for efficiently handling delayed data arrivals and processing queries. We introduce a native distributed solution with distributed queries optimized by parallel operators. We also explore efficient TsFile synchronization mechanisms, ensuring seamless data integration without the need for ETL processes. The system achieves a throughput of 10 million inserted values per second. Queries such as 1-day data selection of 0.1 million points and 3-year data aggregation over 10 million points can be processed in 100 ms. Comparisons with InfluxDB, TimescaleDB, KairosDB, Parquet and ORC over real world data loads demonstrate the superiority of IoTDB and TsFile.


  • Open Access

    Largest Triangle Sampling for Visualizing Time Series in Database

    by Lei Rui, Xiangdong Huang, Shaoxu Song, Chen Wang, Jianmin Wang, Zhao Cao

    In time series visualization, sampling is used to reduce the number of points while retaining the visual features of the raw time series. Area-based Largest Triangle Sampling (LTS) excels at preserving perceptually critical points. However, the heuristic solution to LTS by sequentially sampling points with the locally largest triangle area (a.k.a. Largest-Triangle-Three-Buckets, LTTB) suffers from suboptimal solution and query inefficiency. We address the shortcomings by contributing a novel Iterative Largest Triangle Sampling (ILTS) algorithm with convex hull acceleration. It refines the sampling results iteratively, capturing a broader perspective by integrating more points in each iteration. Remarkably, we prove that the largest triangle can always be found in the precomputed convex hulls, making the iterative sampling still efficient. Experiments demonstrate increased visual quality over state-of-the-art baselines and significant speedups over the brute force approach.


  • Open Access

    BTTackler: A Diagnosis-based Framework for Efficient Deep Learning Hyperparameter Optimization

    by Zhongyi Pei, Zhiyao Cen, Yipeng Huang, Chen Wang, Lin Liu, Philip Yu, Mingsheng Long, Jianmin Wang

    Hyperparameter optimization (HPO) is known to be costly in deep learning, especially when leveraging automated approaches. Most of the existing automated HPO methods are accuracy-based, i.e., accuracy metrics are used to guide the trials of different hyperparameter configurations amongst a specific search space. However, many trials may encounter severe training problems, such as vanishing gradients and insufficient convergence, which can hardly be reflected by accuracy metrics in the early stages of the training and often result in poor performance. This leads to an inefficient optimization trajectory because the bad trials occupy considerable computation resources and reduce the probability of finding excellent hyperparameter configurations within a time limitation. In this paper, we propose Bad Trial Tackler (BTTackler), a novel HPO framework that introduces training diagnosis to identify training problems automatically and hence tackles bad trials. BTTackler diagnoses each trial by calculating a set of carefully designed quantified indicators and triggers early termination if any training problems are detected. Evaluations are performed on representative HPO tasks consisting of three classical deep neural networks (DNN) and four widely used HPO methods. To better quantify the effectiveness of an automated HPO method, we propose two new measurements based on accuracy and time consumption. Results show the advantage of BTTackler on two-fold: (1) it reduces 40.33% of time consumption to achieve the same accuracy comparable to baseline methods on average and (2) it conducts 44.5% more top-10 trials than baseline methods on average within a given time budget. We also released an open-source Python library that allows users to easily apply BTTackler to automated HPO processes with minimal code changes\footnotehttps://github.com/thuml/BTTackler.


  • Self-Tuning Transfer Dynamic Convolution Autoencoder for Quality Prediction of Multimode Processes With Shifts

    by Chao Yang, Qiang Liu, Chen Wang, Jinliang Ding, Yiu-Ming Cheung

    Process shift of multimode process involving data distribution and dynamic relation makes traditional transfer learning methods be intractable and even result in negative transfer. To tackle this issue, this article proposes a novel self-tuning transfer dynamic modeling method for quality prediction of multimode processes. First, in order to capture domain-invariant spatiotemporal (DIST) features, a transfer dynamic convolution autoencoder (TDCAE) with a feature decomposition structure is established. Meanwhile, a first-order vector autoregressive constraint is embedded to extract consistent inner dynamics for DIST features. Then, a shared regression network is established to extract the relations with quality variables. Furthermore, by making full use of private spatiotemporal information from target labeled samples in response to the process shift, the self-tuning TDCAE (STDCAE) aided by a fine-tuning strategy is established for online compensation. Finally, the efficacy of the proposed TDCAE and STDCAE is demonstrated by a comprehensive study of a three-phase flow facility process.


  • Open Access

    Akane: Perplexity-Guided Time Series Data Cleaning

    by Xiaoyu Han, Haoran Xiong, Zhenying He, Peng Wang, Chen Wang, X. Sean Wang

    Dirty data are prevalent in time series, such as energy consumption or stock data. Existing data cleaning algorithms present shortcomings in dirty data identification and unsatisfactory cleaning decisions. To handle these drawbacks, we leverage inherent recurrent patterns in time series, analogize them as fixed combinations in textual data, and incorporate the concept of perplexity. The cleaning problem is thus transformed to minimize the perplexity of the time series under a given cleaning cost, and we design a four-phase algorithmic framework to tackle this problem. To ensure the framework's feasibility, we also conduct a brief analysis of the impact of dirty data and devise an automatic budget selection strategy. Moreover, to make it more generic, we additionally introduce advanced solutions, including an ameliorative probability calculation method grounded in the homomorphic pattern aggregation and a greedy-based heuristic algorithm for resource savings. Experiments on 12 real-world datasets demonstrate the superiority of our methods.