scholarly journals Query Learning Algorithm for Residual Symbolic Finite Automata

2019 ◽  
Vol 305 ◽  
pp. 140-153
Author(s):  
Kaizaburo Chubachi ◽  
Diptarama Hendrian ◽  
Ryo Yoshinaka ◽  
Ayumi Shinohara
Keyword(s):  
Learning Algorithm ◽  
Finite Automata ◽  
Query Learning

scholarly journals Abductive learning of quantized stochastic processes with probabilistic finite automata

2013 ◽  
Vol 371 (1984) ◽  
pp. 20110543 ◽  
Author(s):  
Ishanu Chattopadhyay ◽  
Hod Lipson
Keyword(s):  
Stochastic Processes ◽  
Learning Algorithm ◽  
Finite Automata ◽  
Causal Structure ◽  
Real Data ◽  
Stochastic Dynamical Systems ◽  
Modelling Framework ◽  
Performance Guarantees ◽  
Automated Inference ◽  
Finite State

We present an unsupervised learning algorithm ( GenESeSS ) to infer the causal structure of quantized stochastic processes, defined as stochastic dynamical systems evolving over discrete time, and producing quantized observations. Assuming ergodicity and stationarity, GenESeSS infers probabilistic finite state automata models from a sufficiently long observed trace. Our approach is abductive; attempting to infer a simple hypothesis, consistent with observations and modelling framework that essentially fixes the hypothesis class. The probabilistic automata we infer have no initial and terminal states, have no structural restrictions and are shown to be probably approximately correct-learnable. Additionally, we establish rigorous performance guarantees and data requirements, and show that GenESeSS correctly infers long-range dependencies. Modelling and prediction examples on simulated and real data establish relevance to automated inference of causal stochastic structures underlying complex physical phenomena.

scholarly journals Learning Nondeterministic Real-Time Automata

2021 ◽  
Vol 20 (5s) ◽  
pp. 1-26
Author(s):  
Jie An ◽  
Bohua Zhan ◽  
Naijun Zhan ◽  
Miaomiao Zhang
Keyword(s):  
Active Learning ◽  
Integrated Circuits ◽  
Real Time ◽  
Learning Algorithm ◽  
Timed Automata ◽  
Finite Automata ◽  
Special Kind ◽  
Learning Problem ◽  
Equivalence Queries

We present an active learning algorithm named NRTALearning for nondeterministic real-time automata (NRTAs). Real-time automata (RTAs) are a subclass of timed automata with only one clock which resets at each transition. First, we prove the corresponding Myhill-Nerode theorem for real-time languages. Then we show that there exists a unique minimal deterministic real-time automaton (DRTA) recognizing a given real-time language, but the same does not hold for NRTAs. We thus define a special kind of NRTAs, named residual real-time automata (RRTAs), and prove that there exists a minimal RRTA to recognize any given real-time language. This transforms the learning problem of NRTAs to the learning problem of RRTAs. After describing the learning algorithm in detail, we prove its correctness and polynomial complexity. In addition, based on the corresponding Myhill-Nerode theorem, we extend the existing active learning algorithm NL* for nondeterministic finite automata to learn RRTAs. We evaluate and compare the two algorithms on two benchmarks consisting of randomly generated NRTAs and rational regular expressions. The results show that NRTALearning generally performs fewer membership queries and more equivalence queries than the extended NL* algorithm, and the learnt NRTAs have much fewer locations than the corresponding minimal DRTAs. We also conduct a case study using a model of scheduling of final testing of integrated circuits.

scholarly journals Property Checking with Interpretable Error Characterization for Recurrent Neural Networks

2021 ◽  
Vol 3 (1) ◽  
pp. 205-227
Author(s):  
Franz Mayr ◽  
Sergio Yovine ◽  
Ramiro Visca
Keyword(s):  
Neural Networks ◽  
Recurrent Neural Networks ◽  
Learning Algorithm ◽  
Finite Automata ◽  
Specific Property ◽  
Black Box ◽  
Error Characterization ◽  
Property Specification ◽  
Probably Approximately Correct

