Using competitive learning between symbolic rules as a knowledge learning method

被引:0
|
作者
Hadzic, F. [1 ]
Dillon, T.S. [1 ]
机构
[1] Digital Ecosystems and Business Intelligence Institute, GPO Box U1987, Perth, Australia
关键词
Artificial intelligence;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a new knowledge learning method suitable for extracting symbolic rules from domains characterized by continuous domains. It uses the idea of competitive learning, symbolic rule reasoning and it integrates a statistical measure for relevance analysis during the learning process. The knowledge is in form of standard production rules which are available at any time during the learning process. The competition occurs among the rules for capturing a presented instance and the rules can undergo processes of merging, splitting, simplifying and deleting. Reasoning occurs at both higher level of abstraction and lower level of detail. The method is evaluated on publicly available real world datasets. © 2008, IFIP Advances in Information and Communication Technology.All right reserved.
引用
下载
收藏
页码:351 / 360
相关论文
共 50 条
  • [1] Using competitive learning between symbolic rules as a knowledge learning method
    Hadzic, F.
    Dillon, T. S.
    ARTIFICIAL INTELLIGENCE IN THEORY AND PRACTICE II, 2008, 276 : 351 - 360
  • [2] High order eigentensors as symbolic rules in competitive learning
    Lipson, H
    Siegelmann, HT
    HYBRID NEURAL SYSTEMS, 2000, 1778 : 286 - 297
  • [3] LEARNING VERBAL AND SYMBOLIC STATEMENTS OF MATHEMATICAL RULES
    SCANDURA, JM
    JOURNAL OF EDUCATIONAL PSYCHOLOGY, 1967, 58 (6P1) : 356 - &
  • [4] Integrating symbolic knowledge in reinforcement learning
    Hailu, G
    Sommer, G
    1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, 1998, : 1491 - 1496
  • [5] Learning Symbolic Rules over Abstract Meaning Representations for Textual Reinforcement Learning
    Chaudhury, Subhajit
    Swaminathan, Sarathkrishna
    Kimura, Daiki
    Sen, Prithviraj
    Murugesan, Keerthiram
    Uceda-Sosa, Rosario
    Tatsubori, Michiaki
    Fokoue, Achille
    Kapanipathi, Pavan
    Munawar, Asim
    Gray, Alexander
    PROCEEDINGS OF THE 61ST ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, ACL 2023, VOL 1, 2023, : 6764 - 6776
  • [6] Hierarchical Rules for Knowledge Representation and Learning
    Sakharov, Alexander
    2019 IEEE SECOND INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND KNOWLEDGE ENGINEERING (AIKE), 2019, : 167 - 171
  • [7] A machine learning method for extracting symbolic knowledge from recurrent neural networks
    Vahed, A
    Omlin, CW
    NEURAL COMPUTATION, 2004, 16 (01) : 59 - 71
  • [8] Rules extractions from banks' bankrupt data using connectionist and symbolic learning algorithms
    Martinelli, E
    de Carvalho, A
    Rezende, S
    Matias, A
    COMPUTATIONAL FINANCE 1999, 2000, : 515 - 533
  • [10] Improving Knowledge Graph Completion Using Soft Rules and Adversarial Learning
    TANG Caifang
    RAO Yuan
    YU Hualei
    SUN Ling
    CHENG Jiamin
    WANG Yutian
    Chinese Journal of Electronics, 2021, 30 (04) : 623 - 633