Searching for "Normalized Information Distance" – sorted by Relevance.
-
R.: Genre classification via an lz78-based string kernel
- of normalized information distance (NID) [7] into a kernel distance suitable for use with a Support Vector
- Cited by 5 (0 self) – Add To MetaCart
-
Algorithms for Estimating Information Distance with Application to Bioinformatics and Linguistics
- Abstract After reviewing unnormalized and normalized information distances based on incomputable notions
- Cited by 6 (0 self) – Add To MetaCart
-
The Similarity Metric
- of similarity per distance, is studied. We propose a new “normalized information distance”, based
- Cited by 90 (9 self) – Add To MetaCart
-
Clustering by compression
- of similarity per distance, and vice versa. It wasshown that an appropriately “normalized” information distance
- Cited by 65 (8 self) – Add To MetaCart
-
Contextual Information Retrieval based on Algorithmic Information Theory and Statistical Outlier
- Distance. This distance has been used as a feasible approximation of the Normalized Information Distance
- Add To MetaCart
-
Algorithmic clustering of music
- was proposed: their “normalized information distance” is a metric, and is universal in the sense
- Cited by 8 (1 self) – Add To MetaCart
-
unknown title
- . The "normalized information distance", based on the noncomputable notion of Kolmogorov complexity is shown
- Add To MetaCart
-
Similarity Distance and Phylogeny
- of similarity measures; show that among them the \normalized information distance" is a metric, and prove
- Cited by 1 (1 self) – Add To MetaCart
-
Similarity of objects and the meaning of words
- , then they are also close according to the normalized information distance. Put differently, the normalized
- Cited by 1 (0 self) – Add To MetaCart
-
Automatic Extraction of Meaning from the Web
- , and vice versa. It was shown that an appropriately “normalized” information distance minorizes every
- Cited by 1 (1 self) – Add To MetaCart

