Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Functional Clustering and Functional Principal Points
verfasst von : Nobuo Shimizu, Masahiro Mizuta
Erschienen in: Knowledge-Based Intelligent Information and Engineering Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, we deal with the relation between functional clustering and functional principal points. The
k
principal points are defined as the set of
k
points which minimizes the sum of expected squared distances from every points in the distribution to the nearest point of the set, and are mathematically equivalent to centers of gravity by
k
-means clustering.[3] The concept of principal points can be extended for functional clustering. We call the extended principal points
functional principal points
.
Random function
[5] is defined in a probability space, and functional principal points of a random function have a close relation to functional data analysis. We derive functional principal points of polynomial random functions using orthonormal basis transformation. For functional data following Gaussian random functions, we discuss the relation between the optimum clustering of the functional data and the functional principal points.