34 search results - page 5 / 7 » Finding Data Broadness Via Generalized Nearest Neighbors |
101
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
81
Voted
CIKM
2008
Springer
15 years 10 days ago
2008
Springer
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
ICMLA
2009
14 years 8 months ago
2009
We propose methods to classify lines of military chat, or posts, which contain items of interest. We evaluated several current text categorization and feature selection methodologi...
COLT
2010
Springer
14 years 8 months ago
2010
Springer
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...