A combinatorial approach to the classification problem

被引:20
|
作者
Yanev, N [1 ]
Balev, S [1 ]
机构
[1] Univ Sofia, Fac Math & Informat, BU-1126 Sofia, Bulgaria
关键词
classification problem; branch and bound; heuristics;
D O I
10.1016/S0377-2217(98)00229-X
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We study the two-group classification problem which involves classifying an observation into one of two groups based on its attributes. The classification rule is a hyperplane which misclassifies the fewest number of observations in the training sample. Exact and heuristic algorithms for solving the problem are presented. Computational results confirm the efficiency of this approach. (C) 1999 Elsevier Science B.V. AU rights reserved.
引用
收藏
页码:339 / 350
页数:12
相关论文
共 50 条