Learning Analysis by Reduction from Positive Data Using Reversible Languages

被引:0
|
作者
Hoffmann, Petr [1 ]
机构
[1] Charles Univ Prague, Fac Math & Phys, Dept Software & Comp Sci Educ, Prague 11800 1, Czech Republic
关键词
D O I
10.1109/ICMLA.2008.105
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The analysis by reduction [6, 7, 11] is a method for checking correctness of a sentence from a natural language. To model the analysis by reduction so-called restarting automata can be used. We propose a method for learning a special kind of restarting automata called single zero-reversible restarting automata (S-ZR-RRWW-automata). Interesting learning results achieved by using our implementation of the method are given. In addition the power of the model is investigated.
引用
收藏
页码:141 / 146
页数:6
相关论文
共 50 条
  • [41] Learning from Positive and Unlabeled Data with Arbitrary Positive Shift
    Hammoudeh, Zayd
    Lowd, Daniel
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [42] Cluster Analysis of Functional Neuroimages Using Data Reduction and Competitive Learning Algorithms
    Vergani, Alberto A.
    Martinelli, Samuele
    Binaghi, Elisabetta
    VIPIMAGE 2017, 2018, 27 : 62 - 71
  • [43] Analysis of dimensionality reduction techniques on Internet of Things data using machine learning
    Rashid, Lubaba
    Rubab, Saddaf
    Alhaisoni, Majed
    Alqahtani, Abdullah
    Alsubai, Shtwai
    Binbusayyis, Adel
    Bukhari, Syed Ahmad Chan
    SUSTAINABLE ENERGY TECHNOLOGIES AND ASSESSMENTS, 2022, 52
  • [44] Optimal language learning from positive data
    Case, John
    Moelius, Samuel E., III
    INFORMATION AND COMPUTATION, 2011, 209 (10) : 1293 - 1311
  • [45] Iterative learning from positive data and counters
    Koetzing, Timo
    THEORETICAL COMPUTER SCIENCE, 2014, 519 : 155 - 169
  • [46] Learning from positive and unlabeled data: a survey
    Bekker, Jessa
    Davis, Jesse
    MACHINE LEARNING, 2020, 109 (04) : 719 - 760
  • [47] Iterative Learning from Positive Data and Counters
    Koetzing, Timo
    ALGORITHMIC LEARNING THEORY, 2011, 6925 : 40 - 54
  • [48] Exact learning of regular pattern languages from one positive example using a linear number of membership queries
    Matsumoto, Satoshi
    Uchida, Tomoyuki
    Shoudai, Takayoshi
    Suzuki, Yusuke
    Miyahara, Tetsuhiro
    Lecture Notes in Engineering and Computer Science, 2019, 2239 : 204 - 209
  • [49] Incremental learning of approximations from positive data
    Grieser, G
    Lange, S
    INFORMATION PROCESSING LETTERS, 2004, 89 (01) : 37 - 42
  • [50] Learning from positive and unlabeled data: a survey
    Jessa Bekker
    Jesse Davis
    Machine Learning, 2020, 109 : 719 - 760