2311 search results - page 138 / 463 » Robustness and Generalization |
134
Voted
NIPS
2003
15 years 6 months ago
2003
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
138
Voted
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
This article presents a robust EDA for global optimization with real parameters. The approach is based on the linear combination of individuals of two populations. One is the curr...
147
Voted
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Extracting natural groups of the unlabeled data is known as clustering. To improve the stability and robustness of the clustering outputs, clustering ensembles have emerged recent...
141
click to vote
IJIS
2007
15 years 4 months ago
2007
Algorithms for clustering web search results have to be efficient and robust. Furthermore they must be able to cluster a dataset without using any kind of a priori information, s...
129
Voted
CG
2002
Springer
15 years 4 months ago
2002
Springer
A current challenge in augmented reality applications is the accurate superimposition of synthetic objects on real objects within the environment. This challenge is heightened whe...