Sciweavers

241 search results - page 28 / 49
» Nearest Neighbor Discriminant Analysis
Sort
View
COMPGEOM
2005
ACM
13 years 9 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
ICML
2007
IEEE
14 years 8 months ago
Optimal dimensionality of metric space for classification
In many real-world applications, Euclidean distance in the original space is not good due to the curse of dimensionality. In this paper, we propose a new method, called Discrimina...
Wei Zhang, Xiangyang Xue, Zichen Sun, Yue-Fei Guo,...
ICPP
2006
IEEE
14 years 1 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
CVPR
2007
IEEE
14 years 9 months ago
Feature Extraction by Maximizing the Average Neighborhood Margin
A novel algorithm called Average Neighborhood Margin Maximization (ANMM) is proposed for supervised linear feature extraction. For each data point, ANMM aims at pulling the neighb...
Fei Wang, Changshui Zhang
BMCBI
2006
150views more  BMCBI 2006»
13 years 7 months ago
Instance-based concept learning from multiclass DNA microarray data
Background: Various statistical and machine learning methods have been successfully applied to the classification of DNA microarray data. Simple instance-based classifiers such as...
Daniel P. Berrar, Ian Bradbury, Werner Dubitzky