135 search results - page 25 / 27 » High dimensional nearest neighbor searching |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...
PRICAI
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper reports our comparative evaluation of three machine learning methods on Chinese text categorization. Whereas a wide range of methods have been applied to Engli...
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
COMPGEOM
2010
ACM
14 years 19 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
BMCBI
2011
12 years 11 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...