927 resultados para Time-series Analysis
Resumo:
Many modeling problems require to estimate a scalar output from one or more time series. Such problems are usually tackled by extracting a fixed number of features from the time series (like their statistical moments), with a consequent loss in information that leads to suboptimal predictive models. Moreover, feature extraction techniques usually make assumptions that are not met by real world settings (e.g. uniformly sampled time series of constant length), and fail to deliver a thorough methodology to deal with noisy data. In this paper a methodology based on functional learning is proposed to overcome the aforementioned problems; the proposed Supervised Aggregative Feature Extraction (SAFE) approach allows to derive continuous, smooth estimates of time series data (yielding aggregate local information), while simultaneously estimating a continuous shape function yielding optimal predictions. The SAFE paradigm enjoys several properties like closed form solution, incorporation of first and second order derivative information into the regressor matrix, interpretability of the generated functional predictor and the possibility to exploit Reproducing Kernel Hilbert Spaces setting to yield nonlinear predictive models. Simulation studies are provided to highlight the strengths of the new methodology w.r.t. standard unsupervised feature selection approaches. © 2012 IEEE.
Resumo:
The applicability of ultra-short-term wind power prediction (USTWPP) models is reviewed. The USTWPP method proposed extracts featrues from historical data of wind power time series (WPTS), and classifies every short WPTS into one of several different subsets well defined by stationary patterns. All the WPTS that cannot match any one of the stationary patterns are sorted into the subset of nonstationary pattern. Every above WPTS subset needs a USTWPP model specially optimized for it offline. For on-line application, the pattern of the last short WPTS is recognized, then the corresponding prediction model is called for USTWPP. The validity of the proposed method is verified by simulations.
Resumo:
In many applications, and especially those where batch processes are involved, a target scalar output of interest is often dependent on one or more time series of data. With the exponential growth in data logging in modern industries such time series are increasingly available for statistical modeling in soft sensing applications. In order to exploit time series data for predictive modelling, it is necessary to summarise the information they contain as a set of features to use as model regressors. Typically this is done in an unsupervised fashion using simple techniques such as computing statistical moments, principal components or wavelet decompositions, often leading to significant information loss and hence suboptimal predictive models. In this paper, a functional learning paradigm is exploited in a supervised fashion to derive continuous, smooth estimates of time series data (yielding aggregated local information), while simultaneously estimating a continuous shape function yielding optimal predictions. The proposed Supervised Aggregative Feature Extraction (SAFE) methodology can be extended to support nonlinear predictive models by embedding the functional learning framework in a Reproducing Kernel Hilbert Spaces setting. SAFE has a number of attractive features including closed form solution and the ability to explicitly incorporate first and second order derivative information. Using simulation studies and a practical semiconductor manufacturing case study we highlight the strengths of the new methodology with respect to standard unsupervised feature extraction approaches.
Resumo:
Despite fractured hard rock aquifers underlying over 65% of Ireland, knowledge of key processes controlling groundwater recharge in these bedrock systems is inadequately constrained. In this study, we examined 19 groundwater-level hydrographs from two Irish hillslope sites underlain by hard rock aquifers. Water-level time-series in clustered monitoring wells completed at the subsoil, soil/bedrock interface, shallow and deep bedrocks were continuously monitored hourly over two hydrological years. Correlation methods were applied to investigate groundwater-level response to rainfall, as well as its seasonal variations. The results reveal that the direct groundwater recharge to the shallow and deep bedrocks on hillslope is very limited. Water-level variations within these geological units are likely dominated by slow flow rock matrix storage. The rapid responses to rainfall (⩽2 h) with little seasonal variations were observed to the monitoring wells installed at the subsoil and soil/bedrock interface, as well as those in the shallow or deep bedrocks at the base of the hillslope. This suggests that the direct recharge takes place within these units. An automated time-series procedure using the water-table fluctuation method was developed to estimate groundwater recharge from the water-level and rainfall data. Results show the annual recharge rates of 42–197 mm/yr in the subsoil and soil/bedrock interface, which represent 4–19% of the annual rainfall. Statistical analysis of the relationship between the rainfall intensity and water-table rise reveal that the low rainfall intensity group (⩽1 mm/h) has greater impact on the groundwater recharge rate than other groups (>1 mm/h). This study shows that the combination of the time-series analysis and the water-table fluctuation method could be an useful approach to investigate groundwater recharge in fractured hard rock aquifers in Ireland.
Resumo:
This paper describes in detail the design of a CMOS custom fast Fourier transform (FFT) processor for computing a 256-point complex FFT. The FFT is well-suited for real-time spectrum analysis in instrumentation and measurement applications. The FFT butterfly processor reported here consists of one parallel-parallel multiplier and two adders. It is capable of computing one butterfly computation every 100 ns thus it can compute a 256-point complex FFT in 102.4 μs excluding data input and output processes.
Resumo:
This paper describes in detail the design of a custom CMOS Fast Fourier Transform (FFT) processor for computing 256-point complex FFT. The FFT is well suited for real-time spectrum analysis in instrumentation and measurement applications. The FFT butterfly processor consists of one parallel-parallel multiplier and two adders. It is capable of computing one butterfly computation every 100 ns thus it can compute 256-complex point FFT in 25.6 μs excluding data input and output processes.
Resumo:
The real convergence hypothesis has spurred a myriad of empirical tests and approaches in the economic literature. This Work Project intends to test for real output and growth convergence in all N(N-1)/2 possible pairs of output and output growth gaps of 14 Eurozone countries. This paper follows a time-series approach, as it tests for the presence of unit roots and persistence changes in the above mentioned pairs of output gaps, as well as for the existence of growth convergence with autoregressive models. Overall, significantly greater evidence has been found to support growth convergence rather than output convergence in our sample.
Resumo:
We propose methods for testing hypotheses of non-causality at various horizons, as defined in Dufour and Renault (1998, Econometrica). We study in detail the case of VAR models and we propose linear methods based on running vector autoregressions at different horizons. While the hypotheses considered are nonlinear, the proposed methods only require linear regression techniques as well as standard Gaussian asymptotic distributional theory. Bootstrap procedures are also considered. For the case of integrated processes, we propose extended regression methods that avoid nonstandard asymptotics. The methods are applied to a VAR model of the U.S. economy.
Resumo:
We consider the problem of testing whether the observations X1, ..., Xn of a time series are independent with unspecified (possibly nonidentical) distributions symmetric about a common known median. Various bounds on the distributions of serial correlation coefficients are proposed: exponential bounds, Eaton-type bounds, Chebyshev bounds and Berry-Esséen-Zolotarev bounds. The bounds are exact in finite samples, distribution-free and easy to compute. The performance of the bounds is evaluated and compared with traditional serial dependence tests in a simulation experiment. The procedures proposed are applied to U.S. data on interest rates (commercial paper rate).