Cargando…
The Cluster Structure Function
For each partition of a data set into a given number of parts there is a partition such that every part is as much as possible a good model (an “algorithmic sufficient statistic”) for the data in that part. Since this can be done for every number between one and the number of data, the result is a f...
Autores principales: | Cohen, Andrew R., Vitányi, Paul M.B. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10525042/ https://www.ncbi.nlm.nih.gov/pubmed/37018105 http://dx.doi.org/10.1109/TPAMI.2023.3264690 |
Ejemplares similares
-
How Incomputable Is Kolmogorov Complexity?
por: Vitányi, Paul M.B.
Publicado: (2020) -
Identification of probabilities
por: Vitányi, Paul M.B., et al.
Publicado: (2017) -
Fast Whole-Genome Phylogeny of the COVID-19 Virus SARS-CoV-2 by Compression
por: Cilibrasi, Rudi L., et al.
Publicado: (2020) -
Fast Phylogeny of SARS-CoV-2 by Compression
por: Cilibrasi, Rudi L., et al.
Publicado: (2022) -
An introduction to Kolmogorov complexity and its applications
por: Li Ming Wei, et al.
Publicado: (1997)