The similarity metric Export

@misc{citeulike:910903, abstract = {A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new \"normalized information distance\", based on the noncomputable notion of Kolmogorov complexity, and show that it is in this class and it minorizes every computable distance in the class (that is, it is universal in that it discovers all computable similarities). We demonstrate that it is a metric and call it the similarity metric. This...}, author = {Li, M. and Chen, X. and Li, X. and Ma, B. and Vitanyi, P.}, citeulike-article-id = {910903}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.3346}, keywords = {clustering}, posted-at = {2009-03-20 15:01:11}, priority = {2}, title = {The similarity metric}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.3346}, year = {2003} }

TY - GEN ID - citeulike:910903 L3 - citeulike-article-id:910903 N2 - A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new "normalized information distance", based on the noncomputable notion of Kolmogorov complexity, and show that it is in this class and it minorizes every computable distance in the class (that is, it is universal in that it discovers all computable similarities). We demonstrate that it is a metric and call it the similarity metric. This... TI - The similarity metric KW - clustering AU - Li, M AU - Chen, X AU - Li, X AU - Ma, B AU - Vitanyi, P PY - 2003/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.3346 ER -