The remarkable simplicity of very high dimensional data: application of model-based clustering
From MaRDI portal
(Redirected from Publication:263091)
Abstract: 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 exemplify this finding through a range of simulated data cases. We discuss also application to very high frequency time series segmentation and modeling.
Recommendations
- From Data to the Physics Using Ultrametrics: New Results in High Dimensional Data Analysis
- Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding
- Ultrametric embedding: application to data fingerprinting and to fast data clustering
- Hierarchical Clustering for Finding Symmetries and Other Patterns in Massive, High Dimensional Datasets
- On the logistic behaviour of the topological ultrametricity of data
Cites work
- scientific article; zbMATH DE number 3168214 (Why is no real title available?)
- scientific article; zbMATH DE number 3969923 (Why is no real title available?)
- scientific article; zbMATH DE number 1199695 (Why is no real title available?)
- scientific article; zbMATH DE number 2080487 (Why is no real title available?)
- Bayes Factors
- Dissimilarity and distance coefficients in automation-supported thesauri
- Estimating the dimension of a model
- From Data to the Physics Using Ultrametrics: New Results in High Dimensional Data Analysis
- Geometric Representation of High Dimension, Low Sample Size Data
- Geometric representation of association between categories
- Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding
- Hierarchical trees can be perfectly scaled in one dimension
- Neighborliness of randomly projected simplices in high dimensions
- On a general transformation making a dissimilarity matrix Euclidean
- On ultrametricity, data coding, and computation
- The analytical solution of the additive constant problem
- The high-dimension, low-sample-size geometric representation holds under mild conditions
Cited in
(18)- Model-based clustering of high-dimensional data: a review
- Fast, linear time hierarchical clustering using the Baire metric
- Model based clustering of high-dimensional binary data
- Ultrametric embedding: application to data fingerprinting and to fast data clustering
- An algorithm for deciding the number of clusters and validation using simulated data with application to exploring crop population structure
- From Data to the Physics Using Ultrametrics: New Results in High Dimensional Data Analysis
- On the limits of clustering in high dimensions via cost functions
- Symmetry in data mining and analysis: a unifying view based on hierarchy
- A survey on unsupervised outlier detection in high‐dimensional numerical data
- Thinking ultrametrically, thinking \(p\)-adically
- Reduced-Rank Modeling for High-Dimensional Model-Based Clustering
- Discussion of: Treelets -- an adaptive multi-scale basis for sparse unordered data
- Direct reading algorithm for hierarchical clustering
- From data to the \(p\)-adic or ultrametric model
- On the logistic behaviour of the topological ultrametricity of data
- Finding ultrametricity in data using topology
- Ultrametricity indices for the Euclidean and Boolean hypercubes
- Ultrametricity of dissimilarity spaces and its significance for data mining
This page was built for publication: The remarkable simplicity of very high dimensional data: application of model-based clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263091)
