NEW LP BASED HEURISTICS FOR THE CLASSIFICATION PROBLEM

被引:29
|
作者
ABAD, PL
BANKS, WJ
机构
[1] WILFRID LAURIER UNIV, SCH BUSINESS & ECON, WATERLOO N2L 3C5, ONTARIO, CANADA
[2] MCMASTER UNIV, FAC BUSINESS, HAMILTON L8S 4M4, ON, CANADA
基金
加拿大自然科学与工程研究理事会;
关键词
LINEAR PROGRAMMING; DISCRIMINANT ANALYSIS; LINEAR STATISTICAL MODELS; STATISTICAL TECHNIQUES;
D O I
10.1016/0377-2217(93)90324-G
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Three heuristic procedures for the two group discriminant problem are developed that minimize the total expected cost of misclassification in the training sample. The approach is shown through a systematic experiment to generate near optimal solutions and to be efficient in terms of computational effort when compared to existing research.
引用
收藏
页码:88 / 100
页数:13
相关论文
共 50 条
  • [21] A new LP-based lower bound for the cumulative scheduling problem
    Carlier, J
    Néron, E
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 127 (02) : 363 - 382
  • [22] Two new heuristics for the dominating tree problem
    Singh, Kavita
    Sundar, Shyam
    APPLIED INTELLIGENCE, 2018, 48 (08) : 2247 - 2267
  • [23] New Heuristics for the Multidimensional Vote Assignment Problem
    P. Kleinschmidt
    C. Rank
    Computing, 1999, 63 : 405 - 417
  • [24] Two new heuristics for the dominating tree problem
    Kavita Singh
    Shyam Sundar
    Applied Intelligence, 2018, 48 : 2247 - 2267
  • [25] New heuristics for the Operating Room Planning Problem
    Molina-Pariente, Jose M.
    Framinan, Jose M.
    Perez-Gonzalez, Paz
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 1476 - 1485
  • [26] LP-based heuristics for the distinguishing string and substring selection problems
    Torres, Jean P. Tremeschin
    Hoshino, Edna A.
    ANNALS OF OPERATIONS RESEARCH, 2022, 316 (02) : 1205 - 1234
  • [27] LP-based heuristics for the distinguishing string and substring selection problems
    Jean P. Tremeschin Torres
    Edna A. Hoshino
    Annals of Operations Research, 2022, 316 : 1205 - 1234
  • [28] Genetic algorithm based heuristics for the mapping problem
    Chockalingam, T.
    Arunkumar, S.
    Computers and Operations Research, 1995, 22 (01): : 55 - 64
  • [29] Genetic algorithm based heuristics for the mapping problem
    Chockalingam, T.
    Arunkumar, S.
    Computers and Operations Research, 1994, 22 (01): : 55 - 64
  • [30] PARALLEL SAVINGS BASED HEURISTICS FOR THE DELIVERY PROBLEM
    ALTINKEMER, K
    GAVISH, B
    OPERATIONS RESEARCH, 1991, 39 (03) : 456 - 469