894 search results - page 22 / 179 » Learning to cluster using local neighborhood structure |
DEXAW
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
101
click to vote
PR
2006
14 years 9 months ago
2006
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
88
Voted
ICDM
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we propose a novel technique for the efficient prediction of multiple continuous target variables from high-dimensional and heterogeneous data sets using a hierarch...
76
Voted
NN
2006
Springer
14 years 9 months ago
2006
Springer
This paper presents an on-line unsupervised learning mechanism for unlabeled data that are polluted by noise. Using a similarity thresholdbased and a local error-based insertion c...
IJON
2010
14 years 8 months ago
2010
Due to the tremendous increase of electronic information with respect to the size of data sets as well as their dimension, dimension reduction and visualization of high-dimensiona...