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