Dynamic selection approaches for multiple classifier systems

被引:86
作者
Cavalin, Paulo R. [1 ]
Sabourin, Robert [2 ]
Suen, Ching Y. [3 ]
机构
[1] UFT, BR-77001090 Palmas, TO, Brazil
[2] ETS, Montreal, PQ H3C 1K3, Canada
[3] Concordia Univ, Ctr Pattern Recognit & Machine Intelligence CENPA, Montreal, PQ H3G 1M8, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Multiple classifier systems; Adaptive system; Dynamic selection; Incremental learning; Multistage organizations; Ensembles of classifiers; ACCURACY; COMBINATION; ALGORITHMS; ENSEMBLE; LIMITS;
D O I
10.1007/s00521-011-0737-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we propose a new approach for dynamic selection of ensembles of classifiers. Based on the concept named multistage organizations, the main objective of which is to define a multi-layer fusion function adapted to each recognition problem, we propose dynamic multistage organization (DMO), which defines the best multistage structure for each test sample. By extending Dos Santos et al.'s approach, we propose two implementations for DMO, namely DSA (m) and DSA (c) . While the former considers a set of dynamic selection functions to generalize a DMO structure, the latter considers contextual information, represented by the output profiles computed from the validation dataset, to conduct this task. The experimental evaluation, considering both small and large datasets, demonstrated that DSA (c) dominated DSA (m) on most problems, showing that the use of contextual information can reach better performance than other existing methods. In addition, the performance of DSA (c) can also be enhanced in incremental learning. However, the most important observation, supported by additional experiments, is that dynamic selection is generally preferred over static approaches when the recognition problem presents a high level of uncertainty.
引用
收藏
页码:673 / 688
页数:16
相关论文
共 25 条
  • [1] [Anonymous], 2006, 10 INT WORKSH FRONT
  • [2] Brown G., 2005, Information Fusion, V6, P5, DOI 10.1016/j.inffus.2004.04.004
  • [3] Cui B., 2003, PROC ACM SIGMOD INT, P479, DOI [10.1145/872757.872815, DOI 10.1145/872757.872815]
  • [4] A dynamic overproduce-and-choose strategy for the selection of classifier ensembles
    Dos Santos, Eulanda M.
    Sabourin, Robert
    Maupin, Patrick
    [J]. PATTERN RECOGNITION, 2008, 41 (10) : 2993 - 3009
  • [5] Dos Santos EM, 2006, IEEE IJCNN, P3070
  • [6] Dynamic classifier selection based on multiple classifier behaviour
    Giacinto, G
    Roli, F
    [J]. PATTERN RECOGNITION, 2001, 34 (09) : 1879 - 1881
  • [7] Hansen L. K., 1997, Open Systems & Information Dynamics, V4, P159, DOI 10.1023/A:1009643503022
  • [8] Ho TK, 1998, IEEE T PATTERN ANAL, V20, P832, DOI 10.1109/34.709601
  • [9] From dynamic classifier selection to dynamic ensemble selection
    Ko, Albert H. R.
    Sabourin, Robert
    Britto, Alceu Souza, Jr.
    [J]. PATTERN RECOGNITION, 2008, 41 (05) : 1718 - 1731
  • [10] Limits on the majority vote accuracy in classifier fusion
    Kuncheva, LI
    Whitaker, CJ
    Shipp, CA
    Duin, RPW
    [J]. PATTERN ANALYSIS AND APPLICATIONS, 2003, 6 (01) : 22 - 31