Clustering by Compression
From MaRDI portal
Publication:3546722
Kolmogorov complexitynormalized compression distanceheterogenous data analysishierarchical unsupervised clusteringparameter-free data miningquartet tree methoduniversal dissimilarity distance
Learning and adaptive systems in artificial intelligence (68T05) Information theory (general) (94A15) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Recommendations
Cited in
(71)- Artificial sequences and complexity measures
- A philosophical treatise of universal induction
- Mining Compressing Sequential Patterns
- On Universal Transfer Learning
- Probing the quantum-classical boundary with compression software
- Evaluating the Impact of Information Distortion on Normalized Compression Distance
- Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
- Exploring programmable self-assembly in non-DNA based molecular computing
- An automatic and parameter-free information-based method for sparse representation in wavelet bases
- Algorithmic complexity bounds on future prediction errors
- Using data compressors to construct order tests for homogeneity and component independence
- On the complexity and dimension of continuous finite-dimensional maps
- The Application of Data Compression-Based Distances to Biological Sequences
- Sequence distance via parsing complexity: heartbeat signals
- Nonapproximability of the normalized information distance
- INFORMATION DISTANCE AND ITS APPLICATIONS
- An information theory approach to stock market liquidity
- A copula entropy approach to correlation measurement at the country level
- Open problems in universal induction \& intelligence
- Grammar-based compression and its use in symbolic music analysis
- Information-theoretic method for classification of texts
- Improved metaheuristics for the quartet method of hierarchical clustering
- Compression based homogeneity testing
- Approximating ( k,ℓ )-Median Clustering for Polygonal Curves
- Aspects in classification learning -- review of recent developments in learning vector quantization
- A linearly computable measure of string complexity
- Between order and chaos: The quest for meaningful information
- Implementation and Application of Automata
- Theoretical computer science: computational complexity
- Indefinite proximity learning: a review
- Compression-based distance between string data and its application to literary work classification based on authorship
- Realism and Texture: Benchmark Problems for Natural Computation
- An all-or-nothing flavor to the Church-Turing hypothesis
- An exact algorithm for the minimum quartet tree cost problem
- Sublinear algorithms for approximating string compressibility
- Summarizing and understanding large graphs
- An extension of the Burrows-Wheeler transform
- Expanding the algorithmic information theory frame for applications to Earth observation
- Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data
- A new combinatorial approach to sequence comparison
- On universal transfer learning
- On universal prediction and Bayesian confirmation
- A linguistic approach to classification of bacterial genomes
- Textual data compression in computational biology: algorithmic techniques
- A fast quartet tree heuristic for hierarchical clustering
- Computable model discovery and high-level-programming approximations to algorithmic complexity
- Hierarchical clustering of text documents
- Clustering with respect to the information distance
- A parametrized family of Tversky metrics connecting the Jaccard distance to an analogue of the normalized information distance
- Notes on sum-tests and independence tests
- Quantum information distance
- Ranking inter-relationships between clusters
- Using ideas of Kolmogorov complexity for studying biological texts
- Solovay functions and their applications in algorithmic randomness
- Similarity and denoising
- Topographic mapping of large dissimilarity data sets
- A \textit{really} simple approximation of smallest grammar
- Comparative genomics with succinct colored de Bruijn graphs
- Kolmogorov Complexity-Based Similarity Measures to Website Classification Problems: Leveraging Normalized Compression Distance
- Normalized information-based divergences
- Preliminary results on masquerader detection using compression based similarity metrics
- Distance measures for biological sequences: some recent approaches
- Universal codes as a basis for time series testing
- Clustering the normalized compression distance for influenza virus data
- The Similarity Metric
- Algorithmic relative complexity
- Temporal clustering of time series via threshold autoregressive models: application to commodity prices
- Pattern classification of phylogeny signals
- Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes
- The Normalized Compression Distance Is Resistant to Noise
- Detecting life signatures with RNA sequence similarity measures
This page was built for publication: Clustering by Compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546722)
