Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Evolution and prospect of deep learning in meteorological data assimilation
Haiyan LYU, Lijun ZHOU, Jie ZHANG, Yuan ZHAO, Lina WANG
Journal of Computer Applications    2026, 46 (10): 3354-3364.   DOI: 10.11772/j.issn.1001-9081.2025091135
Abstract (117)   HTML (0)    PDF (834KB)(460)       Save

Data Assimilation (DA) is the core of modern Numerical Weather Prediction (NWP) systems. However, traditional methods are constrained by bottlenecks such as non-linear and non-Gaussian assumptions as well as high computational cost. Deep Learning (DL), with its powerful non-linear fitting and end-to-end optimization capabilities, offers a revolutionary paradigm to address these challenges. Therefore, from a computer science perspective, this paper reviewed systematically and analyzed a three-stage evolutionary trajectory for the application of DL in meteorological DA: component replacement, paradigm shift, and system reconfiguration. First, it elaborated on the component replacement stage, in which DL serves as surrogate models to replace observation operators and correct model errors, thereby addressing traditional bottlenecks. Second, it provided an in-depth analysis of the paradigm shift stage, where generative models, represented by Variational Auto Encoders (VAEs) and diffusion models, reconstruct the assimilation problem as a probabilistic generation task. Third, it discussed the system reconfiguration stage, in which Artificial Intelligence (AI) meteorological foundation models such as FengWu and FuXi were adopted, and the assimilation module was embedded deeply, so as to construct a closed-loop system of integrated assimilation-forecast. Finally, the paper explored the core challenges in this field, including physical consistency, data dependency, and operational deployment, and prospected future research directions, such as neuro-symbolic fusion and open benchmark construction.

Table and Figures | Reference | Related Articles | Metrics
Data stream clustering algorithm based on dependent function
PAN Lina WANG Zhihe DANG Hui
Journal of Computer Applications    2013, 33 (01): 202-206.   DOI: 10.3724/SP.J.1087.2013.00202
Abstract (1377)      PDF (776KB)(679)       Save
The traditional data stream clustering algorithms are mostly based on distance or density, so their clustering quality and processing efficiency are weak. To address the above problems, this paper proposed a data stream clustering algorithm based on dependent function. Firstly, the data points were modeled in the form of matter-element and dependent function was established to solve the problem. Secondly, the value of the dependent function was calculated. According to this value, the degree that data point belongs to a certain cluster was judged. Then, the proposed method was applied to online-offline framework of the data stream clustering. Finally, the proposed algorithm was tested by using the real data set KDD-CUP99 and randomly generated artificial data sets. The experimental results show that clustering purity of the proposed method is over 92%, and it can deal with about 6300 records per second. Compared with the traditional algorithm, the processing efficiency of the algorithm is greatly improved. In the aspects of dimension and the number of cluster, the algorithm shows stronger scalability, and it is suitable for processing large dynamic data set.
Reference | Related Articles | Metrics