Search Results for author:
Found 8 papers, 2 papers with code
Identification of Probabilities
But there is a more fundamental question: is the problem of inferring a probabilistic model from a sample possible even in principle?
Web Similarity in Sets of Search Terms using Database Queries
Normalized web distance (NWD) is a similarity or normalized semantic distance based on the World Wide Web or another large electronic database, for instance Wikipedia, and a search engine that returns reliable aggregate page counts.
A Fast Quartet Tree Heuristic for Hierarchical Clustering
We also present a greatly improved heuristic, reducing the running time by a factor of order a thousand to ten thousand.
Algorithmic Identification of Probabilities
TThe problem is to identify a probability associated with a set of natural numbers, given an infinite data sequence of elements from the set.
Normalized Compression Distance of Multisets with Applications
We also applied the new NCD to handwritten digit recognition and improved classification accuracy significantly over that of pairwise NCD by incorporating both the pairwise and NCD for multisets.
Identification of Probabilities of Languages
There is an effective procedure to identify by infinite recurrence a nonempty subset of the computable measures according to which the data is typical.
Normalized Information Distance
These practical realizations of the normalized information distance can then be applied to machine learning tasks, expecially clustering, to perform feature-free and parameter-free data mining.
The Google Similarity Distance
We conduct a massive randomized trial in binary classification using support vector machines to learn categories based on our Google distance, resulting in an a mean agreement of 87% with the expert crafted WordNet categories.
