首页> 外文会议> >Comparison of deterministic and fuzzy finite automata extraction methods from Jordan networks
【24h】

Comparison of deterministic and fuzzy finite automata extraction methods from Jordan networks

机译:Jordan网络中确定性和模糊有限自动机提取方法的比较

获取原文

摘要

This paper compares two methods for the extraction of finite state automata from recurrent neural networks (RNNs). Neural networks store the knowledge implicit in the data in their weights, but do not provide an easy explanation of this knowledge to the user. This is a difficult task due to the spatial (distributed information in the network) and temporal (network states) relations built by the network among the data. One form to present the knowledge stored inside a RNN is using finite state automata, which shows explicitly the relations among the variables and their temporal causality. In this paper, we treat the nonlinear dynamical system inverted pendulum and controller and compare the performance of the extraction algorithm using two clustering methods: k-means and fuzzy clustering in terms of exactness and knowledge conciseness.
机译:本文比较了从递归神经网络(RNN)提取有限状态自动机的两种方法。神经网络以权重的形式存储数据中隐含的知识,但没有向用户提供对此知识的简单解释。由于网络在数据之间建立的空间(网络中的分布信息)和时间(网络状态)关系,这是一项艰巨的任务。表示存储在RNN中的知识的一种形式是使用有限状态自动机,它可以明确显示变量之间的关系及其时间因果关系。在本文中,我们对非线性动力学系统倒立摆和控制器进行了处理,并从准确性和知识简洁性的角度使用了两种聚类方法(k均值和模糊聚类)比较了提取算法的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号