2260 search results - page 78 / 452 » A new algorithm for clustering search results |
213
click to vote
ICMLA
2004
15 years 7 months ago
2004
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
161
click to vote
MLDM
2005
Springer
15 years 11 months ago
2005
Springer
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with...
159
click to vote
ISMIS
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...
142
click to vote
ICIP
1998
IEEE
16 years 7 months ago
1998
IEEE
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
156
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Genetic Algorithms (GAs) have been known to be robust for search and optimization problems. Image registration can take advantage of the robustness of GAs in finding best transform...