5733 search results - page 356 / 1147 » Clustering Categorical Data |
212
click to vote
NIPS
2004
15 years 9 months ago
2004
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkabl...
205
click to vote
JODS
2007
15 years 7 months ago
2007
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...
216
click to vote
DATESO
2010
15 years 5 months ago
2010
Abstract. The high dimensionality of the data generated by social networks has been a big challenge for researchers. In order to solve the problems associated with this phenomenon,...
196
click to vote
IGARSS
2010
15 years 5 months ago
2010
In this paper, we develop a new spatial preprocessing strategy which can be applied prior to a spectral-based endmember extraction process for unmixing of hyperspectral data. Our ...
225
click to vote
MLDM
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...