A novel meta-learning framework for forecast model selection using time series features. Many applications require a large number of time series to be forecast. Providing better forecasts for these time series is important in decision and policy making. We propose a classification framework which selects forecast models based on features calculated from the time series. We call this framework FFORMS (Feature-based FORecast Model Selection). FFORMS builds a mapping that relates the features of time series to the best forecast model using a random forest. 'seer' package is the implementation of the FFORMS algorithm. For more details see our paper at <https://www.monash.edu/business/econometrics-and-business-statistics/research/publications/ebs/wp06-2018.pdf>.

Creates SEER (Surveillance, Epidemiology and End Results) and 
    A-bomb data binaries from ASCII sources and provides tools for estimating
    SEER second cancer risks. Methods are described in <doi:10.1038/leu.2015.258>.

Functions for analysing, manipulating, displaying, editing and synthesizing time waves (particularly sound).  This package processes time analysis (oscillograms and envelopes), spectral content, resonance quality factor, entropy, cross correlation and autocorrelation, zero-crossing, dominant frequency, analytic signal, frequency coherence, 2D and 3D spectrograms and many other analyses. See Sueur et al. (2008) <doi:10.1080/09524622.2008.9753600> and Sueur (2018) <doi:10.1007/978-3-319-77647-7>.

Provides two methods for segmentation and joint segmentation/clustering of
    bivariate time-series. Originally intended for ecological segmentation
    (home-range and behavioural modes) but easily applied on other series,
    the package also provides tools for analysing outputs from R packages 'moveHMM' and 'marcher'.
    The segmentation method is a bivariate extension of  Lavielle's method available in 'adehabitatLT' 
    (Lavielle, 1999 <doi:10.1016/S0304-4149(99)00023-X> and 2005 <doi:10.1016/j.sigpro.2005.01.012>).
    This method rely on dynamic programming for efficient segmentation.
    The segmentation/clustering method alternates steps of dynamic programming with an Expectation-Maximization algorithm.
    This is an extension of Picard et al (2007) <doi:10.1111/j.1541-0420.2006.00729.x> method 
    (formerly available in 'cghseg' package) to the bivariate case.
    The method is fully described in Patin et al (2018) <doi:10.1101/444794>.