Sciweavers

24 search results - page 2 / 5
» Nearest Neighbours Search Using the PM-Tree
Sort
View
FOCS
2004
IEEE
13 years 9 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
ICPR
2004
IEEE
14 years 6 months ago
Optimizing Nearest Neighbour in Random Subspaces using a Multi-Objective Genetic Algorithm
In this work, the authors have evaluated almost 20 millions ensembles of classifiers generated by several methods. Trying to optimize those ensembles based on the nearest neighbou...
Guillaume Tremblay, Robert Sabourin, Patrick Maupi...
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
13 years 11 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
GECCO
2007
Springer
314views Optimization» more  GECCO 2007»
13 years 11 months ago
Variable selection for wind power prediction using particle swarm optimization
Wind energy has an increasing influence on the energy supply in many countries, but in contrast to conventional power plants it is a fluctuating energy source. For its integration...
René Jursa
ICANNGA
2009
Springer
173views Algorithms» more  ICANNGA 2009»
13 years 3 months ago
On Document Classification with Self-Organising Maps
Abstract This research deals with the use of self-organising maps for the classification of text documents. The aim was to classify documents to separate classes according to their...
Jyri Saarikoski, Kalervo Järvelin, Jorma Laur...