Interpolated Mapping System Identification From Time Series Data

1993 ◽  
Author(s):  
Faruk H. Bursal ◽  
Benson H. Tongue
Keyword(s):  
Time Series ◽  
System Identification ◽  
Time Series Data ◽  
Initial Conditions ◽  
Series Data ◽  
Time Interval ◽  
Identification Algorithm ◽  
Regular Grid ◽  
Time Step ◽  
Data Set

Abstract In this paper, a system identification algorithm based on Interpolated Mapping (IM) that was introduced in a previous paper is generalized to the case of data stemming from arbitrary time series. The motivation for the new algorithm is the need to identify nonlinear dynamics in continuous time from discrete-time data. This approach has great generality and is applicable to problems arising in many areas of science and engineering. In the original formulation, a map defined on a regular grid in the state space of a dynamical system was assumed to be given. For the formulation to become practically viable, however, the requirement of initial conditions being taken from such a regular grid needs to be dropped. In particular, one would like to use time series data, where the time interval between samples is identified with the mapping time step T. This paper is concerned with the resulting complications. Various options for extending the formulation are examined, and a choice is made in favor of a pre-processing algorithm for estimating the FS map based on local fits to the data set. The suggested algorithm also has smoothing properties that are desirable from the standpoint of noise reduction.

Time Series Data Mining

2014 ◽  
Vol 1 (4) ◽  
pp. 51-68 ◽  
Author(s):  
Daniel Hebert ◽  
Billie Anderson ◽  
Alan Olinsky ◽  
J. Michael Hardin
Keyword(s):  
Data Mining ◽  
Time Series ◽  
Time Series Data ◽  
Grocery Store ◽  
Series Data ◽  
Time Interval ◽  
Real World Data ◽  
Similar Time ◽  
Data Set ◽  
Time Series Data Mining

Modern technologies have allowed for the amassment of data at a rate never encountered before. Organizations are now able to routinely collect and process massive volumes of data. A plethora of regularly collected information can be ordered using an appropriate time interval. The data would thus be developed into a time series. Time series data mining methodology identifies commonalities between sets of time-ordered data. Time series data mining detects similar time series using a technique known as dynamic time warping (DTW). This research provides a practical application of time series data mining. A real-world data set was provided to the authors by dunnhumby. A time series data mining analysis is performed using retail grocery store chain data and results are provided.

scholarly journals Remaining Useful Life Prediction Using Temporal Convolution with Attention

AI ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 48-70
Author(s):  
Wei Ming Tan ◽  
T. Hui Teo
Keyword(s):  
Neural Network ◽  
Time Series ◽  
Time Series Data ◽  
Remaining Useful Life ◽  
Sensor Data ◽  
Series Data ◽  
Multiple Time ◽  
Data Set ◽  
Form Complex ◽  
Useful Life

Prognostic techniques attempt to predict the Remaining Useful Life (RUL) of a subsystem or a component. Such techniques often use sensor data which are periodically measured and recorded into a time series data set. Such multivariate data sets form complex and non-linear inter-dependencies through recorded time steps and between sensors. Many current existing algorithms for prognostic purposes starts to explore Deep Neural Network (DNN) and its effectiveness in the field. Although Deep Learning (DL) techniques outperform the traditional prognostic algorithms, the networks are generally complex to deploy or train. This paper proposes a Multi-variable Time Series (MTS) focused approach to prognostics that implements a lightweight Convolutional Neural Network (CNN) with attention mechanism. The convolution filters work to extract the abstract temporal patterns from the multiple time series, while the attention mechanisms review the information across the time axis and select the relevant information. The results suggest that the proposed method not only produces a superior accuracy of RUL estimation but it also trains many folds faster than the reported works. The superiority of deploying the network is also demonstrated on a lightweight hardware platform by not just being much compact, but also more efficient for the resource restricted environment.

scholarly journals WDSchain: A Toolbox for Enhancing the Security Using Blockchain Technology in Water Distribution System

