78 search results - page 4 / 16 » High Performance Data Mining Using the Nearest Neighbor Join |
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions due to the curse-ofdimensionality. Sev...
ADMA
2005
Springer
14 years 29 days ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
ALGORITHMICA
1999
13 years 7 months ago
1999
We analyze the performance of the popular class of neighbor-joining methods of phylogeny reconstruction. In particular, we find conditions under which these methods will determine ...
SDM
2012
SIAM
11 years 9 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
BMCBI
2007
13 years 7 months ago
2007
Background: The availability of microarrays measuring thousands of genes simultaneously across hundreds of biological conditions represents an opportunity to understand both indiv...