Abstract. We approach the problem of measuring similarity between chromagrams and present two new quantized representations for the task. The first representation is a sequence of optimal transposition in-dex (OTI) values between the global chroma vector and each frame of the chromagram, whereas the second representation uses in similar fash-ion the global chroma of the query and frames of the target chroma-gram, thus emphasizing the mutual information of the chromagrams in the representation. The similarity between quantized representations is measured using normalized compression distance (NCD) as the similar-ity metric, and we experiment with a variant of k-medians algorithm, where the commonly used Euclidean distance has been replaced w...
Normalization before clustering is often needed for proximity indices, such as Euclidian distance, w...
This paper introduces a measure of similarity between two clusterings of the same dataset produced b...
This paper presents a new Similarity Based Agglomerative Clustering(SBAC) algorithm that works well ...
We present a new method for clustering based on compression. The method doesn't use subject-spe...
The need for the ability to cluster unknown data to better understand its relationship to know data ...
Data compression, data prediction, data classification, learning and data mining are all strictly re...
The normalized compression distance (NCD) is a similarity measure between a pair of finite objects b...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
A metric or distance function is a function which defines a distance between elements of a set. In c...
The K-means clustering algorithm is an old algorithm that has been intensely researched owing to its...
Clustering algorithms aim, by definition, at partitioning a given set of objects into a set of clust...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
Data compression, data prediction, data classification, learning and data mining are all facets of t...
Clustering is a process that groups data with respect to data similarity so that similar data take p...
Genomic sequences are usually compared using evolutionary distance, a procedure that implies the ali...
Normalization before clustering is often needed for proximity indices, such as Euclidian distance, w...
This paper introduces a measure of similarity between two clusterings of the same dataset produced b...
This paper presents a new Similarity Based Agglomerative Clustering(SBAC) algorithm that works well ...
We present a new method for clustering based on compression. The method doesn't use subject-spe...
The need for the ability to cluster unknown data to better understand its relationship to know data ...
Data compression, data prediction, data classification, learning and data mining are all strictly re...
The normalized compression distance (NCD) is a similarity measure between a pair of finite objects b...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
A metric or distance function is a function which defines a distance between elements of a set. In c...
The K-means clustering algorithm is an old algorithm that has been intensely researched owing to its...
Clustering algorithms aim, by definition, at partitioning a given set of objects into a set of clust...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
Data compression, data prediction, data classification, learning and data mining are all facets of t...
Clustering is a process that groups data with respect to data similarity so that similar data take p...
Genomic sequences are usually compared using evolutionary distance, a procedure that implies the ali...
Normalization before clustering is often needed for proximity indices, such as Euclidian distance, w...
This paper introduces a measure of similarity between two clusterings of the same dataset produced b...
This paper presents a new Similarity Based Agglomerative Clustering(SBAC) algorithm that works well ...