curve registration
Recently Published Documents


TOTAL DOCUMENTS

35
(FIVE YEARS 10)

H-INDEX

8
(FIVE YEARS 1)

Author(s):  
Lin Tang ◽  
Pengcheng Zeng ◽  
Jian Qing Shi ◽  
Won-Seok Kim

2021 ◽  
pp. 175-196
Author(s):  
J.S. Marron ◽  
Ian L. Dryden
Keyword(s):  

Author(s):  
Alessandro Casa ◽  
Charles Bouveyron ◽  
Elena Erosheva ◽  
Giovanna Menardi

AbstractMultivariate time-dependent data, where multiple features are observed over time for a set of individuals, are increasingly widespread in many application domains. To model these data, we need to account for relations among both time instants and variables and, at the same time, for subject heterogeneity. We propose a new co-clustering methodology for grouping individuals and variables simultaneously, designed to handle both functional and longitudinal data. Our approach borrows some concepts from the curve registration framework by embedding the shape invariant model in the latent block model, estimated via a suitable modification of the SEM-Gibbs algorithm. The resulting procedure allows for several user-defined specifications of the notion of cluster that can be chosen on substantive grounds and provides parsimonious summaries of complex time-dependent data by partitioning data matrices into homogeneous blocks. Along with the explicit modelling of time evolution, these aspects allow for an easy interpretation of the clusters, from which also low-dimensional settings may benefit.


Stats ◽  
2021 ◽  
Vol 4 (3) ◽  
pp. 762-775
Author(s):  
Anthony Ebert ◽  
Kerrie Mengersen ◽  
Fabrizio Ruggeri ◽  
Paul Wu

Approximate Bayesian computation is a likelihood-free inference method which relies on comparing model realisations to observed data with informative distance measures. We obtain functional data that are not only subject to noise along their y axis but also to a random warping along their x axis, which we refer to as the time axis. Conventional distances on functions, such as the L2 distance, are not informative under these conditions. The Fisher–Rao metric, previously generalised from the space of probability distributions to the space of functions, is an ideal objective function for aligning one function to another by warping the time axis. We assess the usefulness of alignment with the Fisher–Rao metric for approximate Bayesian computation with four examples: two simulation examples, an example about passenger flow at an international airport, and an example of hydrological flow modelling. We find that the Fisher–Rao metric works well as the objective function to minimise for alignment; however, once the functions are aligned, it is not necessarily the most informative distance for inference. This means that likelihood-free inference may require two distances: one for alignment and one for parameter inference.


Technometrics ◽  
2020 ◽  
pp. 1-13
Author(s):  
W. Zachary Horton ◽  
Garritt L. Page ◽  
C. Shane Reese ◽  
Lindsey K. Lepley ◽  
McKenzie White
Keyword(s):  

2019 ◽  
Author(s):  
Ravi Shankar ◽  
Hsi-Wei Hsieh ◽  
Nicolas Charon ◽  
Archana Venkataraman

2019 ◽  
Vol 46 (1) ◽  
pp. 177-198 ◽  
Author(s):  
Mariko Takagishi ◽  
Hiroshi Yadohisa

Sign in / Sign up

Export Citation Format

Share Document