1971 search results - page 151 / 395 » A clustering method that uses lossy aggregation of data |
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
ICDM
2010
IEEE
13 years 7 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
Supervoxel segmentation has strong potential to be incorporated into early video analysis as superpixel segmentation has in image analysis. However, there are many plausible super...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...