THE CONVERGENT METHOD OF CONSTRUCTING POLYNOMIAL DISCRIMINANT FUNCTIONS FOR PATTERN-RECOGNITION

被引：2

作者：

FLASINSKI, M ^{[1
]}

LEWICKI, G ^{[1
]}

机构：

[1] JAGIELLONIAN UNIV, INST MATH, PL-30059 KRAKOW, POLAND

来源：

PATTERN RECOGNITION | 1991年 / 24卷 / 10期

关键词：

DISCRIMINANT FUNCTIONS; UNIFORM CONVERGENCE; NONLINEARLY SEPARABLE SETS;

D O I：

10.1016/0031-3203(91)90098-P

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The methodology of defining polynomial discriminant functions in a constructive way is presented. Discriminant functions should be defined in such a way that they fulfil assumptions of Bernstein's theorem. It allows us both to prove a uniform convergence of the method and to estimate a rate of convergence of the interpolating process.

引用

页码：1009 / 1015

页数：7

共 17 条

[1]

AISERMAN MA, 1970, POTENTIAL FUNCTION M

[2]

BASHKIROV DA, 1964, AUTOMAT REM CONTR, V25, P629

[3]

Bernstein S. N., 1952, COLLECTED WORKS, V1

[4] PROOF OF THE CONJECTURES OF BERNSTEIN AND ERDOS CONCERNING THE OPTIMAL NODES FOR POLYNOMIAL INTERPOLATION [J].

BOOR, CD ;

PINKUS, A .

JOURNAL OF APPROXIMATION THEORY, 1978, 24 (04) :289-303

[5]

CHENEY EW, 1970, 1969 P S LANC LOND, P261

[6]

CHENEY EW, 1985, LECTURE NOTES MATH, V1169

[7]

COVER TM, 1980, TOPICS STATISTICAL P

[8]

FU KS, 1980, DIGITAL PATTERN RECO

[9] AN ALGORITHM FOR LINEAR INEQUALITIES AND ITS APPLICATIONS [J].

HO, YC ;

KASHYAP, RL .

IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1965, EC14 (05) :683-&

[10] CHARACTERIZATION OF THE LAGRANGE INTERPOLATING PROJECTION WITH MINIMAL TCHEBYCHEFF NORM [J].

KILGORE, TA .

JOURNAL OF APPROXIMATION THEORY, 1978, 24 (04) :273-288

← 1 2 →