The Remarkable Simplicity of Very High Dimensional Data: Application of Model-Based Clustering

@article{Murtagh2009TheRS,
  title={The Remarkable Simplicity of Very High Dimensional Data: Application of Model-Based Clustering},
  author={F. Murtagh},
  journal={Journal of Classification},
  year={2009},
  volume={26},
  pages={249-277}
}
  • F. Murtagh
  • Published 2009
  • Mathematics, Computer Science
  • Journal of Classification
  • An ultrametric topology formalizes the notion of hierarchical structure. An ultrametric embedding, referred to here as ultrametricity, is implied by a hierarchical embedding. Such hierarchical structure can be global in the data set, or local. By quantifying extent or degree of ultrametricity in a data set, we show that ultrametricity becomes pervasive as dimensionality and/or spatial sparsity increases. This leads us to assert that very high dimensional data are of simple structure. We… CONTINUE READING
    Optimal Control on Lie Groups: The Projection Operator Approach
    37
    The Biology of Rarity
    214
    On the limits of clustering in high dimensions via cost functions
    4

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 48 REFERENCES
    The origin of brainstem noradrenergic and serotonergic projections to the spinal cord dorsal horn in the rat.
    184
    Herpesviruses use bidirectional fast-axonal transport to spread in sensory neurons
    260
    An Expected utility theory for state-dependent preferences
    • 1980