Water ◽  
2021 ◽  
Vol 13 (14) ◽  
pp. 1944
Author(s):  
Haitham H. Mahmoud ◽  
Wenyan Wu ◽  
Yonghao Wang
Keyword(s):  
Time Series ◽  
Distribution Systems ◽  
Water Distribution ◽  
Time Series Data ◽  
Series Data ◽  
Process Time ◽  
Time Interval ◽  
Security Level ◽  
Data Validation ◽  
Simulated Time

This work develops a toolbox called WDSchain on MATLAB that can simulate blockchain on water distribution systems (WDS). WDSchain can import data from Excel and EPANET water modelling software. It extends the EPANET to enable simulation blockchain of the hydraulic data at any intended nodes. Using WDSchain will strengthen network automation and the security in WDS. WDSchain can process time-series data with two simulation modes: (1) static blockchain, which takes a snapshot of one-time interval data of all nodes in WDS as input and output into chained blocks at a time, and (2) dynamic blockchain, which takes all simulated time-series data of all the nodes as input and establishes chained blocks at the simulated time. Five consensus mechanisms are developed in WDSchain to provide data at different security levels using PoW, PoT, PoV, PoA, and PoAuth. Five different sizes of WDS are simulated in WDSchain for performance evaluation. The results show that a trade-off is needed between the system complexity and security level for data validation. The WDSchain provides a methodology to further explore the data validation using Blockchain to WDS. The limitations of WDSchain do not consider selection of blockchain nodes and broadcasting delay compared to commercial blockchain platforms.

scholarly journals Studying monthly rainfall over Dibrugarh, Assam: Use of SARIMA approach

MAUSAM ◽  
2021 ◽  
Vol 68 (2) ◽  
pp. 349-356
Author(s):  
J. HAZARIKA ◽  
B. PATHAK ◽  
A. N. PATOWARY
Keyword(s):  
Time Series ◽  
Time Series Data ◽  
Moving Average ◽  
Demand Management ◽  
Arima Model ◽  
Monthly Rainfall ◽  
Series Data ◽  
Data Set ◽  
Modeling And Forecasting ◽  
Moving Average Model

Perceptive the rainfall pattern is tough for the solution of several regional environmental issues of water resources management, with implications for agriculture, climate change, and natural calamity such as floods and droughts. Statistical computing, modeling and forecasting data are key instruments for studying these patterns. The study of time series analysis and forecasting has become a major tool in different applications in hydrology and environmental fields. Among the most effective approaches for analyzing time series data is the ARIMA (Autoregressive Integrated Moving Average) model introduced by Box and Jenkins. In this study, an attempt has been made to use Box-Jenkins methodology to build ARIMA model for monthly rainfall data taken from Dibrugarh for the period of 1980- 2014 with a total of 420 points.  We investigated and found that ARIMA (0, 0, 0) (0, 1, 1)12 model is suitable for the given data set. As such this model can be used to forecast the pattern of monthly rainfall for the upcoming years, which can help the decision makers to establish priorities in terms of agricultural, flood, water demand management etc.  

scholarly journals Time series analysis of radiant heat using 75 hours VIIRS satellite day and night band nightfire data

2020 ◽  
Vol 2020 (1) ◽  
pp. 98-117
Author(s):  
Jyoti U. Devkota
Keyword(s):  
Time Series ◽  
Infrared Imaging ◽  
Time Series Data ◽  
Spline Interpolation ◽  
Radiant Heat ◽  
Series Data ◽  
Time Interval ◽  
Industrial Sites ◽  
Steel Mills ◽  
Gas Flares

Abstract The nightfires illuminated on the earth surface are caught by the satellite. These are emitted by various sources such as gas flares, biomass burning, volcanoes, and industrial sites such as steel mills. Amount of nightfires in an area is a proxy indicator of fuel consumption and CO2 emission. In this paper the behavior of radiant heat (RH) data produced by nightfire is minutely analyzed over a period of 75 hour; the geographical coordinates of energy sources generating these values are not considered. Visible Infrared Imaging Radiometer Suite Day/Night Band (VIIRS DNB) satellite earth observation nightfire data were used. These 75 hours and 28252 observations time series RH (unit W) data is from 2 September 2018 to 6 September 2018. The dynamics of change in the overall behavior these data and with respect to time and irrespective of its geographical occurrence is studied and presented here. Different statistical methodologies are also used to identify hidden groups and patterns which are not obvious by remote sensing. Underlying groups and clusters are formed using Cluster Analysis and Discriminant Analysis. The behavior of RH for three consecutive days is studied with the technique Analysis of Variance. Cubic Spline Interpolation and merging has been done to create a time series data occurring at equal minute time interval. The time series data is decomposed to study the effect of various components. The behavior of this data is also analyzed in frequency domain by study of period, amplitude and the spectrum.

