ConceptioArchiveNCBI PubMed Central
NCBI PubMed Centralopen access

Data compression of Bridge Resilience Control: Algorithm and case analysis.

Chen M · ncbi_pmc
NCBI PubMed Central · Papers · License: Open Access
Open Source ↗Direct PDF ↓
information security management

Data compression of Bridge Resilience Control: Algorithm and case analysis - PMC Skip to main content An official website of the United States government Here's how you know Here's how you know Official websites use .gov A .gov website belongs to an official government organization in the United States. Secure .gov websites use HTTPS A lock ( Lock Locked padlock icon ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites. Search Log in Dashboard Publications Account settings Log out Search… Search NCBI Primary site navigation Search Logged in as: Dashboard Publications Account settings Log in Search PMC Full-Text Archive Search in PMC Journal List User Guide PERMALINK Copy As a library, NLM provides access to scientific literature. Inclusion in an NLM database does not imply endorsement of, or agreement with, the contents by NLM or the National Institutes of Health. Learn more: PMC Disclaimer | PMC Copyright Notice PLoS One . 2026 Apr 15;21(4):e0346272. doi: 10.1371/journal.pone.0346272 Search in PMC Search in PubMed View in NLM Catalog Add to search Data compression of Bridge Resilience Control: Algorithm and case analysis Ming Chen Ming Chen 1 School of Architecture Engineering, Shanghai ZhongQiao Vocational and Technical University, Shanghai, China Conceptualization, Data curation, Formal analysis, Funding acquisition, Investigation, Methodology, Project administration, Resources, Software, Supervision, Validation, Visualization, Writing – original draft, Writing – review & editing Find articles by Ming Chen 1, * Editor: Aslani Babak 2 Author information Article notes Copyright and License information 1 School of Architecture Engineering, Shanghai ZhongQiao Vocational and Technical University, Shanghai, China 2 Memorial Sloan Kettering Cancer Center, UNITED STATES OF AMERICA ✉ * E-mail: [email protected] Competing Interests: The authors have declared that no competing interests exist. Roles Ming Chen : Conceptualization, Data curation, Formal analysis, Funding acquisition, Investigation, Methodology, Project administration, Resources, Software, Supervision, Validation, Visualization, Writing – original draft, Writing – review & editing Aslani Babak : Editor Received 2025 Sep 15; Accepted 2026 Mar 17; Collection date 2026. © 2026 Ming Chen This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. PMC Copyright notice PMCID: PMC13082729  PMID: 41984979 Abstract Bridge inspection and structural health monitoring represent the primary approaches to managing bridge resilience. Data acquired through inspection and monitoring activities provides an effective technical basis for the systematic implementation of bridge resilience control strategies. Yet, uninterrupted monitoring and diverse inspection campaigns have yielded an enormous volume of data, which directly imposes comprehensive and stringent challenges on data storage, transmission and processing. Consequently, data compression has become a research priority in the field of bridge resilience control. However, existing data compression algorithms are all general-purpose data processing techniques, which decouple the intrinsic physical relevance between monitoring data and bridge structural behaviors. To tackle this limitation, this study integrates domain knowledge, the time-series characteristics of bridge monitoring data, and bridge deterioration models into the design of a novel data compression algorithm. This approach addresses the issue of indiscriminate data compression inherent to conventional algorithms, thereby enabling efficient data compression while preserving critical bridge structural state information. By incorporating domain knowledge, the proposed method transforms raw monitoring data into data information with engineering attributes. based on these attributes, a set of interrelated monitoring data is further converted into a small subset of key data that is directly applicable to bridge resilience control practice. Leveraging the steady-state variation law of bridge operational performance, the dynamic structural characteristics of bridges are extracted from time-series monitoring data, which correspondingly reduces the storage demand of time-series datasets. For data sampling intervals interrupted by various types of system faults, a sparse data supplementation method is proposed. After data supplementation, the complete dataset is further refined by utilizing the inherent time-series characteristics of the monitoring data, which not only ensures data integrity but also further reduces the overall data volume. Simulation analyses demonstrate that the domain knowledge-based compression method achieves a data compression ratio of 75%. Moreover, the comprehensive compression ratio exceeds 92% after the synergistic processing of time-series feature extraction and sparse data supplementation, with a data fidelity rate of 95%. These performance metrics indicate that the proposed method can reduce the data storage costs and transmission bandwidth consumption associated with bridge resilience control by 75% to 92%. Meanwhile, the 95% feature retention accuracy satisfies the engineering precision requirements for bridge resilience control assessments, which effectively reconciles the inherent contradiction between data compression efficiency and structural evaluation accuracy. 1. Introduction 1.1 Background Bridges constitute the core components of urban infrastructure systems, and their structural resilience plays a decisive role in the overall resilience of urban engineering systems. Conventional structural detection, structural health monitoring (SHM), and other technical methodologies have exerted a fundamental role in the resilience assessment and operational maintenance management of bridge structures. Nevertheless, with the rapid advancement of science and engineering technologies, bridge inspection and real-time structural monitoring are generating an enormous volume of multi-source heterogeneous data streams. Although such datasets contain comprehensive information reflecting the actual service status of bridges, they also impose severe challenges and heavy burdens on the efficiency of data storage and real-time transmission in engineering applications. Taking the bridge health monitoring system as a typical instance, various types of sensors are deployed for continuous data acquisition via high-frequency sampling protocols. Uncompressed raw monitoring data rapidly depletes storage resources, which inevitably results in a substantial escalation in capital expenditure pertaining to hardware capacity expansion and long-term maintenance. By using data compression technology to reduce the volume of data, the deployment and maintenance costs of servers and cloud storage will be significantly reduced. At the same time, it supports the full lifecycle data archiving of bridges, providing a data foundation for long-term performance evolution analysis of bridges. In the field of bridge resilience control, commonly used algorithms can be divided into three categories: lossless compression, lossy compression, and time-series data-specific compression. Lossless compression algorithms include Huffman coding, the LZW algorithm, and the DEFLATE algorithm. Huffman encoding is based on data frequency allocation of encoding length. The LZW algorithm achieves adaptive encoding by dynamically constructing a dictionary. The DEFLATE algorithm combines LZ77's sliding window matching with Huffman encoding. The typical characteristic of non-computational compression is that the reconstructed data is completely identical to the original data. The bridge lossy compression algorithm improves compression rate by discarding non-critical information. Typical lossy compression algorithms include Discrete Cosine Transform (DCT), Wavelet Transform, and Principal Component Analysis (PCA). DCT converts time-series data into frequency-domain data while retaining low-frequency trend components; the Wavelet transform takes into account both time-series and frequency-domain local features, and can capture data mutation signals; PCA achieves high-dimensional data dimensionality reduction through orthogonal transformation and is often used as a preprocessing step in intelligent algorithms. The specialized compression algorithm for time-series data is designed for monitoring data with strong correlation and periodicity, including differential encoding, rotary gate algorithm (SDT), and online piecewise linear approximation (OLA). Differential encoding encodes the residuals of adjacent data, often combined with entropy encoding. The revolving door algorithm is based on a threshold, fits data with a line, and saves the inflection point. OLA algorithm divides data segments in real time, which is suitable for online compression tasks of edge computing nodes. With the rapid development of artificial intelligence technology, based on the core requirements of structural disaster resistance, recovery and adaptation, intelligent algorithms integrate traditional compression principles with artificial intelligence, edge computing and other technologies to achieve data dimensionality reduction and key feature retention on the premise of ensuring the accuracy of resilience assessment, providing core support for real-time early warning, disaster response and long-term operation and maintenance. The first research direction of intelligent algorithms is the adaptive optimization results of classical algorithms, such as the adaptive revolving gate algorithm based on LSTM network optimization threshold, and the wavelet transform optimization method that integrates a genetic algorithm to screen wavelet basis functions. The second research direction is based on AI-driven deep compression technology. The research content includes an auto-encoder that integrates high compression rate and damage feature preservation with key resilience evaluation indicators as constraints, compressed sensing that reduces the sampling and transmission pressure of sensing nodes based on data sparsity, a lightweight neural network compression scheme adapted to edge deployment based on quantization, pruning, and other technologies, combined with domain adaptive principal component analysis, and graph neural network fusion compression based on bridge structure topology. These intelligent algorithms can adapt to engineering scenarios such as extreme disaster monitoring, long-term resilience assessment, real-time edge warning, and multi-source data fusion. The goal of the algorithm is to transmit disaster mutation data with low power consumption and store historical data with a high compression ratio, in order to support performance degradation analysis, reduce node resource consumption, and accurately evaluate bridge resilience. 1.2 Motivation and innovation The existing research results on data compression provide technical support for data compression in the field of bridge resilience control, especially with the rapid development of intelligent algorithms, greatly improving the level of data compression. However, there are still some key technologies that need to be broken through in the field of data compression for bridge resilience control. Firstly, the general data compression algorithm does not involve knowledge in the field of bridges, and does not take into account the mechanical properties of bridges and the physical meaning of data, which may result in the loss of key structural state information in compressed data. Second, bridges themselves and the monitoring data collected during their operational time exhibit considerable inherent redundancy, yet existing general-purpose compression algorithms fail to effectively leverage this redundancy for data compression purposes. Thirdly, due to the limitations of the collection equipment and extreme weather, the data collected for bridge resilience control also has the characteristic of sparsity, which requires data filling to be effectively applied. To address the aforementioned issues, research has been conducted on the following aspects: Firstly, a data compression method based on knowledge in the field of bridge resilience control has been proposed, which reduces the geometric data volume of bridges. Secondly, a time-series data compression method has been proposed. This method focuses on data within the coverage range of the time step window, achieving dynamic compression of time-series data. Thirdly, a method based on sparse data filling of pre- and post-dataset is proposed, which supplements sparse data in the time-series and refines the supplementary data, solving the problem of data loss in the field of bridge rebound control. 2. Related work Bridge health monitoring is the main technical means of bridge resilience control. The research and application of bridge health monitoring began in the 1970s. After the 1990s, with the rapid development of large-scale bridge construction, bridge health monitoring systems have been widely applied. However, the application of a large number of data collection methods has led to an unusually large amount of data obtained for bridge health monitoring, prompting data compression processing to become the main research direction for bridge health monitoring. Traditional data compression methods have been widely used in the data processing of bridge health monitoring systems, including wavelet transform, Fourier transform, PCA, Empirical Mode Decomposition, Huffman Encoding, SAX, and their fusion applications. Wavelet transform is a mathematical framework for multi-scale decomposition using adjustable scale wavelet functions. Its core principle is to decompose signals into components of different scales and compress them by removing redundant information. For example, Lorenzo Bernardini et al. [ 1 ] proposed a bridge damage detection method based on driving vibration. By using the wavelet transform to extract the time-frequency characteristics of vibration signals, this method can maintain a damage recognition accuracy of over 95% even when the data compression rate reaches 85%. The Fourier transform is a mathematical tool that converts time-domain signals into frequency-domain signals. Its core is to decompose any periodic or non-periodic signal that satisfies the Dirichlet condition into a superposition of sine/cosine waves of different frequencies, amplitudes, and phases. The Fourier transform is suitable for data compression of periodic, stationary signals, and the compressed data can be directly applied to feature extraction. For example, Premjeet Singh et al. [ 2 ] proposed a method that integrates natural excitation techniques and empirical Fourier decomposition to analyze environmental bridge vibration data and determine the modal parameters of the bridge. This method can provide an accurate and robust estimation of bridge modal parameters. PCA is an unsupervised data dimensionality reduction and feature extraction method that maps high-dimensional data to a low-dimensional space through linear transformation, reducing redundancy while preserving the main information of the data. Principal component analysis can eliminate the data correlation between sensors in bridge health monitoring systems and is suitable for large-scale multi-source data compression, with a data compression rate of over 90% [ 3 ]. EMD is an adaptive signal decomposition method that decomposes complex non-stationary and nonlinear signals into several stationary and physically meaningful intrinsic mode functions and a residual component. The empirical mode decomposition method does not require prior knowledge and has strong adaptive ability. This method is suitable for bridge health monitoring in complex environments, with a data compression rate of up to 50% while reducing signal noise [ 4 ]. Huffman encoding is a lossless data compression algorithm that reconstructs data that is completely identical to the original data after compression. This method can solve the problem of low spatial efficiency caused by unpredictable outliers in the compression process of time series data [ 4 ]. SAX is a data dimensionality reduction and symbolic representation method for time series. Its core is to convert continuous time series into discrete symbol streams, which can significantly compress data volume while preserving key features. After receiving real-time perception data in the monitoring system, SAX is applied to compress the data, and then efficient classification tasks are performed based on the compressed data to complete the evaluation of bridge structure status [ 4 ]. In order to integrate the advantages of traditional compression algorithms, scholars have fused multiple algorithms and applied them to data processing in the field of bridge health monitoring. For example, Zhou L et al. [ 5 ] proposed a scheme that combines complementary set empirical mode decomposition, wavelet threshold denoising, and PCA fusion to achieve data reduction while denoising. Zhang Feng Yuan et al. [ 6 ] proposed a compression method combining wavelet transform and LZW encoding, and applied multiple sets of actual sampling data for simulation testing. The results showed that the compression ratio was better than 10.8. The advantages of traditional data compression algorithms are mature principles, strong hardware adaptability, and high accuracy in data restoration after compression. However, traditional data compression algorithms are limited to simple data compression, and their compression process and feature extraction process are separated, requiring a redesign of the feature extraction algorithm for bridge structures. With the rapid development of artificial intelligence technology, the application of machine learning in the field of bridge resilience control has received widespread attention from scholars and the engineering community. Common machine learning methods include Bayesian, CNN, LSTM, Transformer, GNN, Reinforcement learning, etc. The Bayesian method is a statistical inference framework based on probability theory, whose core is to update the knowledge of unknown parameters through prior probabilities and observation data, and output a posterior probability distribution. Kullaa Jyrki [ 7 ] combined Bayesian theory with virtual sensing technology to solve the problem of dense sensor networks and repeated collection of vibration data, generating a large amount of data that needs to be stored. CNN is suitable for processing data with a grid structure. In bridge resilience control, the combination of CNN's convolutional layer, pooling layer, and fully connected layer is used to extract data features and compress the original data [ 8 ]. LSTM excels at capturing long-term dependencies of time-series data. LSTM is often combined with convolutional networks, generative adversarial networks, etc., for bridge monitoring data compression, which can reduce data volume and ensure the accuracy of subsequent structural state evaluation. LSTM is a special RNN architecture that is designed with gating mechanisms and cell states at its core. LSTM can map high-dimensional raw data to a low-dimensional space while preserving its implicit structural features, thereby reducing data transmission volume [ 9 ]. Transformer is a deep learning model proposed by the Google team, which uses a self-attention mechanism to directly calculate the correlation weight between each position in the sequence and all other positions, achieving the function of capturing global dependencies and complex correlations of data [ 10 ]. Transformer uses Embedding technology to transform high-dimensional data into fixed-dimensional feature vectors, which can significantly compress data and save storage space and data transmission. GNN is suitable for processing graph-structured data, adept at capturing topological relationships between data, achieving feature extraction, and data compression. GNN is commonly used to identify defects such as cracks, concrete spalling, and steel corrosion in bridge structures, and can compress high-dimensional data into low-dimensional data [ 11 ]. The advantages of reinforcement learning are dynamic adaptive decision-making and multi-objective optimization. Through the interaction learning between the agent and the environment, redundant information is eliminated, achieving dimensional compression of high-dimensional data [ 12 ]. The research on machine learning algorithms focuses on the accuracy of data compression, but neglects the physical requirements of bridge resilience control, and has shortcomings such as data dependence and poor interpretability. Improvement is needed to establish the correlation between machine learning results and the mechanical principles of bridge structures. During the operational time of bridges, both bridge inspection and bridge health monitoring obtain data with time-series characteristics. Therefore, the compression of time-series data is an important aspect of bridge resilience control. In existing literature, there are relatively few studies that directly focus on compressing time-series data of bridges, and the vast majority of the literature focuses on feature extraction of bridges. The process of extracting bridge features is also the process of compressing time-series data. Time-series data compression algorithms are divided into two categories: lossless compression and lossy compression. Lossless compression is a reversible compression technique that achieves 100% restoration of compressed data by identifying and eliminating statistical redundancy in the data [ 13 ]. The core principle of lossy compression is to actively discard redundant or secondary information in the data that has no significant impact on the target application scenario in exchange for a higher compression ratio, allowing irreversible information loss in the compression and decompression process. Lossy compression is the main method for processing bridge time-series data. At present, research on lossy compression algorithms for bridge temporal data is focused on the field of machine learning. On the basis of maintaining the status information of the bridge, scholars have integrated multiple machine learning algorithms to compress the temporal data of the bridge. For example, combining CNN with BiGRU can extract data features while identifying temporal features between data, achieving data compression [ 14 ]. In order to predict the degradation of high-strength steel wire in long-term service, Long Xiao et al. [ 15 ] proposed a hybrid prediction model that integrates the sparrow search algorithm and LSTM. Simulation analysis shows that the algorithm has significant advantages in both convergence speed and optimization accuracy. Wang Ziyi et al. [ 16 ] integrated the grey wolf optimization algorithm and LSTM, using the grey wolf optimization algorithm to synergistically optimize the hyper-parameters of LSTM, while integrating temporal feature extraction and signal decomposition techniques. The case analysis results indicate that, compared to CNN and LSTM, the algorithm combining the grey wolf optimization algorithm and LSTM is more suitable for bridge displacement prediction tasks. In addition, time-series data compression algorithms in other fields also have certain reference value for the field of bridge engineering. For example, in order to solve the problem of the relatively lagging development of computing power and storage capacity in high-performance computing platforms in computational fluid dynamics, Adalberto Perez et al. [ 17 ] introduced Gaussian process regression under the Bayesian framework, which can achieve posterior recovery of initially discarded information. Research has confirmed that this method is not only suitable for compressing three-dimensional turbulent spatial field data, but also for compressing discrete time series datasets. In the field of the Internet of Things, efficient data compression technology is crucial for reducing storage costs and improving query performance. Due to its high precision and wide dynamic range, floating-point sequential data poses great challenges to data compression. To address this issue, Wenjing Wang et al. [ 18 ] proposed a numerical pattern-aware compression algorithm for floating-point time-series data. This algorithm introduces a classification model at the time window level to identify hidden numerical patterns in the data, and constructs a two-layer decision architecture to achieve a balance between compression ratio and time overhead. Johannes Pöppelbaum et al. [ 19 ] proposed a novel quaternion temporal data compression method based on neural network models. This method first divides long-term data into several data segments, extracts the minimum, maximum, mean, and standard deviation of each data segment as representative features, and encapsulates these features into quaternions to generate quaternion numerical time series data. In the field of cloud-based digital twin systems, monitoring key performance indicators is the core link to ensure system security and reliability. However, the monitoring data generated by the system is massive, and data compression technology has become a necessary means to save data transmission bandwidth and storage space. Zicong Miao et al. [ 20 ] proposed a collaborative compression method for multivariate temporal data based on a two-step compression scheme. This method first performs a morphology-based clustering algorithm to group multivariate temporal data; Subsequently, it optimizes the compressive sensing technology to achieve collaborative compression of grouped data. The experimental results show that this method can achieve efficient data compression while effectively preserving the complex temporal correlations between indicators: at a compression ratio of 30%, the root mean square error of the correlation between reconstructed data and original data is only 0.0489. 3. Related definitions 3.1 Data Data is the fine-grained information of bridge structures, and the data for bridge toughness control is defined as equation (1) d i = < l i , t i , v i , r i , k i , w i > (1) In equation (1), d i is the data. l i is the label of the data, which has uniqueness in bridge resilience control. t i is the type of data. v i is the value of the data. r i is the associated information of the data. k i is the knowledge information that constrains the data. w i is the data weight used to represent the importance of data d i in data compression, w i ∈ [ 0 , 1 ) . For data with different knowledge constraints, there are significant differences in the value of w i . Taking the section in bridge structures as an example, for rectangular sections, the width data b and height data h have the same importance when calculating the inertia moment of the section. However, for I-shaped sections, the importance of flange thickness and web height is significantly higher than other data. The dataset consisting of all data for bridge resilience control is defined as equation (2). D = { d 1 , d 2 , … … . , d n } (2) The dataset represented by equation (2) is a collection of various types of data for bridge resilience control. The amount of data contained in this set increases with increased operational time throughout the entire life cycle of the bridge. The dataset is the direct object of Data compression research. 3.2 Knowledge Knowledge is the core element that distinguishes different application fields. The knowledge in the field of bridges is defined as equation (3) k i = < k t i , k , k r i , s , k v i , v > (3) In equation (3), k t i , k is the identifier for knowledge k i . k r i , s is the relationship between the value v i of data d i and the knowledge value k v i , v , k r i , s ∈ { > , < , = = , ≥ , ≤ , … … } . k v i , v is the value of knowledge k i , which comes from various codes or experiences. Therefore, the determination of data d i compliance does not need to be obtained through training of large-scale models, which can significantly reduce the training workload of large-scale models. In this study, knowledge was applied to large-scale models through knowledge templates. Different data correspond to different domain knowledge, and the corresponding knowledge templates are also different. The cross-sectional knowledge template is defined as equation (4) T = { ( d i ⋈ d i + 1 ⋈ … ) , ( d j ⋈ d j + 1 ⋈ … ) , … } (4) In equation (4), ⋈ represents the knowledge association between data. For example, in the cross-sectional knowledge template, ⋈ is the angle between the data and the x − axis . 3.3 Correlation Correlation refers to the correlation between data. The correlations studied in this article include geometric correlations and temporal correlations. Geometric correlation refers to the geometric shapes or structures composed of data within the subset D k of a dataset, D k ⊂ D . When D k = = D , D k constitutes the entire bridge structure. Time-series correlation refers to the correlation generated in bridge structure over time. For example, the acceleration data and displacement data collected by the bridge health monitoring system all satisfy time-series correlation. 3.3.1 Geometric correlation. Based on geometric correlation, data can be used to establish sections, components, substructures, etc. Geometric correlation is defined as equation (5) r i = ( d i , r t i , r p i , d j , d j + 1 … … ) (5) In equation (5), d i represents the data involved in the correlation with r i . r t i is the correlation type, for cross-sectional data r t i = = S ~ . r p i is the correlation parameter. In the geometric correlation of cross-sections, r p i = { m i , 1 : p i , 1 , m i , 2 : p i , 2 , … … } . m i , j is the key of the correlation, used to represent the attributes of the correlation. p i , j is the value of the correlation, used to characterize the specific function of the correlation. d j is the data associated with the influence of r i . d i is related to the engineering characteristics and correlation attributes, and can be one (section) or multiple (substructure or structure). By applying geometric correlations, data can be integrated and evolved into sections, components, substructures, and structures. 3.3.2 Time-series correlation. Time-series correlation represents the variation of data over time. Time-series correlation can be continuous or discrete, with equal or unequal intervals. Time-series correlation is defined as equation (6). r i = ( r t i , r t t ) (6) In equation (6), r t i represents the correlation type, which can be acceleration, displacement, strain, etc. r t t is the time of data acquisition. Time-series correlation can characterize the full lifecycle changes of certain data during the operational time of bridge structures, and is the most direct information for recording the continuous changes in bridge operation status. 4. Data compression methods The goal of Data compression is to reduce the amount of data required for low bridge resilience control supported by large models. It mainly includes three aspects: first, knowledge-based compression which mainly deals with the compression of data with geometric correlations in bridges. The second is based on time-series compression, which mainly deals with the compression of data with time-series correlations. The third is sparse data compression, which mainly deals with the compression of incomplete data in bridge resilience control. 4.1 Data compression based on domain knowledge The significant difference between bridge resilience control data and conventional data lies in its domain engineering properties. The application of these engineering properties helps to significantly reduce the amount of data required for large-scale model training and improve model training efficiency. 4.1.1 Weight setting. The main problem solved by intelligent algorithms in existing large-scale models is to find the optimal solution, and the selection of weights is one of the core components of intelligent algorithms. Knowledge based Data compression applies domain knowledge to weight adjustment, avoiding the traditional method of using a large amount of data to train and adjust weights, which can significantly reduce the amount of training data. For example, in the process of refining cross-sectional data, each data d i has a corresponding importance coefficient w i . Based on w i , the weights of the large-scale model algorithm can be adjusted to accelerate convergence speed. Taking the commonly used neural network in large-scale models as an example, its output function and squared error are given by equations (7) and (8), respectively. y i = f ( ξ i ) = ∑ j = 0 L ω j i x j i (7) In equation (7), y i is the output of the neural network. f is the activation function, ω j i is the connection weight between the j th input neuron and the i -th output neuron, and L is the number of all input neurons. e ( ω ) = 1 2 ∑ i = 1 J ( h i − y i ) 2 (8) In equation (8), h i is the expected output value, and J is the number of output neurons. Using gradient descent optimization algorithm, the weight update rule is equation (9) ω j i = ω j i − η j i x j i ( y i − h i ) (9) In equation (9), η j i is the learning factor, which is generally a constant (positive value). Therefore, the selection of η j i becomes the key to the efficiency and quality of large-scale model training. Smaller η j i values have lower training efficiency, while larger η j i values may not achieve the optimal solution. In the process of data compression based on domain knowledge, η is designed as a variable whose value is limited by the importance coefficient w j corresponding to d j . Taking the I-shaped cross-section as an example, the learning factor is shown in equation (10). η j i = − 0 . 2 × d d ξ ( 1 − e ξ 1 + e ξ ) (10) ξ = 1 − ( d j ( w j ) ) (11) In equation (11), d j ( w j ) is used to extract the importance coefficient of the data d j . The physical meaning of equation (10) is that a smaller learning factor is adopted for the data with higher importance, while a larger learning factor is adopted for the data with lower importance, so as to improve the training efficiency of the large model. 4.1.2 Algorithm. The difference between knowledge-based Data compression algorithms and traditional algorithms lies in the application domain knowledge setting learning factor η j i . At the same time, domain knowledge is applied to convert data d i into bridge data with engineering properties. Taking the I-shaped section as an example, d i stores data such as flange width, thickness, and web height, which can be combined into an I-shaped section through domain knowledge. A neural network model is invoked in the proposed algorithm. This neural network model is a fully connected deep neural network. The input layer consists of 4 feature dimensions; the hidden layer is composed of three layers with the ReLU activation function adopted, and the output layer contains a single neuron with a linear activation function applied. In the process of model training, adaptive training is realized by means of early stopping and learning rate decay, which not only ensures the convergence performance of the model, but also mitigates overfitting. Besides, the differentially weighted features are applied throughout the entire training process. The mean squared error (MSE) is selected as the loss function for this neural network. This loss function has excellent compatibility with the Adam optimizer, which enables stable gradient calculation and fast convergence speed. Meanwhile, the square term in the mean squared error imposes a heavier penalty on large errors, thus driving the model to prioritize the correction of samples with large deviations. Algorithm: Bridge Section Data Closed-Loop Processing and Dataset Update Algorithm // Input: D – Original bridge structure dataset; T – Cross-sectional data template // Output: D – Updated bridge structure dataset Algorithm BridgeSectionDataProcessing( D , T ) D c = ∅ : for each d i in D do if d i is cross-sectional data then current_d = d i while current_d. r ≠ ∅ do Add current_d to D c current_d = current_d. r end while Add current_d to D c end if end for D ― = NeuralNetworkModel( D c ) for each d ― i in D ― do Create new data point d ― k d ― k .v = d ― i Add d ― k to D end for RecursiveRemove( D , d i , d i . l ) return D end Algorithm 4.2 Compression of time-series data The data for bridge resilience control includes real-time data collected by the bridge health monitoring system. The typical characteristic of this type of data is continuous cyclic sampling, with an exceptionally large volume of data that requires a significant amount of computing and communication resources. The method of time-series data compression is to analyze and transform the data within the window period, and then replace the entire window period with the center point data. 4.2.1 Definition and transformation of time-series data. (1) Displacement mode dataset The definition of displacement mode dataset is shown in equation (12). A = { a 1 , a 2 , … … , a n } (12) In equation (12), a i is the displacement mode value analyzed based on the i -th sensor. a i is an ordered set that is time-dependent. n is the number of sensors in the collection system. The acquisition time of a 1 , a 2 , … … , a n is synchronized. a i = { g k , i , g k , i + 1 , ⋯ ⋯ , g k , i + z } (13) In equation (13), g k , i is the displacement mode value at time t 0 , and g k , i + z is the displacement mode value at time t z . The format g k , i , g k , i + 1 , ⋯ is equation (1). (2) Window Size Time-series data compression refers to the compression processing of data within the window period. The size of the window is defined as the window size, denoted by W . When W is small, the data loss is relatively small while the compression ratio is low; when W is large, the compression ratio is high, whereas the data loss is relatively large. The window size is correlated with the operational time of the bridge and abrupt incident during its operation. According to the nonlinear model for natural deterioration of concrete proposed in Ref. [ 21 ], it is expressed as equation (14). S ( θ ) = { 9 5 0 ≤ θ ≤ 1 9 5 − 0 . 0 6 6 ( θ − 1 ) 2 θ ≥ 2 (14) In equation (14), S ( θ ) denotes the bridge technical condition in the θ -th year, and the value of 95 represents the initial condition score of the bridge. The initial value of the window size can be selected according to the operational time of the bridge based on equation (14). The initial value of W is calculated by equation (15) as follows: W = ⌈ S ( θ ) ⌉ (15) (3) Data transformation Data transformation is the transformation of time-series data for bridge resilience control based on engineering properties. After data transformation, the engineering significance of the data becomes clearer and the process of Data compression can be simplified. For example, using equation (16) to transform the displacement mode of multiple acquisition points at the same time into a curvature mode φ ― i = φ i − 1 − 2 φ i + φ i + 1 l 2 (16) In equation (16), φ ― i is the curvature mode at measurement point i . φ i is the displacement mode at measurement point i . l is the distance between two measuring points. By data transformation, the displacement mode obtained by the acquisition system is converted into the curvature mode of each measuring point. 4.2.2 Time-series Data compression algorithm. Applying Data compression algorithms to process curvature modes within the window and replacing time-series data with center point data can reduce the amount of system data. The steps of Data compression are as follows. Algorithm: Curvature Mode Data Compression Based on GIN Classification // Input: // - G : Curvature mode dataset (raw input) // - θ : Bridge operational time (parameter) // Output: D ― – Compressed curvature mode Algorithm TimeSeriesDataCompression( G , θ ) D ― = ∅ W = ⌈ S ( θ ) ⌉ for each D t i W in D do g t i = GenerateCurvatureModeDiagram( D t i W ) Add g t i to G X = CallGINClassification( G ) while X > 1 do W = W / 2 // Halve the window step size X = CallGINClassification( G ) end while sum_dj = 0 for j from 1 to W do sum_dj = sum_dj + d j end for d ― = sum_dj / W Add d ― to D ― Remove d j from G end for if G ≠ ∅ then goto Step 3 // Re-enter loop if unprocessed data remains in G end if return D ― end Algorithm This algorithm transforms displacement modes into curvature modes and applies a large-scale image classification algorithm to classify curvature mode maps within a time step. When the number of classifications X = 1 , it is considered that the curvature mode data at each time point can be refined, and the mean of all curvature modes is taken as the representative value of the refined data. In the above algorithms, the GIN model is invoked to classify the graphs generated by the curvature mode. When the number of categories X = 1 , the data in this category is compressed by taking the mean value of the data within the category. When the number of categories X > 1 , half of the window size is used to perform reclassification. Meanwhile, the data fidelity rate is set to 95% in the program design. 4.3 Sparse data compression Affected by factors such as unexpected equipment failures and extreme weather, the data acquired by the information acquisition system for bridge resilience control may suffer from missing sampling, leading to incomplete data information [ 22 – 24 ]. Directly discarding sparse data will reduce the continuity of bridge resilience control, and fail to effectively characterize the continuous variation of the bridge's operational performance throughout its whole life cycle. To effectively utilize these sparse data, the sparse data is first supplemented in this study, and then compressed with the time series data compression algorithm introduced in Section 4.2.2. The methods for data supplementation are as follows: The compensation window size for missing data is set as W m d in accordance with Equation (15). Let the missing data set be D t k = { d 1 t k , d 2 t k , ⋯ ⋯ , d n t k } , where d i t k denotes the missing value of the i -th sensor, n represents the number of sensors in the acquisition system, and t k is the sampling time. The j -th data in the preceding dataset window with missing values is taken as D ― W m d , j t k = { d ― 1 , j t k , d ― 2 , j t k , ⋯ ⋯ , d ― n , j t k } , where d ― n , j t k is the data mean value of the n -th sensor in the preceding data set. The j -th data in the subsequent dataset window with missing values is taken as D ― ― W m d , j t k = { d ― ― 1 , j t k , d ― ― 2 , j t k , ⋯ ⋯ , d ― ― n , j t k } , where d ― ― n , j t k denotes the data mean value of the n -th sensor in the subsequent data set. Equation (17) is then applied to fill the missing data set: d i t k = α d ― i t k + ( 1 − α ) d ― ― i t k (17) Equation (17) adopts a linear combination method, which comprehensively considers the correlation between the preceding and subsequent data and the missing data to perform linear filling on the missing data. In this equation, α denotes the reference value for linear combination with a value range of [ 0 , 1 ] . The value of α is set to 1 when the missing bridge data are collected at the initial operation stage of the bridge (on the assumption that there is no structural deterioration in the initial stage), and the values at other sampling time are calculated in accordance with Equation (18): α = S ( θ ) 9 5 (18) Equation (18) indicates that α decreases with increased operational time. For long-term missing data, its filled value is closer to the subsequent data, thus reflecting the most unfavorable state of bridge resilience control. 5. Simulation analysis 5.1 Compression based on knowledge In the simulation analysis, 50 cross-sectional dimensions were randomly selected as the validation set from the dataset of 3965 doubly symmetric I-shaped cross-sections (with flange thickness ranging from 700 mm to 1000 mm, web height ranging from 1200 mm to 1600 mm, and web thickness of 80 mm). Among the remaining cross-sections, 80% were used as the training set and the other 20% as the test set. A neural network model was then adopted for calculation, and the predicted compressive values and actual values of the 50 cross-sections outputted by the model are shown in Fig 1 ( I x ) and Fig 2 ( I y ) respectively. Fig 1. Comparison between predicted compressive values and actual values of 𝐈 x for doubly symmetric I-shaped cross-section. Open in a new tab Fig 2. Comparison between predicted compressive values and actual values of 𝐈 y for doubly symmetric I-shaped cross-section. Open in a new tab The moment of inertia of the cross-section about the x-axis is presented in Fig 1 , for which the maximum relative error of the predicted compressive values relative to the actual values is 7.03%, with a mean relative error of 2.42%. As shown in Fig 2 for the moment of inertia about the y-axis, the maximum and average relative errors are 4.54% and 1.28%, respectively. 5.2 Time-series data compression Taking a simply supported beam with a reinforced concrete T-shaped cross-section as an example, C50 concrete was adopted for the beam, with a calculated span of 15 m, a flange width of 800 mm, a flange thickness of 100 mm, a cross-section height of 1200 mm and a web thickness of 100 mm. 8% non-Gaussian noise (including traffic noise, wind noise and temperature noise) was added to the simulated acceleration data. The time-series data compression algorithm proposed in Section 4.2.2 was applied, and the corresponding compression results are presented in Fig 3 . Fig 3. Results of time-series data compression. Open in a new tab As can be seen from Fig 3 , the number of rows of the original data is 3600, and the number of rows of the data after compression is 262, with a compression ratio of 92.72%. The average data fidelity after compression is 97.77%, and the minimum data fidelity is 95.00%. To verify the advantages of the algorithm proposed in this paper compared with the existing algorithms, a comparative study was conducted between the proposed algorithm and the conventional algorithms (PCA, 1D Convolutional Auto-Encoder, Wavelet Transform, SAX and PAA) in the simulation analysis. Under the condition of 95% accuracy, the compression ratios of various algorithms are presented in Fig 4 . Fig 4. Compression ratios of various algorithms (95% accuracy). Open in a new tab As can be seen from Fig 4 , the compression ratio of the proposed algorithm in this paper is the highest under the premise of the same accuracy. Meanwhile, the compression ratios of the PAA and SAX algorithms are close to those of the time-series data compression algorithm proposed in this paper. However, PAA and SAX have inherent defects when applied to the field of bridge resilience control. Specifically, the PAA algorithm divides time-series data into fixed segments of equal length and uses the mean value of each segment to represent the characteristics of the entire segment. If the peak value of bridge acceleration falls exactly on the segment boundary, this peak value will be averaged with other data in the segment, resulting in the loss of key signals of structural anomalies. The SAX algorithm adds a process of symbol mapping on the basis of the PAA algorithm. The SAX algorithm not only inherits the defects of the PAA algorithm, but also has some new drawbacks. For example, the SAX algorithm divides the symbol boundaries through the quantiles of the normal distribution, and the boundaries are fixed. In addition, the SAX algorithm only symbolizes the PAA values of a single segment without considering the temporal correlation between segments. Similarly, PCA, Auto-Encoder and Wavelets do not incorporate the characteristics of bridge structures, which may lead to the loss of key structural information and render the dimensionality reduction results devoid of engineering significance. 5.3 Sparse data filling and compression The same case as that of time-series data compression was adopted for sparse data compression. In this study, it is assumed that the modal displacement data of Node 5 are missing in the range of 10% to 70%. The data filling method proposed in Section 4.3 was applied, and the errors after filling are presented in Table 1 . In the simulation analysis, the operational time of the bridge is set as 10 years, and the window size is taken as 90 according to equation (15). Table 1. Error statistics of sparse data after filling. Data Missing Ratio(%) Med AE Mean MSE 10% 0.002786 0.006175 20% 0.002437 0.006804 30% 0.001909 0.006920 40% 0.002630 0.006688 50% 0.001832 0.006465 60% 0.002343 0.006961 70% 0.002350 0.006814 Open in a new tab As can be seen from Table 1 , the maximum MSE and mean MSE after data filling are both relatively small for different values of data missing ratio, which reflects that the results of data filling are consistent with the true values of the data. It should be noted that the error will be significantly large when abrupt changes occur in the data with the simultaneous absence of this segment of missing data. When the missing ratio of sparse data is 30%, and the window sizes are set as 90 (10 years of operational time), 80 (16 years of operational time), 70 (20 years of operational time), 60 (24 years of operational time) and 50 (26 years of operational time), the corresponding data compression ratios are presented in Table 2 . Table 2. Data compression ratios. Window Sizes Compression Ratio (%) 90 88.61 80 89.44 70 90.14 60 90.36 50 90.33 Open in a new tab As can be seen from Table 2 , within the range of window sizes from 50 to 90, the data compression ratio is close to 90%, and there is little variation in the compression ratio across different window sizes. This phenomenon indicates that the result of data padding is actually a weighted average of the preceding and following data. The maximum difference between the compression ratio after padding and that of the original data is 4.4%.. 6. Conclusion and outlook Data is the core of bridge resilience control. However, with the continuous development of bridge resilience control technologies, the generation of massive data has posed new challenges to data storage, transmission and processing, resulting in low efficiency of bridge resilience control. To address this problem, domain knowledge, time-series data characteristics and bridge deterioration models are integrated into the data compression algorithm in this study, which achieves a substantial simplification of the data required for bridge resilience control. The main research conclusions are as follows: First, domain knowledge is introduced into the general model, and a data compression algorithm based on domain knowledge is proposed. The results of simulation analysis show that the data compression ratio of this algorithm reaches 75%. Meanwhile, the compressed data has a clear physical meaning and can be directly applied to the resilience control of bridges. Second, a compression algorithm combining time-series data and the bridge deterioration model is proposed. This algorithm realizes the refinement processing of dynamic time-series data, with the maximum refined compression ratio of the data reaching more than 92%. The results of comparative analysis with existing algorithms show that when the data fidelity rate is the same, the compression ratio of the algorithm proposed in this paper is higher, and the physical information of bridge structures can be retained effectively. Third, a sparse data completion method based on the data sets before and after the measuring points is proposed. Meanwhile, the above-mentioned refined compression algorithm for time-series data is applied to compress the completed data, with the maximum data compression ratio after processing exceeding 90%. The data compression algorithms proposed in this paper integrate the domain knowledge of bridge resilience control with the inherent time-series characteristics of data, which significantly reduces the volume of data required for bridge resilience control. Nevertheless, several issues in this study remain to be further explored and discussed: First, the effectiveness of the algorithms is verified by simulated data in this study, and their actual performance will be validated in subsequent tests on real bridges. In particular, there are still differences between the simulated noise in the study and the actual noise of real bridges. Meanwhile, noise reduction algorithms will also be a key focus of future research. Second, in the data compression based on domain knowledge, a biaxially symmetrical I-shaped section is adopted for analysis in this study. In follow-up research, analysis and comparison should be conducted for other types of cross-sections. Third, the simply supported beam bridge is taken as an example to study the data compression algorithms in this research. Subsequent studies should carry out relevant analysis for other bridge types, such as continuous beam bridges, arch bridges, cable-stayed bridges and suspension bridges. Fourth, the sparse data completion in this study only considers the data sets before and after a single measuring point. In the future, the research on sparse data completion for consecutive multiple measuring points will be carried out as a key focus. Nomenclature d i Data l i data label t i Data type v i data value r i the associated information of the data k i the knowledge information that constrains the data w i data weight D dataset k t i , k identifier for knowledge k i k r i , s k r i , s is the relationship between the value v i of data d i and the knowledge value k v i , v k v i , v the value of knowledge k i ⋈ the knowledge association between data r t i the correlation type r p i the correlation parameter m i , j the key of the correlation p i , j the value of the correlation r t t the time of data acquisition y i the output of the neural network f ( ζ i ) the activation function ω j i the connection weight between the j th input neuron and the i -th output neuron x j i Input data of neurons e ( ω ) calculation error h i actual value η j i learning factor T data template D c data loop A displacement mode a i the displacement mode value analyzed based on the i -th sensor n the number of sensors g k , i + z the displacement mode value at time t z W window size θ the operational time of bridges S ( θ ) the bridge technical condition in the θ -th year φ i − 1 the displacement mode at measurement point i − 1 φ i the displacement mode at measurement point i φ i + 1 the displacement mode at measurement point i + 1 l the distance between two measuring points φ ― i the curvature mode at measurement point i G curvature mode diagram W m d compensation window size D t k missing data set D ― W m d , j t k The j -th data in the preceding dataset window with missing values D ― ― W m d , j t k The j -th data in the subsequent dataset window with missing values d i t k the filled data of the i -th sensor d ― n , j t k the data mean value of the n -th sensor in the preceding data set d ― ― n , j t k the data mean value of the n -th sensor in the subsequent data set α filling factor Open in a new tab Data Availability The runnable python code for bridge structural simulation and data compression is deposited in Zenodo (DOI: 10.5281/zenodo.18080198 ) under the MIT Open Source License. The code repository includes a detailed README document that describes all required dependencies (e.g., MATLAB R2023b, Python 3.9), installation steps and execution instructions to facilitate reproducibility. Funding Statement The author(s) received no specific funding for this work. References 1. Bernardini L, Bono FM, Collina A. Drive-by damage detection based on the use of CWT and sparse autoencoder applied to steel truss railway bridge. Adv Mech Eng. 2025;17(5):1–24. doi: 10.1177/16878132251339857 [ DOI ] [ Google Scholar ] 2. Singh P, Bana D, Sadhu A. Improved bridge modal identification from vibration measurements using a hybrid empirical Fourier decomposition. J Sound Vib. 2024;590:118598. doi: 10.1016/j.jsv.2024.118598 [ DOI ] [ Google Scholar ] 3. Burrello A, Marchioni A, Brunelli D. Embedding principal component analysis for data reduction in structural health monitoring on Low-cost IoT gateways. ACM. 2019. doi: 10.1145/3310273.3322822 [ DOI ] [ Google Scholar ] 4. He D, Wang B, Gao X. An adaptive filtering method for bridge vibration signals based on improved CEEMDAN and multi-scale permutation entropy. EESRJ. 2021;8(4). doi: 10.18280/eesrj.080404 [ DOI ] [ Google Scholar ] 5. Zhou L, Lai P, Zhao W, Yang Y, Shi A, Li X, et al. A noise reduction method for GB-RAR bridge monitoring data based on CEEMD-WTD and PCA. Symmetry. 2025;17(4):588. doi: 10.3390/sym17040588 [ DOI ] [ Google Scholar ] 6. Zhang F-y, Yang D, Gong X-y, Zou J, Lan L. A wavelet-based data compression algorithm for bridge vibration. 2012 IEEE 14th International Conference on Communication Technology; 2012. p. 334–41. doi: 10.1109/icct.2012.6511239 [ DOI ] [ Google Scholar ] 7. Kullaa J. Damage detection and localization under variable environmental conditions using compressed and reconstructed bayesian virtual sensor data. Sensors (Basel). 2021;22(1):306. doi: 10.3390/s22010306 [ DOI ] [ PMC free article ] [ PubMed ] [ Google Scholar ] 8. Chencho, Li J, Hao H, Li L. Structural damage classification of large-scale bridges using convolutional neural networks and time domain responses. J Perform Constr Facil. 2024;38(4):20242216181569. doi: 10.1061/jpcfev.cfeng-4676 [ DOI ] [ Google Scholar ] 9. Guo A, Jiang A, Lin J, Li X. Data mining algorithms for bridge health monitoring: Kohonen clustering and LSTM prediction approaches. J Supercomput. 2019;76(2):932–47. doi: 10.1007/s11227-019-03045-8 [ DOI ] [ Google Scholar ] 10. Li Z, Li D, Sun T. A transformer-based bridge structural response prediction framework. Sensors (Basel). 2022;22(8):3100. doi: 10.3390/s22083100 [ DOI ] [ PMC free article ] [ PubMed ] [ Google Scholar ] 11. Datta Rachuri R, Liao D, Sarikonda S, Kondur DV. A multimodal fusion framework for bridge defect detection with cross-verification. 2024 IEEE International Conference on Big Data (BigData); Washington, DC, USA; 2024. p. 3292–300. doi: 10.1109/BigData62323.2024.10825867 [ DOI ] [ Google Scholar ] 12. Gadiraju DS, Azam SE, Khazanchi D. SHM-traffic: DRL and transfer learning based UAV control for structural health monitoring of bridges with traffic. arXiv2402.14757. 2024. https://arxiv.org/abs/2402.14757 13. Hwang S-H, Kim K-M, Kim S, Kwak JW. Lossless data compression for time-series sensor data based on dynamic bit packing. Sensors (Basel). 2023;23(20):8575. doi: 10.3390/s23208575 [ DOI ] [ PMC free article ] [ PubMed ] [ Google Scholar ] 14. Pham-Hong Q, Tran Hung V, Nguyen CT, Bui PL, Mai-Duc A. Damage detection in steel truss bridges using 1D-CNN-BiGRU network with time-series data. Eng Comput. 2025;12:1–21. doi: 10.1108/EC-02-2025-0181 [ DOI ] [ Google Scholar ] 15. Xiao L, Lu X, Huang T, Lv Y, Peng M, Miao C, et al. Hybrid SSA-LSTM based mechanical property degradation prediction for corroded steel wires of long-span cable supported bridges. Case Stud Constr Mater. 2025;23:e05488. doi: 10.1016/j.cscm.2025.e05488 [ DOI ] [ Google Scholar ] 16. Wang Z, Liu H, Han Y, Jiang L. A hybrid GWO-VMD-LSTM surrogate model for vehicle-track-bridge response prediction under near-fault earthquakes. Int J Str Stab Dyn. 2025:10:2750090. doi: 10.1142/s0219455427500908 [ DOI ] [ Google Scholar ] 17. Perez A, Rezaeiravesh S, Ju Y, Laure E, Markidis S, Schlatter P. Compression of turbulence time series data using Gaussian process regression. Comput Phys Commun. 2026;319:109914. doi: 10.1016/j.cpc.2025.109914 [ DOI ] [ Google Scholar ] 18. Wang W, Liu L, Zhang K, Yang K, Kuang L, Zheng Z, et al. NPAC: numeric pattern aware compression algorithm for floating-point time-series data. World Wide Web. 2025;28(6). doi: 10.1007/s11280-025-01382-8 [ DOI ] [ Google Scholar ] 19. Pöppelbaum J, Schwung A. Time series compression using quaternion valued neural networks and quaternion backpropagation. Neural Netw. 2025;188:107465. doi: 10.1016/j.neunet.2025.107465 [ DOI ] [ PubMed ] [ Google Scholar ] 20. Miao Z, Li W e i z e, Pan X. Multivariate time series collaborative compression for monitoring systems in securing cloud-based digital twin. J Cloud Comput: Adv Syst Appl. 2024;13:16. doi: 10.1186/s13677-023-00579-4 [ DOI ] [ Google Scholar ] 21. Tianzhi H, Zhigang M, Longyu W. Research and application of nonlinear deterioration model based on bridge technical condition. West China Commun Sci Technol. 2018;6:92–5. doi: 10.13282/j.cnki.wccst.2018.06.025 [ DOI ] [ Google Scholar ] 22. Longji Z, Zhi Y, Jiaqing L, Wenhua L, Jingchun M. Spatiotemporal dependency data imputation for long-term health monitoring of concrete arch bridges. Sci Rep. 2025;15(1):36218. doi: 10.1038/s41598-025-20126-2 [ DOI ] [ PMC free article ] [ PubMed ] [ Google Scholar ] 23. Entezami A, Sarmadi H, Behkamal B. Long-term health monitoring of concrete and steel bridges under large and missing data by unsupervised meta learning. Eng Struct. 2023;279:115616. doi: 10.1016/j.engstruct.2023.115616 [ DOI ] [ Google Scholar ] 24. Xin J, Mo X, Jiang Y, Tang Q, Zhang H, Zhou J. Recovery method of continuous missing data in the bridge monitoring system using SVMD‐assisted TCN–MHA–BiGRU. Struct Control Health Monit. 2025;2025(1):8833186. doi: 10.1155/stc/8833186 [ DOI ] [ Google Scholar ] PLoS One. doi: 10.1371/journal.pone.0346272.r001 Decision Letter 0 Babak Aslani Babak Aslani Academic Editor Find articles by Babak Aslani Author information Copyright and License information Roles Babak Aslani : Academic Editor © 2026 Babak AslaniBabak AslaniBabak AslaniBabak Aslani This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. PMC Copyright notice 24 Nov 2025 Dear Dr. Chen, Improve the literature review and make it more focused Ensure that all mathematical equations are correctly defined and are clear to readers Provide a detailed comparison with the state-of-the-art algorithms in the literature to provide validation Please add a sensitivity analysis section to demonstrate the robustness Provide a table to list every symbol/parameter in your work Closely follow the suggestions provided by reviewers to improve the revised version [email protected] . When you're ready to submit your revision, log on to https://www.editorialmanager.com/pone/ and select the 'Submissions Needing Revision' folder to locate your manuscript file.. When you're ready to submit your revision, log on to https://www.editorialmanager.com/pone/ and select the 'Submissions Needing Revision' folder to locate your manuscript file.. When you're ready to submit your revision, log on to https://www.editorialmanager.com/pone/ and select the 'Submissions Needing Revision' folder to locate your manuscript file.. When you're ready to submit your revision, log on to https://www.editorialmanager.com/pone/ and select the 'Submissions Needing Revision' folder to locate your manuscript file. A rebuttal letter that responds to each point raised by the academic editor and reviewer(s). You should upload this letter as a separate file labeled 'Response to Reviewers'. A marked-up copy of your manuscript that highlights changes made to the original version. You should upload this as a separate file labeled 'Revised Manuscript with Track Changes'. An unmarked version of your revised paper without tracked changes. You should upload this as a separate file labeled 'Manuscript'. If you would like to make changes to your financial disclosure, please include your updated statement in your cover letter. Guidelines for resubmitting your figure files are available below the reviewer comments at the end of this letter. If applicable, we recommend that you deposit your laboratory protocols in protocols.io to enhance the reproducibility of your results. Protocols.io assigns your protocol its own identifier (DOI) so that it can be cited independently in the future. For instructions see: https://journals.plos.org/plosone/s/submission-guidelines#loc-laboratory-protocols . Additionally, PLOS ONE offers an option for publishing peer-reviewed Lab Protocol articles, which describe protocols hosted on protocols.io. Read more information on sharing protocols at . Additionally, PLOS ONE offers an option for publishing peer-reviewed Lab Protocol articles, which describe protocols hosted on protocols.io. Read more information on sharing protocols at . Additionally, PLOS ONE offers an option for publishing peer-reviewed Lab Protocol articles, which describe protocols hosted on protocols.io. Read more information on sharing protocols at . Additionally, PLOS ONE offers an option for publishing peer-reviewed Lab Protocol articles, which describe protocols hosted on protocols.io. Read more information on sharing protocols at https://plos.org/protocols?utm_medium=editorial-email&utm_source=authorletters&utm_campaign=protocols .... We look forward to receiving your revised manuscript. Kind regards, Babak Aslani, Ph.D. Academic Editor PLOS ONE Journal Requirements: When submitting your revision, we need you to address these additional requirements. 1. Please ensure that your manuscript meets PLOS ONE's style requirements, including those for file naming. The PLOS ONE style templates can be found at https://journals.plos.org/plosone/s/file?id=wjVg/PLOSOne_formatting_sample_main_body.pdf and https://journals.plos.org/plosone/s/file?id=ba62/PLOSOne_formatting_sample_title_authors_affiliations.pdf .... 2. Please note that PLOS One has specific guidelines on code sharing for submissions in which author-generated code underpins the findings in the manuscript. In these cases, we expect all author-generated code to be made available without restrictions upon publication of the work. Please review our guidelines at https://journals.plos.org/plosone/s/materials-and-software-sharing#loc-sharing-code and ensure that your code is shared in a way that follows best practice and facilitates reproducibility and reuse. 3. We note that you have indicated that there are restrictions to data sharing for this study. PLOS only allows data to be available upon request if there are legal or ethical restrictions on sharing data publicly. For more information on unacceptable data access restrictions, please see http://journals.plos.org/plosone/s/data-availability#loc-unacceptable-data-access-restrictions . Before we proceed with your manuscript, please address the following prompts: a) If there are ethical or legal restrictions on sharing a de-identified data set, please explain them in detail (e.g., data contain potentially identifying or sensitive patient information, data are owned by a third-party organization, etc.) and who has imposed them (e.g., a Research Ethics Committee or Institutional Review Board, etc.). Please also provide contact information for a data access committee, ethics committee, or other institutional body to which data requests may be sent. b) If there are no restrictions, please upload the minimal anonymized data set necessary to replicate your study findings to a stable, public repository and provide us with the relevant URLs, DOIs, or accession numbers. For a list of recommended repositories, please see https://journals.plos.org/plosone/s/recommended-repositories . You also have the option of uploading the data as Supporting Information files, but we would recommend depositing data directly to a data repository if possible. We will update your Data Availability statement on your behalf to reflect the information you provide. 4. In the online submission form you indicate that your data is not available for proprietary reasons and have provided a contact point for accessing this data. Please note that your current contact point is a co-author on this manuscript. According to our Data Policy, the contact point must not be an author on the manuscript and must be an institutional contact, ideally not an individual. Please revise your data statement to a non-author institutional point of contact, such as a data access or ethics committee, and send this to us via return email. Please also include contact information for the third party organization, and please include the full citation of where the data can be found. 5. If the reviewer comments include a recommendation to cite specific previously published works, please review and evaluate these publications to determine whether they are relevant and should be cited. There is no requirement to cite these works unless the editor has indicated otherwise. [Note: HTML markup is below. Please do not edit.] Reviewers' comments: Reviewer's Responses to Questions Comments to the Author 1. Is the manuscript technically sound, and do the data support the conclusions? Reviewer #1: Yes Reviewer #2: Partly Reviewer #3: Yes ********** 2. Has the statistical analysis been performed appropriately and rigorously? -->?> Reviewer #1: Yes Reviewer #2: Yes Reviewer #3: Yes ********** 3. Have the authors made all data underlying the findings in their manuscript fully available??> The PLOS Data policy requires authors to make all data underlying the findings described in their manuscript fully available without restriction, with rare exception (please refer to the Data Availability Statement in the manuscript PDF file). The data should be provided as part of the manuscript or its supporting information, or deposited to a public repository. For example, in addition to summary statistics, the data points behind means, medians and variance measures should be available. If there are restrictions on publicly sharing data—e.g. participant privacy or use of data from a third party—those must be specified.requires authors to make all data underlying the findings described in their manuscript fully available without restriction, with rare exception (please refer to the Data Availability Statement in the manuscript PDF file). The data should be provided as part of the manuscript or its supporting information, or deposited to a public repository. For example, in addition to summary statistics, the data points behind means, medians and variance measures should be available. If there are restrictions on publicly sharing data—e.g. participant privacy or use of data from a third party—those must be specified.--> Reviewer #1: Yes Reviewer #2: Yes Reviewer #3: Yes ********** 4. Is the manuscript presented in an intelligible fashion and written in standard English??> Reviewer #1: Yes Reviewer #2: No Reviewer #3: Yes ********** Reviewer #1: Overall Assessment This paper addresses a highly relevant problem in bridge monitoring—the refinement of massive datasets for efficient use in large-scale models for resilience control. The motivation is clear and well-justified: as bridge monitoring systems become more sophisticated and generate increasingly large volumes of data, the need for intelligent data reduction strategies becomes critical. The authors demonstrate solid understanding of both structural engineering principles and computational methods, and their effort to integrate domain knowledge from bridge engineering into data processing algorithms represents a valuable research direction. The mathematical formalization of the problem shows rigor and careful thinking about how to represent bridge data systematically. The three-pronged approach—knowledge-based refinement, time-domain refinement, and sparse data handling—is comprehensive and addresses different aspects of the data management challenge. The simulation results, while preliminary, show promising refinement rates for time-domain data, which could have significant practical implications if validated. Critical Issues Requiring Immediate Attention 1. Literature Review (Section 1.2) The literature review is too broad and unfocused. Many references (e.g., [8] rumor detection, [12] text-to-image generation, [14] art generation) are tangentially related at best. Reduce this section and focus exclusively on: (a) data processing in structural health monitoring, (b) machine learning in bridge engineering, and (c) time-series compression methods. Clearly identify the research gap your work fills. 2. Lack of Validation and Comparison This is the most serious deficiency. The paper presents NO comparisons with existing methods (PCA, autoencoders, wavelets, SAX, PAA) and uses ONLY synthetic data. 3. Methodological Clarity Several methodological elements need clarification: • Equation (10): The notation d(1-e^ξ/(1+e^ξ))/d(ξ) is ambiguous. Write it clearly as a derivative. • Algorithm on page 13: "Apply a large-scale model to solve the data loop Dc…" is too vague. Specify the model architecture, training procedure, and loss function. • Parameters like ε=0.05 and window size W need justification through sensitivity analysis. 4. Reproducibility The statement "available upon reasonable request" is unacceptable for computational work in 2025. Create a public GitHub repository or archive it on Zenodo for a permanent DOI. 5. Results and Analysis Current results are insufficient: • Figure 1: Only 5 I-beam sections—need at least 50 varied cases • Section 4.2: Only one simple T-beam. Test on continuous spans, cable-stayed, and arch bridges • 5% Gaussian noise is unrealistic. Real bridges experience non-Gaussian noise from traffic, wind, and thermal effects • No analysis of whether 97% compression preserves damage detection capability 6. Terminology Issues The term "large-scale model" is used inconsistently throughout the manuscript, creating confusion about what type of computational approach is actually being employed. It is often unclear whether you are referring to Large Language Models such as GPT-like systems, deep learning models in general, or simply large neural networks with many parameters. This ambiguity is problematic because these are fundamentally different types of models with different architectures, training paradigms, and appropriate applications. To resolve this issue, you should use standard terminology from the machine learning and structural engineering literature. Specifically, use "deep learning models" when referring to multilayer neural networks, "neural networks" or "feedforward networks" for simpler architectures, and "convolutional networks" or "recurrent networks" when those specific architectures are employed. The term "large language models" or "LLMs" should be reserved exclusively for those instances where you are using transformer-based language models like GPT, BERT, or similar architectures, which appears to occur primarily in your graph classification step. This terminological precision will make your methodology clearer to readers and align your work with standard conventions in both the civil engineering and machine learning communities. Essential Additions The manuscript requires several critical additions to meet publication standards. First, you must add a comprehensive section titled "Comparison with State-of-the-Art" that includes a detailed table comparing your method against established techniques. This comparison table should include key metrics as well. A second essential addition is a "Sensitivity Analysis" section that demonstrates the robustness of your proposed method across various conditions. This analysis should systematically vary noise levels different thresholds to show how the algorithm performs under different data quality scenarios. Additionally, you should test the method with missing data percentages ranging from 10% to 70% to establish the limits of your sparse data refinement approach. The sensitivity analysis must also include different bridge types. Finally, explore how variations in window size W and threshold ε affect the refinement rate and accuracy to guide future users in parameter selection. Third, you must add a "Limitations" section that honestly discusses the constraints and assumptions of your method. This should explicitly acknowledge that the method assumes stationary Gaussian noise and regular sensor grids, which may not hold in all real-world scenarios. You must also acknowledge that validation has been limited to synthetic data and that the method's performance for subtle damage detection in early stages of deterioration remains unknown. The abstract and contributions sections also require substantial improvement. The abstract should begin by clearly establishing the problem, such as "Bridge monitoring generates massive datasets that challenge current data management and analysis capabilities," before introducing your solution. You must clearly state what is genuinely novel rather than simply stating that you "propose" something. The percentages of 80% and 97% refinement rates need proper context explaining what these numbers mean for practical bridge management. Finally, you must distinguish clearly between your novel contributions, such as the specific application to bridges and the integration of deterioration models into the refinement algorithm, and your adaptations of existing techniques like windowing and interpolation methods. Language and Presentation The manuscript requires professional English editing to meet publication standards. Throughout the text, there are numerous instances of awkward phrasing that suggest direct translation from another language. For example, phrases like "with the increase of bridge operation time" should be simplified to "with increased operational time," and expressions such as "cannot be simply integrated" would read more naturally as "cannot be directly unified." Beyond these specific examples, the manuscript suffers from inconsistent mathematical notation, with variables sometimes written as d_i and other times as d_{i,j} without clear explanation of when each form is appropriate, and approximation symbols alternating between ≈ and ≃ apparently interchangeably. These inconsistencies, while seemingly minor, can confuse readers and detract from the technical content. Reviewer #2: This work examines data preprocessing for bridge-resilience control supported by large models. As bridge-resilience control technology advances, the sheer volume of data has begun to undermine control efficiency. To address this issue, the author proposed a preprocessing method that incorporates domain knowledge and time-domain features, and demonstrated its use in simulation analyses. The problem tackled is worthwhile; however, the manuscript does not yet demonstrate sufficient scientific rigor or value and would require major revision before it could be considered for publication. The specific modification suggestions are as follows: 1. Please restructure the Introduction according to the standard logic of the research paper; the current logic does not make the theoretical or technical contribution clear. 2. Move the literature review currently in Section 1.2 to a new '2. Related Work' section. 3. There are a large number of inaccurate paragraph divisions in the manuscript. For example, “Correlation refers to the correlation between data. The correlations studied in this article include geometric correlations and temporal correlations. Geometric correlation refers to the geometric shapes or structures composed of data within the subset D_k of a dataset, D_k\subset D. When D_k==D , D_k constitutes the entire bridge structure. Time domain correlation refers to the correlation generated in the time domain of a certain data of a bridge structure over time. For example, the acceleration data and displacement data collected by the bridge health monitoring system all satisfy time-domain correlation.” should be a single paragraph. Please correct all such paragraph divisions throughout the manuscript. 4. Provide a nomenclature table that lists every symbol/parameter used in the paper. 5. All algorithm processes are currently presented in a non-standard format: they lack numbering, explicit Input/Output blocks, etc. In addition to presenting the algorithms in the standard way, it is recommended to use more descriptive language for the algorithm processes. For example, using '→' directly in an algorithm without explanation can confuse readers (in mathematical expression, '→' can mean 'tends to'; in pseudocode, it is often understood as 'assignment'). 6. Supply pseudocode for every algorithm, either in the main text or in an appendix. 7. Step 7 of the time domain data refinement algorithm states 'Call the large-scale model to classify G and generate a classification quantity k'. What the large-scale model is used in this step? What is the specific classification algorithm? How are the specific parameters set? If these issues are not clearly stated in the manuscript, the scientificity and accuracy of the subsequent analysis results cannot be guaranteed. 8. The claim 'The resilience-control data of bridges is affected by factors such as the number of equipment and equipment failures' is unconvincing as an explanation for data sparsity. Commercial sensing systems are designed to fail rarely; therefore, device failure alone cannot justify the observed scarcity. Provide stronger evidence or cite published studies that substantiate this argument. 9. Justify the choice of \varepsilon=0.05 in Equation (18). 10. Compare the proposed refinement algorithms with state-of-the-art alternatives to demonstrate their superiority. Reviewer #3: Comments to Author(s) Article Title: The title is very ok and it flows along just that it is too long the author should find away to refine it abit. Abstract The abstract is good to go; everything is stated correctly, from its introduction to the problem, methodology, and result output was mentioned as related to its simulation analysis but it does not mention its performance explicitly rather it proceeded to the future research. It is also advisable to use a grammar editor or an expert in grammar or language to assist in correcting grammatical and punctuation errors. LITERATURE REVIEW: The review is done, properly referenced, concurrence is important as it is supposed to flow along and tailored to the current research which means that the closest research need to be considered. - PERFOMANCE METRICS o Algorithms are well and properly stated, The system model and the transformation of time domain data is well articulated. METHODOLOGY: - This is properly presented, there are a lot of information mentioned in the methods and strategy which has been explicitly described. - Kindly re-arrange the Methodology for simplicity and easy tracking so that It can be simpler to relate the methods, results and output. RESULT - The result is well presented inclusive of all necessary graph. - The concluding part is too scanty compare to too many equations and solutions provided, I will suggest it should be a more explicit way of concluding - Supporting information is not necessary, but it can also be integrated into the conclusion in a summarized manner. CONCLUSION: This paper is good as it stated the key aspect of the research and it widen the scope as it continue to state explicitly the research motivation, and it is very important in the core area of Algorithm and Case Analysis so it requires a lot of attention while dissemination them. ********** what does this mean? ). If published, this will include your full peer review and any attached files.). If published, this will include your full peer review and any attached files.). If published, this will include your full peer review and any attached files.). If published, this will include your full peer review and any attached files. If you choose “no”, your identity will remain anonymous but your review may still be made public. Do you want your identity to be public for this peer review? For information about this choice, including consent withdrawal, please see our For information about this choice, including consent withdrawal, please see our For information about this choice, including consent withdrawal, please see our For information about this choice, including consent withdrawal, please see our Privacy Policy ..--> Reviewer #1: No Reviewer #2: No Reviewer #3: No ********** [NOTE: If reviewer comments were submitted as an attachment file, they will be attached to this email and accessible via the submission site. Please log into your account, locate the manuscript record, and check for the action link "View Attachments". If this link does not appear, there are no attachment files.] To ensure your figures meet our technical requirements, please review our figure guidelines: https://journals.plos.org/plosone/s/figures You may also use PLOS’s free figure tool, NAAS, to help you prepare publication quality figures: https://journals.plos.org/plosone/s/figures#loc-tools-for-figure-preparation . NAAS will assess whether your figures meet our technical requirements by comparing each figure against our figure specifications. PLoS One. 2026 Apr 15;21(4):e0346272. doi: 10.1371/journal.pone.0346272.r002 Author response to Decision Letter 1 Article notes Copyright and License information Collection date 2026. PMC Copyright notice 30 Dec 2025 Dear Dr Babak Aslani and Reviewers, Thank you very much for taking the time to review my manuscript entitled " Data Refinement Processing of Bridge Resilience Control Supported by Large-scale model Algorithm and Case Analysis". I greatly appreciate the constructive feedback and insightful comments, which have significantly helped me improve the quality of my work. Below, I provide a point-by-point response to the reviewers' comments. Below, I provide a detailed response to each comment. Reviewer 1 Comment 1: Literature Review (Section 1.2) The literature review is too broad and unfocused. Many references (e.g., [8] rumor detection, [12] text-to-image generation, [14] art generation) are tangentially related at best. Reduce this section and focus exclusively on: (a) data processing in structural health monitoring, (b) machine learning in bridge engineering, and (c) time-series compression methods. Clearly identify the research gap your work fills. Response 1: According to the reviewer's comments, the Literature Review has been revised by reorganizing the references based on (a) data processing in structural health monitoring, (b) machine learning in bridge engineering, and (c) time series compression methods. Comment 2: Lack of Validation and Comparison This is the most serious deficiency. The paper presents NO comparisons with existing methods (PCA, autoencoders, wavelets, SAX, PAA) and uses ONLY synthetic data. Response 2: Following the comments from the reviewers, the proposed time-series data compression algorithm is compared with mainstream dimensionality reduction and compression algorithms, including PCA, Auto-Encoders, Wavelet Transform, SAX and PAA. Specifically, the 1D Convolutional Auto-Encoder was employed as the Auto-Encoder method in the comparison. The corresponding comparison results are presented in Fig. 4 of the manuscript. Comment 3:Methodological Clarity Several methodological elements need clarification: 3.1 Equation (10): The notation d(1-e^ξ/(1+e^ξ))/d(ξ) is ambiguous. Write it clearly as a derivative. Algorithm on page 13: "Apply a large-scale model to solve the data loop Dc…" is too vague. Specify the model architecture, training procedure, and loss function. Parameters like ε=0.05 and window size W need justification through sensitivity analysis. Response 3: In accordance with the reviewers' comments, Eq. (10) is revised into the following form. Meanwhile, in Eq. (11), d_j→w_j is modified to d_j (w_j). η_ji=-0.2×d/dξ ((1-e^ξ)/(1+e^ξ )) (10) 〖ξ=1-(d〗_j (w_j)) (11) In the meantime, Equation (9) has been modified to the following form to adopt the differential learning rate. ω_ji=ω_ji-η_ji x_ji (y_i-d_i) (9) In accordance with the reviewers' comments, we have specified which large-scale model to invoke, and revised the expression "Apply a large-scale model to solve the data loop Dc…" to "Apply the neural network model to solve the data loop Dc…". Meanwhile, a brief introduction to the architecture, training procedure, and loss function of the neural network model is added. In accordance with the reviewers' guidance, the window size is set in a dynamic manner, and the detailed revisions can be found in Section 4.2.1 of the manuscript. In addition, ε has been removed in the revised manuscript, and the value of α is determined according to Eq. (18) in the revised manuscript. Comment 4:Reproducibility The statement "available upon reasonable request" is unacceptable for computational work in 2025. Create a public GitHub repository or archive it on Zenodo for a permanent DOI. Response4: In accordance with the reviewers' comments, the dataset and source code have been made publicly available. Comment 5:Results and Analysis Current results are insufficient: Figure 1: Only 5 I-beam sections—need at least 50 varied cases Section 4.2: Only one simple T-beam. Test on continuous spans, cable-stayed, and arch bridges 5% Gaussian noise is unrealistic. Real bridges experience non-Gaussian noise from traffic, wind, and thermal effects。 No analysis of whether 97% compression preserves damage detection capability Response 5: In accordance with the reviewers' comments, fifty cross-sections are presented in Fig. 1. The reviewers suggested conducting tests on different bridge types including continuous span bridges, cable-stayed bridges and arch bridges. We are currently conducting relevant research, and this work will be completed in our subsequent papers. In accordance with the reviewers' comments, the noise has been modified to 8% non-Gaussian noise (including vehicle noise, wind noise and temperature noise) in the revised manuscript. In addition, due to the introduction of noise, the compression ratio of the time series data compression algorithm proposed in the revised manuscript is 89.42%. We will analyze the influence of the compressed data on bridge damage detection in subsequent research. Comment 6: Terminology Issues The term "large-scale model" is used inconsistently throughout the manuscript, creating confusion about what type of computational approach is actually being employed. It is often unclear whether you are referring to Large Language Models such as GPT-like systems, deep learning models in general, or simply large neural networks with many parameters. This ambiguity is problematic because these are fundamentally different types of models with different architectures, training paradigms, and appropriate applications. To resolve this issue, you should use standard terminology from the machine learning and structural engineering literature. Specifically, use "deep learning models" when referring to multilayer neural networks, "neural networks" or "feedforward networks" for simpler architectures, and "convolutional networks" or "recurrent networks" when those specific architectures are employed. The term "large language models" or "LLMs" should be reserved exclusively for those instances where you are using transformer-based language models like GPT, BERT, or similar architectures, which appears to occur primarily in your graph classification step. This terminological precision will make your methodology clearer to readers and align your work with standard conventions in both the civil engineering and machine learning communities. Essential Additions The manuscript requires several critical additions to meet publication standards. First, you must add a comprehensive section titled "Comparison with State-of-the-Art" that includes a detailed table comparing your method against established techniques. This comparison table should include key metrics as well. A second essential addition is a "Sensitivity Analysis" section that demonstrates the robustness of your proposed method across various conditions. This analysis should systematically vary noise levels different thresholds to show how the algorithm performs under different data quality scenarios. Additionally, you should test the method with missing data percentages ranging from 10% to 70% to establish the limits of your sparse data refinement approach. The sensitivity analysis must also include different bridge types. Finally, explore how variations in window size W and threshold ε affect the refinement rate and accuracy to guide future users in parameter selection. Third, you must add a "Limitations" section that honestly discusses the constraints and assumptions of your method. This should explicitly acknowledge that the method assumes stationary Gaussian noise and regular sensor grids, which may not hold in all real-world scenarios. You must also acknowledge that validation has been limited to synthetic data and that the method's performance for subtle damage detection in early stages of deterioration remains unknown. The abstract and contributions sections also require substantial improvement. The abstract should begin by clearly establishing the problem, such as "Bridge monitoring generates massive datasets that challenge current data management and analysis capabilities," before introducing your solution. You must clearly state what is genuinely novel rather than simply stating that you "propose" something. The percentages of 80% and 97% refinement rates need proper context explaining what these numbers mean for practical bridge management. Finally, you must distinguish clearly between your novel contributions, such as the specific application to bridges and the integration of deterioration models into the refinement algorithm, and your adaptations of existing techniques like windowing and interpolation methods. Language and Presentation The manuscript requires professional English editing to meet publication standards. Throughout the text, there are numerous instances of awkward phrasing that suggest direct translation from another language. For example, phrases like "with the increase of bridge operation time" should be simplified to "with increased operational time," and expressions such as "cannot be simply integrated" would read more naturally as "cannot be directly unified." Beyond these specific examples, the manuscript suffers from inconsistent mathematical notation, with variables sometimes written as d_i and other times as d_{i,j} without clear explanation of when each form is appropriate, and approximation symbols alternating between ≈ and ≃ apparently interchangeably. These inconsistencies, while seemingly minor, can confuse readers and detract from the technical content. Response 6: In accordance with the reviewers' comments, the term "large model" has been revised to "neural network model" in the revised manuscript, so that readers can clearly understand the method adopted in this study. The comparison of compression ratios between the time-series data compression algorithm proposed in this paper and the existing algorithms has been supplemented in the revised manuscript. These comparisons are based on the premise that all algorithms adopt the same data fidelity rate (95%). For missing data compression, the results of data completion for data missing rates ranging from 10% to 70% have been supplemented (Table 1). Meanwhile, taking the 30% data missing rate as an example, the compression ratios corresponding to the initial values of different window sizes have been calculated (Table 2). In accordance with the reviewers' comments, the limitations of this study have been added to the Conclusions and Future Work section. In particular, it is stated explicitly that the verification is completed based on simulated data, and the actual performance of the proposed algorithms will be further validated in subsequent tests on real bridges. In accordance with the reviewers' comments, the application value of the compression ratio and data fidelity rate for bridge resilience control has been clearly specified in the abstract. The expressions and symbols in the manuscript have been revised in accordance with the reviewers' comments. Reviewer 2 Comment 1: Please restructure the Introduction according to the standard logic of the research paper; the current logic does not make the theoretical or technical contribution clear. Response 1: In accordance with the reviewers' comments, the introduction has been restructured, and the Motivation and Innovation section has been revised. Comment 2: Move the literature review currently in Section 1.2 to a new '2. Related Work' section. Response 2: In accordance with the reviewers' comments, Section 1.2 has been moved to Section 2 "Related Work". Comment 3: There are a large number of inaccurate paragraph divisions in the manuscript. For example, “Correlation refers to the correlation between data. The correlations studied in this article include geometric correlations and temporal correlations. Geometric correlation refers to the geometric shapes or structures composed of data within the subset D_k of a dataset, D_k\subset D. When D_k==D , D_k constitutes the entire bridge structure. Time domain correlation refers to the correlation generated in the time domain of a certain data of a bridge structure over time. For example, the acceleration data and displacement data collected by the bridge health monitoring system all satisfy time-domain correlation.” should be a single paragraph. Please correct all such paragraph divisions throughout the manuscript. Response 3: In accordance with the reviewers' comments, the paragraph division of the entire manuscript has been revised in the revised version. Comment 4: Provide a nomenclature table that lists every symbol/parameter used in the paper. Response 4: A nomenclature of all symbols has been added to Appendix A of the revised manuscript. Comment 5: All algorithm processes are currently presented in a non-standard format: they lack numbering, explicit Input/Output blocks, etc. In addition to presenting the algorithms in the standard way, it is recommended to use more descriptive language for the algorithm processes. For example, using '→' directly in an algorithm without explanation can confuse readers (in mathematical expression, '→' can mean 'tends to'; in pseudocode, it is often understood as 'assignment'). Response 5: In the revised manuscript, we have presented the original algorithm in the form of pseudocode to enable readers to understand it more clearly. Comment 6: Supply pseudocode for every algorithm, either in the main text or in an appendix. Response 6: In accordance with the reviewers' requirements, we have provided the pseudocode of the algorithm in the revised manuscript. Comment 7: Step 7 of the time domain data refinement algorithm states 'Call the large-scale model to classify G and generate a classification quantity k'. What the large-scale model is used in this step? What is the specific classification algorithm? How are the specific parameters set? If these issues are not clearly stated in the manuscript, the scientificity and accuracy of the subsequent analysis results cannot be guaranteed. Response 7: In Step 7,the DeepSeek-chat model is invoked to classify the graphs generated by the curvature mode. When the number of categories X=1, the data in this category is compressed by taking the mean value of the data within the category. When the number of categories X>1, half of the window size is used to perform reclassification. Meanwhile, the data fidelity rate is set to 95% in the program design. In the revised manuscript, the large model is specified as DeepSeek-chat. Comment 8: The claim 'The resilience-control data of bridges is affected by factors such as the number of equipment and equipment failures' is unconvincing as an explanation for data sparsity. Commercial sensing systems are designed to fail rarely; therefore, device failure alone cannot justify the observed scarcity. Provide stronger evidence or cite published studies that substantiate this argument. Response 8: In response to the reviewers' comments, we have cited references [24, 25, 26] in the revised manuscript to demonstrate that the sparse nature of the bridge resilience control data arises from factors such as the number of devices and device failures. Comment 9: Justify the choice of ε=0.05 in Equation (18). Response 9: In the revised manuscript, ε has been removed in the revised manuscript, and the value of α is determined according to Eq. (18) in the revised manuscript. Comment 10: Compare the proposed refinement algorithms with state-of-the-art alternatives to demonstrate their superiority. Response 10: Following the comments from the reviewers, the proposed time-series data compression algorithm is compared with mainstream dimensionality reduction and compression algorithms, including PCA, Auto-Encoders, Wavelet Transform, SAX and PAA. Specifically, the 1D Convolutional Auto-Encoder was employed as the Auto-Encoder method in the comparison. The corresponding comparison results are presented in Fig. 4 of the manuscript. Reviewer 3 Comment 1: Abstract The abstract is good to go; everything is stated correctly, from its introduction to the problem, methodology, and result output was mentioned as related to its simul Attachment Submitted filename: Rebuttal letter.pdf pone.0346272.s002.pdf (520KB, pdf) PLoS One. doi: 10.1371/journal.pone.0346272.r003 Decision Letter 1 Babak Aslani Babak Aslani Academic Editor Find articles by Babak Aslani Author information Copyright and License information Roles Babak Aslani : Academic Editor © 2026 Babak AslaniBabak AslaniBabak AslaniBabak Aslani This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. PMC Copyright notice 26 Jan 2026 Dear Dr. Chen, ===================================== Please closely read the reviewer feedback regarding using LLM for graph classification. I believe that this part of your work can be revised with a more solid choice. So, please make sure to address this critical point in the revised version. ===================================== [email protected] . When you're ready to submit your revision, log on to https://www.editorialmanager.com/pone/ and select the 'Submissions Needing Revision' folder to locate your manuscript file.. When you're ready to submit your revision, log on to https://www.editorialmanager.com/pone/ and select the 'Submissions Needing Revision' folder to locate your manuscript file.. When you're ready to submit your revision, log on to https://www.editorialmanager.com/pone/ and select the 'Submissions Needing Revision' folder to locate your manuscript file.. When you're ready to submit your revision, log on to https://www.editorialmanager.com/pone/ and select the 'Submissions Needing Revision' folder to locate your manuscript file. A letter that responds to each point raised by the academic editor and reviewer(s). You should upload this letter as a separate file labeled 'Response to Reviewers'. A marked-up copy of your manuscript that highlights changes made to the original version. You should upload this as a separate file labeled 'Revised Manuscript with Track Changes'. An unmarked version of your revised paper without tracked changes. You should upload this as a separate file labeled 'Manuscript'. If you would like to make changes to your financial disclosure, please include your updated statement in your cover letter. Guidelines for resubmitting your figure files are available below the reviewer comments at the end of this letter. If applicable, we recommend that you deposit your laboratory protocols in protocols.io to enhance the reproducibility of your results. Protocols.io assigns your protocol its own identifier (DOI) so that it can be cited independently in the future. For instructions see: https://journals.plos.org/plosone/s/submission-guidelines#loc-laboratory-protocols . Additionally, PLOS ONE offers an option for publishing peer-reviewed Lab Protocol articles, which describe protocols hosted on protocols.io. Read more information on sharing protocols at . Additionally, PLOS ONE offers an option for publishing peer-reviewed Lab Protocol articles, which describe protocols hosted on protocols.io. Read more information on sharing protocols at . Additionally, PLOS ONE offers an option for publishing peer-reviewed Lab Protocol articles, which describe protocols hosted on protocols.io. Read more information on sharing protocols at . Additionally, PLOS ONE offers an option for publishing peer-reviewed Lab Protocol articles, which describe protocols hosted on protocols.io. Read more information on sharing protocols at https://plos.org/protocols?utm_medium=editorial-email&utm_source=authorletters&utm_campaign=protocols .... We look forward to receiving your revised manuscript. Kind regards, Babak Aslani Academic Editor PLOS One Journal Requirements: If the reviewer comments include a recommendation to cite specific previously published works, please review and evaluate these publications to determine whether they are relevant and should be cited. There is no requirement to cite these works unless the editor has indicated otherwise. [Note: HTML markup is below. Please do not edit.] Reviewers' comments: Reviewer's Responses to Questions Comments to the Author Reviewer #1: All comments have been addressed Reviewer #2: All comments have been addressed ********** 2. Is the manuscript technically sound, and do the data support the conclusions??> Reviewer #1: Yes Reviewer #2: No ********** 3. Has the statistical analysis been performed appropriately and rigorously? -->?> Reviewer #1: Yes Reviewer #2: Yes ********** 4. Have the authors made all data underlying the findings in their manuscript fully available??> The PLOS Data policy requires authors to make all data underlying the findings described in their manuscript fully available without restriction, with rare exception (please refer to the Data Availability Statement in the manuscript PDF file). The data should be provided as part of the manuscript or its supporting information, or deposited to a public repository. For example, in addition to summary statistics, the data points behind means, medians and variance measures should be available. If there are restrictions on publicly sharing data—e.g. participant privacy or use of data from a third party—those must be specified.requires authors to make all data underlying the findings described in their manuscript fully available without restriction, with rare exception (please refer to the Data Availability Statement in the manuscript PDF file). The data should be provided as part of the manuscript or its supporting information, or deposited to a public repository. For example, in addition to summary statistics, the data points behind means, medians and variance measures should be available. If there are restrictions on publicly sharing data—e.g. participant privacy or use of data from a third party—those must be specified.--> Reviewer #1: Yes Reviewer #2: Yes ********** 5. Is the manuscript presented in an intelligible fashion and written in standard English??> Reviewer #1: Yes Reviewer #2: Yes ********** Reviewer #1: The author has addressed all the reviewer concerns, therefore he has fullfilled all the requirements. Reviewer #2: The revised manuscript presents its innovation and technical details more clearly, but also exposes potential technical risks. The DeepSeek-chat model, a famous LLM, is invoked to classify the graphs generated by the curvature mod. However, LLM is probability generated. Its primary goal is to generate natural, diverse, and creative text, rather than conducting stable deterministic calculations. For tasks such as graph classification that require structural awareness and deterministic computation, specialized GNN models far outperform LLM in accuracy, efficiency, consistency, and interpretability. LLM is more suitable as an auxiliary tool for interpreting, summarizing, or generating descriptive text based on graph data. Therefore, I believe that there is technical uncertainty in this work, which may lead to potential technical risks in the actual operation process. My final suggestion is to reject the manuscript. In addition, there is a small issue that the author can refer to: the next paragraph of equation (15) repeats the discussion after equation (14). ********** what does this mean? ). If published, this will include your full peer review and any attached files.). If published, this will include your full peer review and any attached files.). If published, this will include your full peer review and any attached files.). If published, this will include your full peer review and any attached files. If you choose “no”, your identity will remain anonymous but your review may still be made public. Do you want your identity to be public for this peer review? For information about this choice, including consent withdrawal, please see our For information about this choice, including consent withdrawal, please see our For information about this choice, including consent withdrawal, please see our For information about this choice, including consent withdrawal, please see our Privacy Policy ..--> Reviewer #1: No Reviewer #2: No ********** [NOTE: If reviewer comments were submitted as an attachment file, they will be attached to this email and accessible via the submission site. Please log into your account, locate the manuscript record, and check for the action link "View Attachments". If this link does not appear, there are no attachment files.] To ensure your figures meet our technical requirements, please review our figure guidelines: https://journals.plos.org/plosone/s/figures You may also use PLOS’s free figure tool, NAAS, to help you prepare publication quality figures: https://journals.plos.org/plosone/s/figures#loc-tools-for-figure-preparation . NAAS will assess whether your figures meet our technical requirements by comparing each figure against our figure specifications. PLoS One. 2026 Apr 15;21(4):e0346272. doi: 10.1371/journal.pone.0346272.r004 Author response to Decision Letter 2 Article notes Copyright and License information Collection date 2026. PMC Copyright notice 2 Mar 2026 Dear Dr Babak Aslani and Reviewers, Thank you very much for taking the time to review my manuscript entitled " Data Refinement Processing of Bridge Resilience Control Supported by Large-scale model Algorithm and Case Analysis". I greatly appreciate the constructive feedback and insightful comments, which have significantly helped me improve the quality of my work. Below, I provide a point-by-point response to the reviewers' comments. Reviewer 2 Comment: The revised manuscript presents its innovation and technical details more clearly, but also exposes potential technical risks. The DeepSeek-chat model, a famous LLM, is invoked to classify the graphs generated by the curvature mod. However, LLM is probability generated. Its primary goal is to generate natural, diverse, and creative text, rather than conducting stable deterministic calculations. For tasks such as graph classification that require structural awareness and deterministic computation, specialized GNN models far outperform LLM in accuracy, efficiency, consistency, and interpretability. LLM is more suitable as an auxiliary tool for interpreting, summarizing, or generating descriptive text based on graph data. Therefore, I believe that there is technical uncertainty in this work, which may lead to potential technical risks in the actual operation process. My final suggestion is to reject the manuscript. In addition, there is a small issue that the author can refer to: the next paragraph of equation (15) repeats the discussion after equation (14). Response : I sincerely appreciate the insightful and constructive comments raised by the reviewer, which have identified a key technical limitation in my manuscript and provided valuable guidance for enhancing the rigor and reliability of the research. We fully recognize and accept the core viewpoints of the reviewer. In the revised manuscript, I have adopted the GIN (Graph Isomorphism Network) to judge the similarity between graphs, and revised the algorithm process and corresponding results accordingly. Meanwhile, the redundant content in the paragraphs following Formula (15) has been deleted. Sincerely, Ming Chen Shanghai ZhongQiao Vocational and Technical University [email protected] Attachment Submitted filename: Rebuttal letter-2.pdf pone.0346272.s003.pdf (230.3KB, pdf) PLoS One. doi: 10.1371/journal.pone.0346272.r005 Decision Letter 2 Babak Aslani Babak Aslani Academic Editor Find articles by Babak Aslani Author information Copyright and License information Roles Babak Aslani : Academic Editor © 2026 Babak AslaniBabak AslaniBabak AslaniBabak Aslani This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. PMC Copyright notice 17 Mar 2026 Data compression of Bridge Resilience Control: Algorithm and Case PONE-D-25-50186R2 Dear Dr. Chen, We’re pleased to inform you that your manuscript has been judged scientifically suitable for publication and will be formally accepted for publication once it meets all outstanding technical requirements. Within one week, you’ll receive an e-mail detailing the required amendments. When these have been addressed, you’ll receive a formal acceptance letter and your manuscript will be scheduled for publication. An invoice will be generated when your article is formally accepted. Please note, if your institution has a publishing partnership with PLOS and your article meets the relevant criteria, all or part of your publication costs will be covered. Please make sure your user information is up-to-date by logging into Editorial Manager at Editorial Manager® and clicking the ‘Update My Information' link at the top of the page. For questions related to billing, please contact  and clicking the ‘Update My Information' link at the top of the page. For questions related to billing, please contact  and clicking the ‘Update My Information' link at the top of the page. For questions related to billing, please contact  and clicking the ‘Update My Information' link at the top of the page. For questions related to billing, please contact billing support .... If your institution or institutions have a press office, please notify them about your upcoming paper to help maximize its impact. If they’ll be preparing press materials, please inform our press team as soon as possible -- no later than 48 hours after receiving the formal acceptance. Your manuscript will remain under strict press embargo until 2 pm Eastern Time on the date of publication. For more information, please contact [email protected]. Kind regards, Babak Aslani, Ph.D. Academic Editor PLOS One Additional Editor Comments (optional): Reviewers' comments: Reviewer's Responses to Questions Comments to the Author Reviewer #1: All comments have been addressed Reviewer #2: All comments have been addressed ********** 2. Is the manuscript technically sound, and do the data support the conclusions??> Reviewer #1: Yes Reviewer #2: Yes ********** 3. Has the statistical analysis been performed appropriately and rigorously? -->?> Reviewer #1: Yes Reviewer #2: Yes ********** 4. Have the authors made all data underlying the findings in their manuscript fully available??> The PLOS Data policy requires authors to make all data underlying the findings described in their manuscript fully available without restriction, with rare exception (please refer to the Data Availability Statement in the manuscript PDF file). The data should be provided as part of the manuscript or its supporting information, or deposited to a public repository. For example, in addition to summary statistics, the data points behind means, medians and variance measures should be available. If there are restrictions on publicly sharing data—e.g. participant privacy or use of data from a third party—those must be specified.requires authors to make all data underlying the findings described in their manuscript fully available without restriction, with rare exception (please refer to the Data Availability Statement in the manuscript PDF file). The data should be provided as part of the manuscript or its supporting information, or deposited to a public repository. For example, in addition to summary statistics, the data points behind means, medians and variance measures should be available. If there are restrictions on publicly sharing data—e.g. participant privacy or use of data from a third party—those must be specified.--> Reviewer #1: Yes Reviewer #2: Yes ********** 5. Is the manuscript presented in an intelligible fashion and written in standard English??> Reviewer #1: Yes Reviewer #2: Yes ********** Reviewer #1: Every comment was addressed succesfully by the author following the indications, therefore recommend its publication under its present form. Reviewer #2: Thank you very much for the author's efforts in revising the manuscript and completing the experimental part again. The methods and techniques used in this manuscript are reasonable, and the quality of the manuscript has been greatly improved. I suggest accepting this manuscript for publication on PlOS One. ********** what does this mean? ). If published, this will include your full peer review and any attached files.). If published, this will include your full peer review and any attached files.). If published, this will include your full peer review and any attached files.). If published, this will include your full peer review and any attached files. If you choose “no”, your identity will remain anonymous but your review may still be made public. Do you want your identity to be public for this peer review? For information about this choice, including consent withdrawal, please see our For information about this choice, including consent withdrawal, please see our For information about this choice, including consent withdrawal, please see our For information about this choice, including consent withdrawal, please see our Privacy Policy ..--> Reviewer #1: No Reviewer #2: No ********** PLoS One. doi: 10.1371/journal.pone.0346272.r006 Acceptance letter Babak Aslani Babak Aslani Academic Editor Find articles by Babak Aslani Author information Copyright and License information Roles Babak Aslani : Academic Editor © 2026 Babak AslaniBabak AslaniBabak AslaniBabak Aslani This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. PMC Copyright notice PONE-D-25-50186R2 PLOS One Dear Dr. Chen, I'm pleased to inform you that your manuscript has been deemed suitable for publication in PLOS One. Congratulations! Your manuscript is now being handed over to our production team. At this stage, our production department will prepare your paper for publication. This includes ensuring the following: * All references, tables, and figures are properly cited * All relevant supporting information is included in the manuscript submission, * There are no issues that prevent the paper from being properly typeset You will receive further instructions from the production team, including instructions on how to review your proof when it is ready. Please keep in mind that we are working through a large volume of accepted articles, so please give us a few days to review your paper and let you know the next and final steps. Lastly, if your institution or institutions have a press office, please let them know about your upcoming paper now to help maximize its impact. If they'll be preparing press materials, please inform our press team within the next 48 hours. Your manuscript will remain under strict press embargo until 2 pm Eastern Time on the date of publication. For more information, please contact [email protected]. You will receive an invoice from PLOS for your publication fee after your manuscript has reached the completed accept phase. If you receive an email requesting payment before acceptance or for any other service, this may be a phishing scheme. Learn how to identify phishing emails and protect your accounts at https://explore.plos.org/phishing . If we can help with anything else, please email us at [email protected]. Thank you for submitting your work to PLOS ONE and supporting open access. Kind regards, PLOS ONE Editorial Office Staff on behalf of Dr. Babak Aslani Academic Editor PLOS One Associated Data This section collects any data citations, data availability statements, or supplementary materials included in this article. Supplementary Materials Attachment Submitted filename: Rebuttal letter.pdf pone.0346272.s002.pdf (520KB, pdf) Attachment Submitted filename: Rebuttal letter-2.pdf pone.0346272.s003.pdf (230.3KB, pdf) Data Availability Statement The runnable python code for bridge structural simulation and data compression is deposited in Zenodo (DOI: 10.5281/zenodo.18080198 ) under the MIT Open Source License. The code repository includes a detailed README document that describes all required dependencies (e.g., MATLAB R2023b, Python 3.9), installation steps and execution instructions to facilitate reproducibility. Articles from PLOS One are provided here courtesy of PLOS ACTIONS View on publisher site PDF (2.0 MB) Cite Collections Permalink PERMALINK Copy RESOURCES Similar articles Cited by other articles Links to NCBI Databases Cite Copy Download .nbib .nbib Format: AMA APA MLA NLM Add to Collections Create a new collection Add to an existing collection Name your collection * Choose a collection Unable to load your collection due to an error Please try again Add Cancel Follow NCBI NCBI on X (formerly known as Twitter) NCBI on Facebook NCBI on LinkedIn NCBI on GitHub NCBI RSS feed Connect with NLM NLM on X (formerly known as Twitter) NLM on Facebook NLM on YouTube National Library of Medicine 8600 Rockville Pike Bethesda, MD 20894 Web Policies FOIA HHS Vulnerability Disclosure Help Accessibility Careers NLM NIH HHS USA.gov Back to Top

Related documents

Record · ID 18511 · SHA-256 1d6200e8b8b743c9
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.