Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-the-logistic-behaviour-of-the-topological-ultrametricity-of-data-HKo3NOZdpg
References (27)
-
P. Bradley, A. Braun (2015)
Finding the Asymptotically Optimal Baire Distance for Multi-Channel DataApplied Mathematics-a Journal of Chinese Universities Series B, 06
-
F. Murtagh (2008)
The Remarkable Simplicity of Very High Dimensional Data: Application of Model-Based ClusteringJournal of Classification, 26
-
R. Fisher (1936)
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMSAnnals of Human Genetics, 7
-
P ERDŐS, A RÉ NYI (1960)
On the Evolution of Random GraphsPublications of the Mathematical Institute of the Hungarian Academy of Sciences, 5
-
PE BRADLEY (2010)
Mumford DendrogramsThe Computer Journal, 53
-
P. Bradley (2017)
Finding Ultrametricity in Data using TopologyJournal of Classification, 34
-
A. Zomorodian (2010)
Fast construction of the Vietoris-Rips complexComput. Graph., 34
-
Omid Rouhani-Kalleh (2007)
Algorithms for Fast Large Scale Data Mining Using Logistic Regression2007 IEEE Symposium on Computational Intelligence and Data Mining
-
L. Vietoris (1927)
Über den höheren Zusammenhang kompakter Räume und eine Klasse von zusammenhangstreuen AbbildungenMathematische Annalen, 97
-
P. Erdos, A. Rényi (1984)
On the evolution of random graphsTransactions of the American Mathematical Society, 286
-
RA FISHER (1936)
The Use of Multiple Measurements in Taxonomic ProblemsAnnals of Eugenics, 7
-
A. Zubarev (2013)
On stochastic generation of ultrametrics in high-dimensional Euclidean spacesP-Adic Numbers, Ultrametric Analysis, and Applications, 6
-
G. Carlsson (2009)
Topology and dataBulletin of the American Mathematical Society, 46
-
P. Bradley (2009)
On p-adic classificationP-Adic Numbers, Ultrametric Analysis, and Applications, 1
-
G CARLSSON (2009)
Topology and DataBulletin of the AMS, 46
-
P. Bradley (2016)
Ultrametricity indices for the Euclidean and Boolean hypercubesP-Adic Numbers, Ultrametric Analysis, and Applications, 8
-
(1980)
L’Analyse des Données: La Taxinomie (Vol. 1, 3rd ed.), Paris: Denod -
V. Avetisov, V. Avetisov, P. Krapivsky, S. Nechaev, S. Nechaev (2015)
Native ultrametricity of sparse random ensemblesJournal of Physics A: Mathematical and Theoretical, 49
-
R. Rammal, J. d'Auriac, B. Douçot (1985)
On the degree of ultrametricityJournal De Physique Lettres, 46
-
P. Bradley (2007)
Degenerating Families of DendrogramsJournal of Classification, 25
-
(2013)
UCI Machine Learning Repository”, http://archive.ics.uci.edu/ml, University of California, Irvine, School of Information and Computer Sciences -
P. Horton, K. Nakai (1996)
A Probabilistic Classification System for Predicting the Cellular Localization Sites of ProteinsProceedings. International Conference on Intelligent Systems for Molecular Biology, 4
-
JP BENZECRI (1980)
L?Analyse des Donn�es: La Taxinomie (Vol. 1, 3rd ed.) -
I. Evett, E. Spiehler (1989)
Rule induction in forensic scienceKnowledge Based Systems
-
P. Bradley (2007)
Mumford DendrogramsArXiv, abs/0707.3540
-
F. Murtagh (2004)
On Ultrametricity, Data Coding, and ComputationJournal of Classification, 21
-
S. Janson, D. Knuth, T. Luczak, B. Pittel (1993)
The Birth of the Giant ComponentRandom Struct. Algorithms, 4
- Publisher
- Springer Journals
- Copyright
- Copyright © 2018 by Classification Society of North America
- Subject
- Statistics; Statistical Theory and Methods; Pattern Recognition; Bioinformatics; Signal,Image and Speech Processing; Psychometrics; Marketing
- ISSN
- 0176-4268
- eISSN
- 1432-1343
- DOI
- 10.1007/s00357-018-9281-y
- Publisher site
- See Article on Publisher Site
Abstract
Recently, it has been observed that topological ultrametricity of data can be expressed as an integral over a function which describes local ultrametricity. It was then observed empirically that this function begins as a sharply decreasing function, in order to increase again back to one. After providing a method for estimating the falling part of the local ultrametricity of data, empirical evidence is given for its logistic behaviour in relation to the number of connected components of the Vietoris-Rips graphs involved. The result is a functional dependence between that number and the number of maximal cliques. Further, it turns out that the logistic parameters depend linearly on the datasize. These observations are interpreted in terms of the Erdős-Rényi model for random graphs. Thus the findings allow to define a percolationbased index for almost ultrametricity which can be estimated in O(N 2 logN) time which is more efficient than most ultrametricity indices.
Journal
Journal of Classification – Springer Journals
Published: Nov 16, 2018