1492 search results - page 67 / 299 » Geometric Clustering Using the Information Bottleneck Method |
130
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Local Coordinate Coding (LCC), introduced in (Yu et al., 2009), is a high dimensional nonlinear learning method that explicitly takes advantage of the geometric structure of the d...
127
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
125
click to vote
ECIR
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents a new approach designed to reduce the computational load of the existing clustering algorithms by trimming down the documents size using fingerprinting methods...
147
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we introduce an incremental nested partition algorithm for finding the inner structuralization of dynamic datasets. Here we use three partition criteria that allow...