1839 search results - page 209 / 368 » Feature Selection in Clustering Problems |
172
click to vote
IJCNN
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
133
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
152
click to vote
EWCBR
2008
Springer
15 years 5 months ago
2008
Springer
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
127
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
146
click to vote
BMCBI
2004
15 years 3 months ago
2004
Background: It is a major challenge of computational biology to provide a comprehensive functional classification of all known proteins. Most existing methods seek recurrent patte...