The Similarity Metric

From MaRDI portal
Revision as of 01:05, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3547244

DOI10.1109/TIT.2004.838101zbMath1316.68052WikidataQ60362745 ScholiaQ60362745MaRDI QIDQ3547244

Xin Chen, Bin Ma, Paul M. B. Vitányi, Xin Li, Ming Li

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)




Related Items (58)

Exploring programmable self-assembly in non-DNA based molecular computingQuantum information distanceThe Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transformSequence similarity measures based on bounded Hamming distanceMusic genre classification using MIDI and audio featuresKolmogorov Complexity-Based Similarity Measures to Website Classification Problems: Leveraging Normalized Compression DistanceUsing data compressors to construct order tests for homogeneity and component independenceOpposition-Based ComputingA parametrized family of Tversky metrics connecting the Jaccard distance to an analogue of the normalized information distanceSublinear algorithms for approximating string compressibilityPhenomenology of coupled nonlinear oscillatorsClustering with respect to the information distanceRecovering networks from distance dataA philosophical treatise of universal inductionLempel-Ziv complexity analysis of one dimensional cellular automataHierarchical clustering of text documentsINFORMATION DISTANCE AND ITS APPLICATIONSA fast quartet tree heuristic for hierarchical clusteringSimilarity and denoisingImage comparison by compound disjoint information with applications to perceptual visual quality assessment, image registration and trackingCorrelation and collective behaviour in Adler-type locally coupled oscillators at the edge of chaosInjective optimal realizations of finite metric spacesGenerative models for similarity-based classificationUsing ideas of Kolmogorov complexity for studying biological textsNotes on sum-tests and independence testsA \textit{really} simple approximation of smallest grammarAlignments of mitochondrial genome arrangements: applications to metazoan phylogenyA new multiword expression metric and its applicationsOn Universal Transfer LearningComputational capabilities at the edge of chaos for one dimensional systems undergoing continuous transitionsDetecting life signatures with RNA sequence similarity measuresA review on distance based time series classificationA new class of metrics for learning on real-valued and structured dataTextual data compression in computational biology: algorithmic techniquesNormalized information-based divergencesAlgorithmic relative complexityRelative entropy via non-sequential recursive pair substitutionAn extension of the Burrows-Wheeler transformInformation-theoretic method for classification of textsDistance spectra of graphs: a surveyAn automatic and parameter-free information-based method for sparse representation in wavelet basesA new combinatorial approach to sequence comparisonCompression-based distance between string data and its application to literary work classification based on authorshipDistance measures for biological sequences: some recent approachesNonapproximability of the normalized information distanceGrammar-based compression and its use in symbolic music analysisApplication of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time seriesDynamical criticality: overview and open questionsThe subsequence composition of a stringDepth as randomness deficiencyThe metric cutpoint partition problemExpanding the algorithmic information theory frame for applications to Earth observationArtificial sequences and complexity measuresNormalized information distance and the oscillation hierarchyOn universal transfer learningOn the similarity metric and the distance metricA new quartet approach for reconstructing phylogenetic trees: Quartet joining methodProbing the quantum–classical boundary with compression software







This page was built for publication: The Similarity Metric