Pruning fuzzy ARTMAP using the minimum description length principle in learning from clinical databases

被引:3
|
作者
Lin, TH
Soo, VW
机构
来源
NINTH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS | 1997年
关键词
D O I
10.1109/TAI.1997.632281
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Fuzzy ARTMAP is one of the families of the neural network architectures bused on ART(Adaptive Resonance Theory) in which supervised learning carl be carried out. However, it usually tends to create more categories than are actually needed. This often causes the so called overfitting problem, namely the performance of the networks in test set is not monotonically increasing with the additional training epochs and category creation, for fuzzy ARTMAP. In order to avoid the overfitting problem, Carpenter and Tan [Carpenter and Tan, 1993] proposed tr confidence-based pruning method by eliminating those categories that were either less useful or less accurate. This paper purposes yet another-alternative pruning method that is based on the Minimal Description Length (MDL) principle. The MDL principle can be viewed as a tradeoff between theory complexity and data prediction accuracy given the theory. We adopted Cameron-Jones' error encoding scheme and Quinlan's modifier for theory encoding to estimate the fuzzy ARTMAP theory description length. A greedy search algorithm of the minimum description length to prune the fuzzy ARTMAP categories one by one is proposed. The experiments showed that fuzzy ARTMAP pinned with the MDL principle Save better performance with far fewer categories created than the original fuzzy ARTMAP and other machine learning systems on a number of benchmark clinical databases such as heart disease, breath cancer and diabetes databases.
引用
收藏
页码:396 / 403
页数:8
相关论文
共 50 条
  • [1] Incremental Learning with the Minimum Description Length Principle
    Murena, Pierre-Alexandre
    Cornuejols, Antoine
    Dessalles, Jean-Louis
    2017 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2017, : 1908 - 1915
  • [2] Discovering nonlinear-integral networks from databases using evolutionary computation and Minimum Description Length principle
    Leung, KS
    Wong, ML
    Lam, W
    Wang, ZY
    1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, 1998, : 2354 - 2359
  • [3] Minimum Description Length Principle for Compositional Model Learning
    Jirousek, Radim
    Krejcova, Iva
    INTEGRATED UNCERTAINTY IN KNOWLEDGE MODELLING AND DECISION MAKING, IUKM 2015, 2015, 9376 : 254 - 266
  • [4] Model selection using the minimum description length principle
    Bryant, PG
    Cordero-Braña, OI
    AMERICAN STATISTICIAN, 2000, 54 (04): : 257 - 268
  • [5] Minimum Description Length Principle in Supervised Learning With Application to Lasso
    Kawakita, Masanori
    Takeuchi, Jun'ichi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (07) : 4245 - 4269
  • [6] Practical uses of the minimum description length principle in inductive learning
    1995, Austrian Soc for Artificial Intelligence, Vienna, Austria (13): : 3 - 4
  • [7] Introducing the minimum description length principle
    Grünwald, P
    ADVANCES IN MINIMUM DESCRIPTION LENGTH THEORY AND APPLICATIONS, 2005, : 3 - 21
  • [8] A minimum description length principle for perception
    Chater, N
    ADVANCES IN MINIMUM DESCRIPTION LENGTH THEORY AND APPLICATIONS, 2005, : 385 - 409
  • [9] INFERRING DECISION TREES USING THE MINIMUM DESCRIPTION LENGTH PRINCIPLE
    QUINLAN, JR
    RIVEST, RL
    INFORMATION AND COMPUTATION, 1989, 80 (03) : 227 - 248
  • [10] Regression spline smoothing using the minimum description length principle
    Lee, TCM
    STATISTICS & PROBABILITY LETTERS, 2000, 48 (01) : 71 - 82