APS: agent's learning with imperfect recall

D. Dudek, Michal Kubisz, Aleksander Zgrzywa
{"title":"APS: agent's learning with imperfect recall","authors":"D. Dudek, Michal Kubisz, Aleksander Zgrzywa","doi":"10.1109/ISDA.2005.26","DOIUrl":null,"url":null,"abstract":"We present a new method of incremental, statistical learning, which is suitable for knowledge-based systems, especially software agents. The method is based on the imperfect recall assumption, according to which an agent does not store all the past observations. However it does preserve general rules concerning the past, that can be potentially useful for improving agent's action. During its performance an agent stores observations in the history. When system resources are idle and the size of the history is sufficient as for its statistical significance, the stored facts are analysed by means of data mining techniques, and disposed afterwards. The discovered rules are combined with the former rule base, so that the final rule set is approximately the same, as if it was obtained on the whole history.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISDA.2005.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

We present a new method of incremental, statistical learning, which is suitable for knowledge-based systems, especially software agents. The method is based on the imperfect recall assumption, according to which an agent does not store all the past observations. However it does preserve general rules concerning the past, that can be potentially useful for improving agent's action. During its performance an agent stores observations in the history. When system resources are idle and the size of the history is sufficient as for its statistical significance, the stored facts are analysed by means of data mining techniques, and disposed afterwards. The discovered rules are combined with the former rule base, so that the final rule set is approximately the same, as if it was obtained on the whole history.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
APS:不完全回忆下的agent学习
我们提出了一种新的增量式统计学习方法,它适用于基于知识的系统,特别是软件代理。该方法基于不完全召回假设,根据该假设,智能体不会存储所有过去的观察结果。然而,它确实保留了关于过去的一般规则,这可能对改进代理的行为有潜在的帮助。在执行过程中,代理将观察结果存储在历史记录中。当系统资源处于空闲状态,且历史数据具有足够的统计意义时,利用数据挖掘技术对存储的事实进行分析,并进行处理。发现的规则与先前的规则库相结合,因此最终的规则集大致相同,就好像它是在整个历史中获得的一样。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Distributed service-oriented architecture for information extraction system "Semanta" HAUNT-24: 24-bit hierarchical, application-confined unique naming technique The verification's criterion of learning algorithm New evolutionary approach to the GCP: a premature convergence and an evolution process character A summary-attainment-surface plotting method for visualizing the performance of stochastic multiobjective optimizers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1