Clustering by Compression
From MaRDI portal
Publication:3546722
DOI10.1109/TIT.2005.844059zbMath1297.68097WikidataQ56269115 ScholiaQ56269115MaRDI QIDQ3546722
Paul M. B. Vitányi, Rudi L. Cilibrasi
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Kolmogorov complexitynormalized compression distanceheterogenous data analysishierarchical unsupervised clusteringparameter-free data miningquartet tree methoduniversal dissimilarity distance
Learning and adaptive systems in artificial intelligence (68T05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) 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) Information theory (general) (94A15)
Related Items (60)
Exploring programmable self-assembly in non-DNA based molecular computing ⋮ Quantum information distance ⋮ Topographic Mapping of Large Dissimilarity Data Sets ⋮ Kolmogorov Complexity-Based Similarity Measures to Website Classification Problems: Leveraging Normalized Compression Distance ⋮ Using data compressors to construct order tests for homogeneity and component independence ⋮ On universal prediction and Bayesian confirmation ⋮ A parametrized family of Tversky metrics connecting the Jaccard distance to an analogue of the normalized information distance ⋮ Sublinear algorithms for approximating string compressibility ⋮ Computable model discovery and high-level-programming approximations to algorithmic complexity ⋮ Algorithmic complexity bounds on future prediction errors ⋮ Open problems in universal induction \& intelligence ⋮ Clustering with respect to the information distance ⋮ Realism and Texture: Benchmark Problems for Natural Computation ⋮ A philosophical treatise of universal induction ⋮ Approximating ( k,ℓ )-Median Clustering for Polygonal Curves ⋮ Hierarchical clustering of text documents ⋮ INFORMATION DISTANCE AND ITS APPLICATIONS ⋮ A fast quartet tree heuristic for hierarchical clustering ⋮ Similarity and denoising ⋮ Aspects in classification learning -- review of recent developments in learning vector quantization ⋮ Using ideas of Kolmogorov complexity for studying biological texts ⋮ Notes on sum-tests and independence tests ⋮ A \textit{really} simple approximation of smallest grammar ⋮ Temporal clustering of time series via threshold autoregressive models: application to commodity prices ⋮ On Universal Transfer Learning ⋮ A linearly computable measure of string complexity ⋮ Detecting life signatures with RNA sequence similarity measures ⋮ On the Complexity and Dimension of Continuous Finite-Dimensional Maps ⋮ Indefinite Proximity Learning: A Review ⋮ Textual data compression in computational biology: algorithmic techniques ⋮ An All-or-Nothing Flavor to the Church-Turing Hypothesis ⋮ Normalized information-based divergences ⋮ Evaluating the Impact of Information Distortion on Normalized Compression Distance ⋮ Algorithmic relative complexity ⋮ Solovay functions and their applications in algorithmic randomness ⋮ Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes ⋮ An extension of the Burrows-Wheeler transform ⋮ Ranking inter-relationships between clusters ⋮ Information-theoretic method for classification of texts ⋮ An automatic and parameter-free information-based method for sparse representation in wavelet bases ⋮ A new combinatorial approach to sequence comparison ⋮ Compression-based distance between string data and its application to literary work classification based on authorship ⋮ Compression based homogeneity testing ⋮ Distance measures for biological sequences: some recent approaches ⋮ Sequence distance via parsing complexity: heartbeat signals ⋮ Universal codes as a basis for time series testing ⋮ Nonapproximability of the normalized information distance ⋮ Improved metaheuristics for the quartet method of hierarchical clustering ⋮ Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series ⋮ A copula entropy approach to correlation measurement at the country level ⋮ An exact algorithm for the minimum quartet tree cost problem ⋮ 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 ⋮ Artificial sequences and complexity measures ⋮ Mining Compressing Sequential Patterns ⋮ Summarizing and understanding large graphs ⋮ On universal transfer learning ⋮ On the Value of Multiple Read/Write Streams for Data Compression ⋮ Probing the quantum–classical boundary with compression software
This page was built for publication: Clustering by Compression
