«smoothing method»

۴۶٬۲۲۸ نتیجه
  • Forecasting with exponential smoothing methods and bootstrap

    سند علمی۲۰۱۲C. Cordeiro, Manuela Neves

    The Boot.EXPOS procedure is an algorithm that combines the use of exponential smoothing methods with the bootstrap methodology for obtaining forecasts. In previous works the authors have studied and analyzed the interaction between these two methodologies. The initial sketch of t

  • Perturbative Analysis of Adaptive Smoothing Methods in Quantifying Large-Scale Structure

    سند علمی۲۰۰۸Naoki Seto

    Smoothing operation to make continuous density field from observed point-like distribution of galaxies is crucially important for topological or morphological analysis of the large-scale structure, such as, the genus statistics or the area statistics (equivalently the level cross

  • A new adaptive exponential smoothing method for non-stationary time series with level shifts

    مقاله۲۰۱۴Journal of Industrial Engineering, InternationalMohammad Ali Saniee Monfared, Razieh Ghandali, Maryam Esmaeili

    Simple exponential smoothing (SES) methods are the most commonly used methods in forecasting and time series analysis. However, they are generally insensitive to non-stationary structural events such as level shifts, ramp shifts, and spikes or impulses. Similar to that of outlier

  • A Feature Smoothing Method for Chord Recognition Using Recurrence Plots

    سند علمی۲۰۱۱ISMIRTaemin Cho, Juan Pablo Bello

    In this paper, we propose a feature smoothing technique for chord recognition tasks based on repeated patterns within a song. By only considering repeated segments of a song, our method can smooth the features without losing chord boundary information and fine details of the orig

  • An Automatic Sequential Smoothing Method for Processing Biomechanical Kinematic Signals

    سند علمی۲۰۱۳F. J. ALONSO, F. ROMERO, D. R. SALGADO

    The combined application of Singular Spectrum Analysis (SSA) and Cluster Analysis to the automatic smoothing of raw kinematic signals is an alternative to the use of traditional digital filtering and spline based methods. SSA is a non parametric technique that decomposes original

  • Forecasting Unemployment Rate in Selected European Countries Using Smoothing Methods

    سند علمی۲۰۱۵

    Abstract—The aim of this paper is to select the most accurate forecasting method for predicting the future values of the unemployment rate in selected European countries. In order to do so, several forecasting techniques adequate for forecasting time series with trend component,

  • Forecasting Unemployment Rate in Selected European Countries Using Smoothing Methods

    سند علمی۲۰۱۵

    Abstract—The aim of this paper is to select the most accurate forecasting method for predicting the future values of the unemployment rate in selected European countries. In order to do so, several forecasting techniques adequate for forecasting time series with trend component,

  • A new image smoothing method based on a simple model of spatial processing in the early stages of human vision

    سند علمی۲۰۰۰IEEE transactions on image processing : a publication of the IEEE Signal Processing SocietyKamel Belkacem-Boussaid, Azeddine Beghdadi

    The difficulty of preserving edges is central to the problem of smoothing images. The main problem is that of distinguishing between meaningful contours and noise, so that the image can be smoothed without loss of details. Substantial efforts have been devoted to solving this dif

  • Forecasting Using Simple Exponential Smoothing Method

    سند علمی۲۰۱۲Eva OSTERTAGOVÁ, Oskar OSTERTAG

    In the paper a relatively simple yet powerful and versatile technique for forecasting time series data – simple exponential smoothing is described. The simple exponential smoothing (SES) is a short-range forecasting method that assumes a reasonably stable mean in the data with no

  • Smoothing methods for convex inequalities and linear complementarity problems

    سند علمی۱۹۹۵Math. Program.Chunhui Chen, Olvi L. Mangasarian

    A smooth approximation p(x;) to the plus function: maxfx; 0g, is obtained by integrating the sigmoid function 1=(1 + e ?x), commonly used in neural networks. By means of this approximation, linear and convex inequalities are converted into smooth, convex unconstrained minimizatio