{"title":"时变空间分布过程的有效增量模型约简方法","authors":"Ai Ling , Hao Ru , Xueqin Chen , Kok Lay Teo","doi":"10.1016/j.neucom.2025.130390","DOIUrl":null,"url":null,"abstract":"<div><div>The accurate and efficient modeling of complex spatially distributed processes (SDPs) represents a significant challenge for researchers in the field. A variety of modeling approaches have been developed with the objective of addressing issues related to spatiotemporal modeling. The conventional offline modeling approaches necessitate the availability of a spatiotemporal data set that encompasses the entirety of the system’s dynamic features. It is not possible to fully satisfy this prerequisite in the context of real-world applications, particularly in the case of time-varying SDPs. Furthermore, the process of updating the model by repeatedly applying the offline algorithm is inherently time-consuming. In this paper, we put forth an efficient incremental model reduction approach for time-varying SDPs. Following the initialization phase, the modified Gram–Schmidt orthogonalization method is employed to extract the feature subspace in a sequential manner. The time-space synthesis is then utilized to reconstruct the spatiotemporal dynamics. The efficacy of the model is evaluated on a representative diffusion-reaction process, and the comparative experimental outcomes demonstrate that the presented algorithm is an efficient and effective approach for the online learning of time-varying SDPs.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"643 ","pages":"Article 130390"},"PeriodicalIF":5.5000,"publicationDate":"2025-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient incremental model reduction approach for time-varying spatially distributed processes\",\"authors\":\"Ai Ling , Hao Ru , Xueqin Chen , Kok Lay Teo\",\"doi\":\"10.1016/j.neucom.2025.130390\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The accurate and efficient modeling of complex spatially distributed processes (SDPs) represents a significant challenge for researchers in the field. A variety of modeling approaches have been developed with the objective of addressing issues related to spatiotemporal modeling. The conventional offline modeling approaches necessitate the availability of a spatiotemporal data set that encompasses the entirety of the system’s dynamic features. It is not possible to fully satisfy this prerequisite in the context of real-world applications, particularly in the case of time-varying SDPs. Furthermore, the process of updating the model by repeatedly applying the offline algorithm is inherently time-consuming. In this paper, we put forth an efficient incremental model reduction approach for time-varying SDPs. Following the initialization phase, the modified Gram–Schmidt orthogonalization method is employed to extract the feature subspace in a sequential manner. The time-space synthesis is then utilized to reconstruct the spatiotemporal dynamics. The efficacy of the model is evaluated on a representative diffusion-reaction process, and the comparative experimental outcomes demonstrate that the presented algorithm is an efficient and effective approach for the online learning of time-varying SDPs.</div></div>\",\"PeriodicalId\":19268,\"journal\":{\"name\":\"Neurocomputing\",\"volume\":\"643 \",\"pages\":\"Article 130390\"},\"PeriodicalIF\":5.5000,\"publicationDate\":\"2025-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Neurocomputing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0925231225010628\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231225010628","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Efficient incremental model reduction approach for time-varying spatially distributed processes
The accurate and efficient modeling of complex spatially distributed processes (SDPs) represents a significant challenge for researchers in the field. A variety of modeling approaches have been developed with the objective of addressing issues related to spatiotemporal modeling. The conventional offline modeling approaches necessitate the availability of a spatiotemporal data set that encompasses the entirety of the system’s dynamic features. It is not possible to fully satisfy this prerequisite in the context of real-world applications, particularly in the case of time-varying SDPs. Furthermore, the process of updating the model by repeatedly applying the offline algorithm is inherently time-consuming. In this paper, we put forth an efficient incremental model reduction approach for time-varying SDPs. Following the initialization phase, the modified Gram–Schmidt orthogonalization method is employed to extract the feature subspace in a sequential manner. The time-space synthesis is then utilized to reconstruct the spatiotemporal dynamics. The efficacy of the model is evaluated on a representative diffusion-reaction process, and the comparative experimental outcomes demonstrate that the presented algorithm is an efficient and effective approach for the online learning of time-varying SDPs.
期刊介绍:
Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.