AN ALGORITHM FOR SEPARATING PATTERNS BY ELLIPSOIDS

被引：18

作者：

BARNES, ER

机构：

来源：

IBM JOURNAL OF RESEARCH AND DEVELOPMENT | 1982年 / 26卷 / 06期

关键词：

D O I：

10.1147/rd.266.0759

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

THE PAPER GIVES AN ALGORITHM FOR FINDING THE ELLIPSOID OF LEAST VOLUME CONTAINING A SET OF POINTS IN A FINITE-DIMENSIONAL EUCLIDEAN SPACE. SUCH ELLIPSOIDS HAVE BEEN PROPOSED FOR SEPARATING PATTERNS IN A FEATURE SPACE.

引用

页码：759 / 764

页数：6

共 6 条

[1] MINIMIZATION OF FUNCTIONS HAVING LIPSCHITZ CONTINUOUS FIRST PARTIAL DERIVATIVES [J].

ARMIJO, L .

PACIFIC JOURNAL OF MATHEMATICS, 1966, 16 (01) :1-&

[2]

Beckenback E. F., 1961, Inequalities

[3]

dEsopo D, 1959, Nav. Res. Log. Quarterly, V6, P33

[4] THE VARIATION OF THE SPECTRUM OF A NORMAL MATRIX [J].

HOFFMAN, AJ ;

WIELANDT, HW .

DUKE MATHEMATICAL JOURNAL, 1953, 20 (01) :37-39

[5]

MILLS HD, 1956, LINEAR INEQUALITIES

[6] PATTERN SEPARATION BY CONVEX PROGRAMMING [J].

ROSEN, JB .

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1965, 10 (01) :123-&

← 1 →