Topics
vector processingOrganisation
This paper proposes to use compression-based similarity measures to cluster spectral signatures on the basis of their similarities. Such universal distances estimate the shared information between two objects by comparing their compression factors, which can be obtained by any standard compressor. Experiments on rocks categorization show that these methods may outperform traditional choices for spectral distances based on vector processing
Spectral clustering is a powerful method for finding structure in a dataset through the eigenvectors...
In this work a new compression method for multispectral images has been proposed: the ‘colorimetric–...
This paper introduces the Spectral Clustering Equivalence(SCE) algorithm which is intended to be an ...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
We present a new method for clustering based on compression. The method doesn't use subject-spe...
Abstract : This work is concerned with the development and application of novel unsupervised learnin...
In cluster analysis, data are clustered into meaningful groups so that the objects in the same group...
We present a new method for clustering based on compression. The method doesn’t use subject-specific...
We present a new method for spectral clustering with paired data based on kernel canonical correlati...
We present a new method for spectral clustering with paired data based on kernel canonical correlati...
We present a new similarity measure based on information theoretic measures which is superior than N...
Abstract—Spectral clustering is a powerful tool for unsupervised data analysis. In this paper, we pr...
Spectral clustering is a powerful method for finding structure in a dataset through the eigenvectors...
In this work a new compression method for multispectral images has been proposed: the ‘colorimetric–...
This paper introduces the Spectral Clustering Equivalence(SCE) algorithm which is intended to be an ...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
We present a new method for clustering based on compression. The method doesn't use subject-spe...
Abstract : This work is concerned with the development and application of novel unsupervised learnin...
In cluster analysis, data are clustered into meaningful groups so that the objects in the same group...
We present a new method for clustering based on compression. The method doesn’t use subject-specific...
We present a new method for spectral clustering with paired data based on kernel canonical correlati...
We present a new method for spectral clustering with paired data based on kernel canonical correlati...
We present a new similarity measure based on information theoretic measures which is superior than N...
Abstract—Spectral clustering is a powerful tool for unsupervised data analysis. In this paper, we pr...
Spectral clustering is a powerful method for finding structure in a dataset through the eigenvectors...
In this work a new compression method for multispectral images has been proposed: the ‘colorimetric–...
This paper introduces the Spectral Clustering Equivalence(SCE) algorithm which is intended to be an ...
Add to ORKG