78 search results - page 4 / 16 » High Performance Data Mining Using the Nearest Neighbor Join |
119
Voted
ICPR
2002
IEEE
16 years 3 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...
118
Voted
ADMA
2005
Springer
15 years 8 months 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...
106
Voted
ALGORITHMICA
1999
15 years 2 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 ...
157
Voted
SDM
2012
SIAM
13 years 5 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...
119
Voted
BMCBI
2007
15 years 2 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...