Sciweavers

325 search results - page 26 / 65
» Group Nearest Neighbor Queries
Sort
View
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
14 years 4 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
ICCBR
1997
Springer
14 years 2 months ago
Examining Locally Varying Weights for Nearest Neighbor Algorithms
Previous work on feature weighting for case-based learning algorithms has tended to use either global weights or weights that vary over extremely local regions of the case space. T...
Nicholas Howe, Claire Cardie
ICML
2006
IEEE
14 years 6 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
DEXA
2003
Springer
193views Database» more  DEXA 2003»
14 years 3 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
JCIT
2010
148views more  JCIT 2010»
13 years 4 months ago
Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers
Probability theory is the framework for making decision under uncertainty. In classification, Bayes' rule is used to calculate the probabilities of the classes and it is a bi...
Mohammed J. Islam, Q. M. Jonathan Wu, Majid Ahmadi...