Local polynomial metrics for K nearest neighbor classifiers

被引：0

作者：

Snapp, RR ^{[1
]}

机构：

[1] Univ Vermont, Dept Comp Sci, Burlington, VT 05405 USA

来源：

UNCERTAINTY IN GEOMETRIC COMPUTATIONS | 2002年 / 704卷

关键词：

k-nearest-neighbor classifier; local polynomial model; metric; pattern recognition;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：155 / 164

页数：10

共 10 条

[1]

BERTSEKAS DP, 1995, NONLINEAR PROGRAMMIN

[2]

Blake C.L., 1998, UCI repository of machine learning databases

[3]

FAN J, 1996, LCOAL POLYNOMIAL MOD

[4]

Fix E., 1951, DISCRIMINATORY ANAL

[5]

Friedman JeromeH., 1994, FLEXIBLE METRIC NEAR

[6]

Hart, 2006, PATTERN CLASSIFICATI

[7] Discriminant adaptive nearest neighbor classification [J].

Hastie, T ;

Tibshirani, R .

[8]

Ripley B. D., 1996, Pattern Recognition and Neural Networks

[9]

Simard Patrice, 1993, Advances in Neural Information Processing Systems

[10]

Snapp RR, 1998, ANN STAT, V26, P850