Sciweavers

134 search results - page 22 / 27
» nn 2008
Sort
View
89
Voted
CSDA
2006
82views more  CSDA 2006»
15 years 14 days ago
Nearest neighbours in least-squares data imputation algorithms with different missing patterns
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
Ito Wasito, Boris Mirkin
100
Voted
KAIS
2008
79views more  KAIS 2008»
15 years 12 days ago
Top 10 algorithms in data mining
This paper presents the top 10 data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) in December 2006: C4.5, k-Means, SVM, Apriori, EM, Page...
Xindong Wu, Vipin Kumar, J. Ross Quinlan, Joydeep ...
78
Voted
IPL
2007
87views more  IPL 2007»
15 years 11 days ago
The forwarding indices of augmented cubes
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
Min Xu, Jun-Ming Xu
95
Voted
TIP
2008
154views more  TIP 2008»
15 years 11 days ago
Adaptive Local Linear Regression With Application to Printer Color Management
Abstract--Local learning methods, such as local linear regression and nearest neighbor classifiers, base estimates on nearby training samples, neighbors. Usually, the number of nei...
Maya R. Gupta, Eric K. Garcia, E. Chin
ICML
2008
IEEE
16 years 1 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar