5046 search results - page 301 / 1010 » Non-redundant data clustering |
196
click to vote
DATESO
2010
15 years 4 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,...
178
Voted
IGARSS
2010
15 years 4 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 ...
195
Voted
MLDM
2007
Springer
16 years 27 days 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...
162
click to vote
IDA
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
188
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we study the application of sparse principal component analysis (PCA) to clustering and feature selection problems. Sparse PCA seeks sparse factors, or linear combi...