This paper presents a novel on-the-fly, black-box, property-checking through learning approach as a means for verifying requirements of recurrent neural networks (RNN) in the context of sequence classification. Our technique steps on a tool for learning probably approximately correct (PAC) deterministic finite automata (DFA). The sequence classifier inside the black-box consists of a Boolean combination of several components, including the RNN under analysis together with requirements to be checked, possibly modeled as RNN themselves. On one hand, if the output of the algorithm is an empty DFA, there is a proven upper bound (as a function of the algorithm parameters) on the probability of the language of the black-box to be nonempty. This implies the property probably holds on the RNN with probabilistic guarantees. On the other, if the DFA is nonempty, it is certain that the language of the black-box is nonempty. This entails the RNN does not satisfy the requirement for sure. In this case, the output automaton serves as an explicit and interpretable characterization of the error. Our approach does not rely on a specific property specification formalism and is capable of handling nonregular languages as well. Besides, it neither explicitly builds individual representations of any of the components of the black-box nor resorts to any external decision procedure for verification. This paper also improves previous theoretical results regarding the probabilistic guarantees of the underlying learning algorithm.

Machine Learning Algorithm to Predict Early Complications after Brain Tumor Surgery

2018 ◽  
Author(s):  
C.H.B. van Niftrik ◽  
F. van der Wouden ◽  
V. Staartjes ◽  
J. Fierstra ◽  
M. Stienen ◽  
...  
Keyword(s):  
Machine Learning ◽  
Brain Tumor ◽  
Learning Algorithm ◽  
Machine Learning Algorithm ◽  
Tumor Surgery ◽  
Early Complications ◽  
Brain Tumor Surgery

Design of English text-to-speech conversion algorithm based on machine learning

2020 ◽  
pp. 1-12
Author(s):  
Li Dongmei
Keyword(s):  
Machine Learning ◽  
Speech Synthesis ◽  
Feature Recognition ◽  
Learning Algorithm ◽  
Morphological Structure ◽  
English Text ◽  
Text To Speech ◽  
Part Of Speech ◽  
Modern Computer ◽  
Conversion Algorithm

English text-to-speech conversion is the key content of modern computer technology research. Its difficulty is that there are large errors in the conversion process of text-to-speech feature recognition, and it is difficult to apply the English text-to-speech conversion algorithm to the system. In order to improve the efficiency of the English text-to-speech conversion, based on the machine learning algorithm, after the original voice waveform is labeled with the pitch, this article modifies the rhythm through PSOLA, and uses the C4.5 algorithm to train a decision tree for judging pronunciation of polyphones. In order to evaluate the performance of pronunciation discrimination method based on part-of-speech rules and HMM-based prosody hierarchy prediction in speech synthesis systems, this study constructed a system model. In addition, the waveform stitching method and PSOLA are used to synthesize the sound. For words whose main stress cannot be discriminated by morphological structure, label learning can be done by machine learning methods. Finally, this study evaluates and analyzes the performance of the algorithm through control experiments. The results show that the algorithm proposed in this paper has good performance and has a certain practical effect.

Intelligent system of English composition scoring model based on improved machine learning algorithm

2020 ◽  
pp. 1-11
Author(s):  
Jie Liu ◽  
Lin Lin ◽  
Xiufang Liang
Keyword(s):  
Machine Learning ◽  
Evaluation System ◽  
Intelligent System ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Assessment System ◽  
English Composition ◽  
Region Extraction ◽  
Constraint Model

The online English teaching system has certain requirements for the intelligent scoring system, and the most difficult stage of intelligent scoring in the English test is to score the English composition through the intelligent model. In order to improve the intelligence of English composition scoring, based on machine learning algorithms, this study combines intelligent image recognition technology to improve machine learning algorithms, and proposes an improved MSER-based character candidate region extraction algorithm and a convolutional neural network-based pseudo-character region filtering algorithm. In addition, in order to verify whether the algorithm model proposed in this paper meets the requirements of the group text, that is, to verify the feasibility of the algorithm, the performance of the model proposed in this study is analyzed through design experiments. Moreover, the basic conditions for composition scoring are input into the model as a constraint model. The research results show that the algorithm proposed in this paper has a certain practical effect, and it can be applied to the English assessment system and the online assessment system of the homework evaluation system algorithm system.

Sign in / Sign up

Export Citation Format

Share Document