220 search results - page 23 / 44 » A Pseudo-Metric for Weighted Point Sets |
WAIM
2009
Springer
14 years 1 months ago
2009
Springer
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
A measure of stability for a wide class of pattern recognition algorithms is introduced to cope with overfitting in classification problems. Based on this concept, constructive me...
MCS
2000
Springer
14 years 1 days ago
2000
Springer
Ensemble methods are learning algorithms that construct a set of classi ers and then classify new data points by taking a (weighted) vote of their predictions. The original ensembl...
GMP
2006
IEEE
14 years 2 months ago
2006
IEEE
A well-documented problem of Catmull and Clark subdivision is that, in the neighborhood of extraordinary point, the curvature is unbounded and fluctuates. In fact, since one of th...