Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Statistics and Probability
Self-Consistency Algorithms, Thaddeus Tarpey
Self-Consistency Algorithms, Thaddeus Tarpey
Mathematics and Statistics Faculty Publications
The k-means algorithm and the principal curve algorithm are special cases of a self-consistency algorithm. A general self-consistency algorithm is described and results are provided describing the behavior of the algorithm for theoretical distributions, in particular elliptical distributions. The results are used to contrast the behavior of the algorithms when applied to a theoretical model and when applied to finite datasets from the model. The algorithm is also used to determine principal loops for the bivariate normal distribution.
Self-Consistency: A Fundamental Concept In Statistics, Thaddeus Tarpey, Bernard Flury
Self-Consistency: A Fundamental Concept In Statistics, Thaddeus Tarpey, Bernard Flury
Mathematics and Statistics Faculty Publications
The term ''self-consistency'' was introduced in 1989 by Hastie and Stuetzle to describe the property that each point on a smooth curve or surface is the mean of all points that project orthogonally onto it. We generalize this concept to self-consistent random vectors: a random vector Y is self-consistent for X if E[X|Y] = Y almost surely. This allows us to construct a unified theoretical basis for principal components, principal curves and surfaces, principal points, principal variables, principal modes of variation and other statistical methods. We provide some general results on self-consistent random variables, give …