A Global Optimization Approach to Classification

被引:29
作者
Bagirov, Adil M. [1 ]
Rubinov, Alexander M. [1 ]
Yearwood, John [1 ]
机构
[1] Univ Ballarat, Sch Informat Technol & Math Sci, Ballarat, Vic 3353, Australia
关键词
classification; feature selection; cutting angle method; convex programming;
D O I
10.1023/A:1020911318981
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We reduce the classification problem to solving a global optimization problem and a method based on a combination of the cutting angle method and a local search is applied to the solution of this problem. The proposed method allows to solve classification problems for databases with an arbitrary number of classes. Numerical experiments have been carried out with databases of small to medium size. We present their results and provide comparisons of these results with those obtained by 29 different classification algorithms. The best performance overall was achieved with the global optimization method.
引用
收藏
页码:129 / 155
页数:27
相关论文
共 33 条
[1]  
ABELLO J, 2001, HDB MASSIVE DATASETS
[2]   Cutting angle methods in global optimization [J].
Andramonov, M ;
Rubinov, A ;
Glover, B .
APPLIED MATHEMATICS LETTERS, 1999, 12 (03) :95-100
[3]  
Bagirov A, 2001, Top Health Inf Manage, V22, P65
[4]  
Bagirov A., 1999, INVESTIGACAO OPERACI, V19, P75
[5]  
Bagirov A.M., 2001, ADV CONVEX ANAL GLOB, V54, P245
[6]  
Bagirov A.M., J GLOBAL OP IN PRESS
[7]  
BAGIROV AM, 1995, COMP MATH MATH PHYS+, V35, P403
[8]   Global minimization of increasing positively homogeneous functions over the unit simplex [J].
Bagirov, AM ;
Rubinov, AM .
ANNALS OF OPERATIONS RESEARCH, 2000, 98 (1-4) :171-187
[9]  
Bagirov AM, 2000, QUASIDIFFERENTIABILITY AND RELATED TOPICS, P33
[10]  
Bagirov AM, 1998, INDIAN J PURE AP MAT, V29, P19