The remarkable simplicity of very high dimensional data: application of model-based clustering

DOI10.1007/s00357-009-9037-9zbMath1337.62136arXiv0805.2756MaRDI QIDQ263091

Fionn Murtagh

Publication date: 4 April 2016

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0805.2756

zbMATH Keywords

dimensionality; multivariate data analysis; cluster analysis; hierarchy; \(p\)-adic; ultrametric

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

Related Items

Thinking Ultrametrically, Thinking p-Adically, Symmetry in data mining and analysis: a unifying view based on hierarchy, Discussion of: Treelets -- an adaptive multi-scale basis for sparse unordered data, Finding ultrametricity in data using topology, An algorithm for deciding the number of clusters and validation using simulated data with application to exploring crop population structure

Uses Software

• clue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchical trees can be perfectly scaled in one dimension
• The analytical solution of the additive constant problem
• On ultrametricity, data coding, and computation
• Dissimilarity and distance coefficients in automation-supported thesauri
• Estimating the dimension of a model
• Geometric representation of association between categories
• On a general transformation making a dissimilarity matrix Euclidean
• Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding
• Bayes Factors
• Geometric Representation of High Dimension, Low Sample Size Data
• Neighborliness of randomly projected simplices in high dimensions
• The high-dimension, low-sample-size geometric representation holds under mild conditions
• From Data to the Physics Using Ultrametrics: New Results in High Dimensional Data Analysis