Principal curves revisited
Statistics and ComputingPublished 1 December 1992
Robert Tibshirani
Citations223
SJR quartileQ1
SJR score0.81
SNIP1.26
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An alternative definition of a principal curve is given, based on a mixture model, that is a generalization of linear principal components and carried out through an EM algorithm.
Abstract
A principal curve (Hastie and Stuetzle, 1989) is a smooth curve passing through the 'middle' of a distribution or data cloud, and is a generalization of linear principal components. We give an alternative definition of a principal curve, based on a mixture model. Estimation is carried out through an EM algorithm. Some comparisons are made to the Hastie-Stuetzle definition.
Keywords
Computer ScienceMathematics
Journal of the Royal Statistical Society Series B (Statistical Methodology)Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm
49,657 Citations1977A. P. Dempster, N. M. Laird +1 more
IEEE Transactions on Pattern Analysis and Machine IntelligenceStochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
17,980 Citations1984Stuart Geman, Donald Geman
The analogy between images and statistical mechanics systems is made and the analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations, creating a highly parallel ``relaxation'' algorithm for MAP estimation.
Journal of the American Statistical AssociationSampling-Based Approaches to Calculating Marginal Densities
6,616 Citations1990Alan E. Gelfand, A. F. M. Smith
Stochastic substitution, the Gibbs sampler, and the sampling-importance-resampling algorithm can be viewed as three alternative sampling- (or Monte Carlo-) based approaches to the calculation of numerical estimates of marginal probability distributions.
Journal of the American Statistical AssociationThe Calculation of Posterior Distributions by Data Augmentation
3,782 Citations1987Martin A. Tanner, Wing Hung Wong
If data augmentation can be used in the calculation of the maximum likelihood estimate, then in the same cases one ought to be able to use it in the computation of the posterior distribution of parameters of interest.
The Annals of StatisticsOn the Convergence Properties of the EM Algorithm
3,252 Citations1983Changbao Wu
Journal of the American Statistical AssociationStatistical Analysis of Finite Mixture Distributions.
2,940 Citations1987Bruce G. Lindsay, D. M. Titterington +2 more
Journal of the American Statistical AssociationPrincipal Curves
893 Citations1989Trevor Hastie, Werner Stuetzle
The Annals of StatisticsThe Geometry of Mixture Likelihoods: A General Theory
636 Citations1983Bruce G. Lindsay
The Annals of StatisticsSpline Smoothing: The Equivalent Variable Kernel Method
444 Citations1984Bernard W. Silverman
Journal of the American Statistical AssociationKernel Smoothing of Data with Correlated Errors
277 Citations1990Naomi Altman
The mean squared error of kernel estimators is computed for processes with correlated errors, and the estimators are shown to be consistent when the sequence of error processes converges to a mixing sequence.
Principal Curves and Surfaces
182 Citations1984Trevor Hastie
Statistics and ComputingBayesian analysis of outlier problems using the Gibbs sampler
119 Citations1991Isabella Verdinelli, Larry Wasserman
It is shown that the Gibbs sampler brings considerable conceptual and computational simplicity to the problem of calculating posterior marginals and is notable for its ease of implementation.