scholarly journals ESTIMATION OF AUTOREGRESSIVE ROOTS NEAR UNITY USING PANEL DATA

2000 ◽  
Vol 16 (6) ◽  
pp. 927-997 ◽  
Author(s):  
Hyungsik R. Moon ◽  
Peter C.B. Phillips
Keyword(s):  
Time Series ◽  
Panel Data ◽  
Time Series Data ◽  
Initial Conditions ◽  
Series Data ◽  
Test Statistics ◽  
Rate Condition ◽  
Panel Models ◽  
Stochastic Trends ◽  
Efficient Extraction

Time series data are often well modeled by using the device of an autoregressive root that is local to unity. Unfortunately, the localizing parameter (c) is not consistently estimable using existing time series econometric techniques and the lack of a consistent estimator complicates inference. This paper develops procedures for the estimation of a common localizing parameter using panel data. Pooling information across individuals in a panel aids the identification and estimation of the localizing parameter and leads to consistent estimation in simple panel models. However, in the important case of models with concomitant deterministic trends, it is shown that pooled panel estimators of the localizing parameter are asymptotically biased. Some techniques are developed to overcome this difficulty, and consistent estimators of c in the region c < 0 are developed for panel models with deterministic and stochastic trends. A limit distribution theory is also established, and test statistics are constructed for exploring interesting hypotheses, such as the equivalence of local to unity parameters across subgroups of the population. The methods are applied to the empirically important problem of the efficient extraction of deterministic trends. They are also shown to deliver consistent estimates of distancing parameters in nonstationary panel models where the initial conditions are in the distant past. In the development of the asymptotic theory this paper makes use of both sequential and joint limit approaches. An important limitation in the operation of the joint asymptotics that is sometimes needed in our development is the rate condition n/T → 0. So the results in the paper are likely to be most relevant in panels where T is large and n is moderately large.

Exploratory Time Series Data Mining by Genetic Clustering

2011 ◽  
pp. 157-178
Author(s):  
T. Warren Liao
Keyword(s):  
Data Mining ◽  
Time Series ◽  
Time Series Data ◽  
Distance Measures ◽  
Series Data ◽  
Synthetic Control ◽  
Data Set ◽  
Univariate Time Series ◽  
Genetic Clustering ◽  
Data Objects

In this chapter, we present genetic algorithm (GA) based methods developed for clustering univariate time series with equal or unequal length as an exploratory step of data mining. These methods basically implement the k-medoids algorithm. Each chromosome encodes in binary the data objects serving as the k-medoids. To compare their performance, both fixed-parameter and adaptive GAs were used. We first employed the synthetic control chart data set to investigate the performance of three fitness functions, two distance measures, and other GA parameters such as population size, crossover rate, and mutation rate. Two more sets of time series with or without known number of clusters were also experimented: one is the cylinder-bell-funnel data and the other is the novel battle simulation data. The clustering results are presented and discussed.

A simple method for reconstructing a high-quality NDVI time-series data set based on the Savitzky–Golay filter

2004 ◽  
Vol 91 (3-4) ◽  
pp. 332-344 ◽  
Author(s):  
Jin Chen ◽  
Per. Jönsson ◽  
Masayuki Tamura ◽  
Zhihui Gu ◽  
Bunkei Matsushita ◽  
...  
Keyword(s):  
Time Series ◽  
Time Series Data ◽  
Series Data ◽  
High Quality ◽  
Data Set ◽  
Simple Method ◽  
Ndvi Time Series
Sign in / Sign up

Export Citation Format

Share Document