利用频繁模式挖掘改进基于netfeaturemap的表示

V. Duarte, Rita Maria Silva Julia
{"title":"利用频繁模式挖掘改进基于netfeaturemap的表示","authors":"V. Duarte, Rita Maria Silva Julia","doi":"10.1109/ICTAI.2016.0147","DOIUrl":null,"url":null,"abstract":"The adequate representation of states in the construction of intelligent agents is fundamental for allowing them to achieve a satisfactory performance, principally for those that actuate in a competitive environment that possesses a high state space. One particular type of representation that is very appropriate for these situations is the NetFeatureMap, which describes by means of features the relevant aspects that are inherent to the environment where the agent actuates. In renowned intelligent agents, such features are manually selected, which certainly leads to inadequate choices. Thus, investigating adequate approaches that perform automatic selection of these features becomes a crucial task. In this way, the main contribution of this paper is to propose a new approach that automatically selects appropriate features based on the frequency at which they occur in the states explored by the agent in the course of its acting over the environment. Such an approach is based on Frequent Pattern Mining. It is interesting to point out that there also exist Genetic Algorithms-based approaches that successfully cope with the same task. Unlike Genetic Algorithms that use heuristic functions to select the features, the present proposal uses real data contained in a specialized database for performing this task. Under the intent of investigating the efficacy of such a proposal, the authors utilize the domain of Checkers player agents as their case study, since they operate in a competitive environment with a very wide state space. This investigation is performed by means of tournaments in which agents whose features are selected by the approach proposed herein face others whose features are selected either manually or by Genetic Algorithms. The superior performance of the Frequent-Pattern-based agents in the tournaments proves the efficacy of the present proposal.","PeriodicalId":245697,"journal":{"name":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"236 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improving NetFeatureMap-Based Representation through Frequent Pattern Mining in a Specialized Database\",\"authors\":\"V. Duarte, Rita Maria Silva Julia\",\"doi\":\"10.1109/ICTAI.2016.0147\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The adequate representation of states in the construction of intelligent agents is fundamental for allowing them to achieve a satisfactory performance, principally for those that actuate in a competitive environment that possesses a high state space. One particular type of representation that is very appropriate for these situations is the NetFeatureMap, which describes by means of features the relevant aspects that are inherent to the environment where the agent actuates. In renowned intelligent agents, such features are manually selected, which certainly leads to inadequate choices. Thus, investigating adequate approaches that perform automatic selection of these features becomes a crucial task. In this way, the main contribution of this paper is to propose a new approach that automatically selects appropriate features based on the frequency at which they occur in the states explored by the agent in the course of its acting over the environment. Such an approach is based on Frequent Pattern Mining. It is interesting to point out that there also exist Genetic Algorithms-based approaches that successfully cope with the same task. Unlike Genetic Algorithms that use heuristic functions to select the features, the present proposal uses real data contained in a specialized database for performing this task. Under the intent of investigating the efficacy of such a proposal, the authors utilize the domain of Checkers player agents as their case study, since they operate in a competitive environment with a very wide state space. This investigation is performed by means of tournaments in which agents whose features are selected by the approach proposed herein face others whose features are selected either manually or by Genetic Algorithms. The superior performance of the Frequent-Pattern-based agents in the tournaments proves the efficacy of the present proposal.\",\"PeriodicalId\":245697,\"journal\":{\"name\":\"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)\",\"volume\":\"236 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2016.0147\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2016.0147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在智能体的构建中,状态的充分表示是使它们能够实现令人满意的性能的基础,特别是对于那些在具有高状态空间的竞争环境中驱动的智能体。NetFeatureMap是非常适合这些情况的一种特殊类型的表示,它通过特征来描述代理执行环境所固有的相关方面。在著名的智能代理中,这些特征是手动选择的,这肯定会导致选择不足。因此,研究执行这些特征自动选择的适当方法成为一项至关重要的任务。通过这种方式,本文的主要贡献是提出了一种新的方法,该方法可以根据智能体在其对环境的作用过程中所探索的状态中出现的频率自动选择适当的特征。这种方法基于频繁模式挖掘。有趣的是,也存在基于遗传算法的方法可以成功地处理相同的任务。与使用启发式函数选择特征的遗传算法不同,本建议使用包含在专门数据库中的真实数据来执行此任务。为了调查这一建议的有效性,作者使用了Checkers玩家代理的领域作为他们的案例研究,因为他们在一个具有非常广泛状态空间的竞争环境中运行。这项研究是通过比赛的方式进行的,在比赛中,通过本文提出的方法选择特征的代理面对其他通过手动或遗传算法选择特征的代理。基于频率模式的智能体在比赛中的优异表现证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving NetFeatureMap-Based Representation through Frequent Pattern Mining in a Specialized Database
The adequate representation of states in the construction of intelligent agents is fundamental for allowing them to achieve a satisfactory performance, principally for those that actuate in a competitive environment that possesses a high state space. One particular type of representation that is very appropriate for these situations is the NetFeatureMap, which describes by means of features the relevant aspects that are inherent to the environment where the agent actuates. In renowned intelligent agents, such features are manually selected, which certainly leads to inadequate choices. Thus, investigating adequate approaches that perform automatic selection of these features becomes a crucial task. In this way, the main contribution of this paper is to propose a new approach that automatically selects appropriate features based on the frequency at which they occur in the states explored by the agent in the course of its acting over the environment. Such an approach is based on Frequent Pattern Mining. It is interesting to point out that there also exist Genetic Algorithms-based approaches that successfully cope with the same task. Unlike Genetic Algorithms that use heuristic functions to select the features, the present proposal uses real data contained in a specialized database for performing this task. Under the intent of investigating the efficacy of such a proposal, the authors utilize the domain of Checkers player agents as their case study, since they operate in a competitive environment with a very wide state space. This investigation is performed by means of tournaments in which agents whose features are selected by the approach proposed herein face others whose features are selected either manually or by Genetic Algorithms. The superior performance of the Frequent-Pattern-based agents in the tournaments proves the efficacy of the present proposal.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信