.png){kind=icon}
返回
A beam search algorithm for PFSA inference
.png){kind=icon}
PRE
AI
DOI：10.1007/BF01237940.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the past, many methods have been proposed for the inference of probabilistic and non-probabilistic finite state automata from positive examples of their behaviour. In this paper, we introduce a search method guided by the information-theoretic Minimum Message Length principle to infer Probabilistic Finite State Automata (PFSA).(1) The method is a beam search technique that searches for the best PFSA that accounts for a given dataset. Results of testing this method against some earlier algorithms are presented. A simulated annealing version of the beam search algorithm is also described as ongoing research in the area.
Keyword:
automata inference
information theory
search techniques
期刊
IF:
2
论文数:
1.9K
被引数:
1.9K
机构
暂无机构信息
引用论文
.png){kind=icon}
Fast crystallization of amorphous Gd2Zr2O7 induced by thermally activated electron-beam irradiation
OAAI
OAAI分享收藏分享收藏分享收藏分享收藏 没有更多内容
没有更多内容