发布求助
文献互助 智能选刊 最新文献

2016 5th Brazilian Conference on Intelligent Systems (BRACIS)最新文献

筛选
英文 中文
Evaluating the SBR Algorithm Using Automatically Generated Plan Libraries 使用自动生成计划库评估SBR算法
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.046
G. Farias, L. Hilgert, Felipe Meneguzzi, Rafael Heitor Bordini
{"title":"Evaluating the SBR Algorithm Using Automatically Generated Plan Libraries","authors":"G. Farias, L. Hilgert, Felipe Meneguzzi, Rafael Heitor Bordini","doi":"10.1109/BRACIS.2016.046","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.046","url":null,"abstract":"Most approaches to plan recognition are based on manually constructed rules, where the knowledge base is represented as a plan library for recognising plans. For non-trivial domains, such plan libraries have complex structures representing possible agent behaviour to achieve a plan. Existing plan recognition approaches are seldom tested at their limits, and, though they use conceptually similar plan library representations, they rarely use the exact same domain in order to directly compare their performance, leading to the need for a principled approach to evaluating them. Thus, we develop a mechanism to automatically generate arbitrarily complex plan libraries which can be directed through a number of parameters, in order to create plan libraries representing different domains and so allowing systematic experimentation and comparison among the several plan recognition algorithms. We validate our mechanism by carrying out an experiment to evaluate the performance of a known plan recognition algorithm.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127454083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Novel Context-Free Grammar to Guide the Construction of Particle Swarm Optimization Algorithms 一种新的上下文无关语法来指导粒子群优化算法的构建
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.061
P. Miranda, R. Prudêncio
{"title":"A Novel Context-Free Grammar to Guide the Construction of Particle Swarm Optimization Algorithms","authors":"P. Miranda, R. Prudêncio","doi":"10.1109/BRACIS.2016.061","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.061","url":null,"abstract":"Particle Swarm Optimization algorithm (PSO) has been largely studied over the years due to its flexibility and competitive results in different applications. Nevertheless, its performance depends on different aspects of design (e.g., inertia factor, velocity equation, topology). The task of deciding which is the best algorithm design to solve a particular problem is challenging due to the great number of possible variations and parameters to take into account. This work proposes a novel context-free grammar for Grammar-Guided Genetic Programming (GGGP) algorithms to guide the construction of Particle Swarm Optimizers. The proposed grammar addresses four aspects of the PSO algorithm that may strongly influence on its convergence: swarm initialization, neighborhood topology, velocity update equation and mutation operator. To evaluate this approach, a GGGP algorithm was set with the proposed grammar and applied to optimize the PSO algorithm in 32 unconstrained continuous optimization problems. In the experiments, we compared the designs generated considering the proposed grammar with the designs produced by other grammars proposed in the literature to automate PSO designs. The results obtained by the proposed grammar were better than the counterparts. Besides, we also compared the generated algorithms to state-of-art algorithms. The results have shown that the algorithms produced from the grammar achieved competitive results.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125335957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Solving Atomix with Pattern Databases 使用模式数据库解决Atomix问题
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.022
Alex Gliesch, M. Ritt
{"title":"Solving Atomix with Pattern Databases","authors":"Alex Gliesch, M. Ritt","doi":"10.1109/BRACIS.2016.022","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.022","url":null,"abstract":"In this paper we study the application of pattern databases (PDBs) to optimally solving Atomix. Atomix is a puzzle, where one has to assemble a molecule from atoms by sliding moves. It is particularly challenging, because the slides makes it hard to create admissible heuristics, and state-of-the-art heuristics are rather uninformed. A pattern database (PDB) stores solutions to an abstract version of a state space problem. An admissible lower bound for a given state is obtained by decomposing it into abstract states and combining their pre-computed solutions. Different from other puzzles a pattern in Atomix cannot be simply obtained by omitting pieces from the puzzle. We also study the search algorithm Partial Expansion A*'s application to Atomix, as a reduced-memory alternative to A*. Experiments show our method solves more instances and significantly improves current lower bounds, running times and node expansions compared to the best solution in the literature.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129579455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Hybrid Strategy to Evolve Cellular Automata Rules with a Desired Dynamical Behavior Applied to the Task Scheduling Problem 具有期望动态行为的元胞自动机规则演化混合策略在任务调度问题中的应用
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.094
T. I. D. Carvalho, M. Carneiro, G. Oliveira
{"title":"A Hybrid Strategy to Evolve Cellular Automata Rules with a Desired Dynamical Behavior Applied to the Task Scheduling Problem","authors":"T. I. D. Carvalho, M. Carneiro, G. Oliveira","doi":"10.1109/BRACIS.2016.094","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.094","url":null,"abstract":"Cellular automata (CA) are discrete dynamical systems that generate complex and unpredictable behaviors. CA can exhibit a rich variety of behaviors from ordered to chaotic dynamics. An important issue in several applications is to control this dynamic in order to extract the best performance of CA rules. In the CA-based task scheduling domain, a partial answer is given by recent works that investigate two approaches named µ and ρ to evolve CA rules through a standard genetic algorithm, avoiding an undesirable dynamical behavior denoted by long-cycle and chaotic rules. Both approaches have been shown able to find CA rules with adequate dynamical behavior. However, each one presented its particularities: µ was stronger to avoid long-cycle rules and ρ obtains more refined rules (fixed-point behavior). In the present work, we investigate a new mixed approach named µρ in which the good characteristics of µ and ρ are preserved.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114013771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Co-MLM: A SSL Algorithm Based on the Minimal Learning Machine 一种基于最小学习机的SSL算法
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.028
Weslley L. Caldas, J. Gomes, Michelle G. Cacais, D. Mesquita
{"title":"Co-MLM: A SSL Algorithm Based on the Minimal Learning Machine","authors":"Weslley L. Caldas, J. Gomes, Michelle G. Cacais, D. Mesquita","doi":"10.1109/BRACIS.2016.028","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.028","url":null,"abstract":"Semi-supervised learning is a challenging topic in machine learning that has attracted much attention in recent years. The availability of huge volumes of data and the work necessary to label all these data are two of the reasons that can explain this interest. Among the various methods for semi-supervised learning, the co-training framework has become popular due to its simple formulation and promising results. In this work, we propose Co-MLM, a semi-supervised learning algorithm based on a recently supervised method named Minimal Learning Machine (MLM), built upon co-training framework. Experiments on UCI data sets showed that Co-MLM has promising performance in compared to other co-training style algorithms.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"54 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132535682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A Proposal for Tuning the Alpha Parameter in a Copula Function Applied in Fuzzy Rule-Based Classification Systems 一种用于模糊规则分类系统的Copula函数α参数的整定方法
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.073
Giancarlo Lucca, G. Dimuro, B. Bedregal, J. Sanz, H. Bustince
{"title":"A Proposal for Tuning the Alpha Parameter in a Copula Function Applied in Fuzzy Rule-Based Classification Systems","authors":"Giancarlo Lucca, G. Dimuro, B. Bedregal, J. Sanz, H. Bustince","doi":"10.1109/BRACIS.2016.073","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.073","url":null,"abstract":"In this paper, we use the concept of extended Choquet integral generalized by a copula function, as proposed by Lucca et al. More precisely, the copula considered in their study uses a variable alpha , with different fixed values for testing its behavior. In this contribution we propose a modification of this method assigning a value to this alpha parameter using a genetic algorithm in order to find the value that best fits it for each class. Specifically, this new proposal is applied in the Fuzzy Reasoning Method (FRM) of Fuzzy Rule-Based Classification Systems (FRBCSs). Finally, we compare the results provided by our new approach against the best solution proposed by Lucca et al. (that uses an fixed value for the variable alpha ). From the obtained results it can be concluded that the genetic learning of the alpha parameter is statistically superior than the fixed one. Therefore, we demonstrate that our genetic method can be used as an alternative for this function.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134064578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
A Trust and Reputation Framework for Game Agents: Providing a Social Bias to Computer Players 游戏代理的信任和声誉框架:为电脑玩家提供社会偏见
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.044
Fabio S. do Couto, Carla Delgado, J. F. C. Silva
{"title":"A Trust and Reputation Framework for Game Agents: Providing a Social Bias to Computer Players","authors":"Fabio S. do Couto, Carla Delgado, J. F. C. Silva","doi":"10.1109/BRACIS.2016.044","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.044","url":null,"abstract":"This work presents the application of trust and reputation models in the context of interactive games. This type of application aims to avoid that other players (humans or computers) can easily predict the behaviour of non-human players, and consequently loose interest in the game. In our approach, trust and reputation are mechanisms used to bring a social bias to non-human players, with the intention to emulate different types of social profiles. The main idea is to combine the social profile with the rationale the agent has regarding the game rules and game state, so that the agent uses both these traces (social profile and intelligent reasoning) in order to decide the next action to take. In this paper we present the conceptual model and the architecture of the proposed framework, and also report the results of a case study based on a game played by non-human players with different social profiles.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132984835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Discriminating between Brazilian and European Portuguese National Varieties on Twitter Texts 推特文本中巴西和欧洲葡萄牙国家品种的区别
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.056
D. Castro, E. Souza, Adriano Oliveira
{"title":"Discriminating between Brazilian and European Portuguese National Varieties on Twitter Texts","authors":"D. Castro, E. Souza, Adriano Oliveira","doi":"10.1109/BRACIS.2016.056","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.056","url":null,"abstract":"Twitter is one of the most used social media with users generating about 1 million messages per day. As a result of the expansion of this microblog, there is a diversity of languages used by users and many studies aimed at identifying the language of tweets. The third most used language on Twitter is Portuguese, a pluricentric language with two national standard varieties: Brazilian Portuguese and European Portuguese. Identifying a language variety may positively impact various Natural Language Processing tasks, but accomplishing this task is still regarded as one of the bottlenecks in this area, especially when combined with another bottleneck, language identification applied to short texts. Thus, given these challenges, this paper provides a current view on the automatic discrimination of the two main Portuguese language varieties on Twitter texts by using an acknowledged approach with different techniques and features in order to get an optimum configuration to fit our problem. Results reached 0.9271 for accuracy using an ensemble method, which combines character 6-grams and word unigrams and bigrams.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115814000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Object-Oriented Reinforcement Learning in Cooperative Multiagent Domains 协同多智能体领域的面向对象强化学习
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.015
Felipe Leno da Silva, R. Glatt, Anna Helena Reali Costa
{"title":"Object-Oriented Reinforcement Learning in Cooperative Multiagent Domains","authors":"Felipe Leno da Silva, R. Glatt, Anna Helena Reali Costa","doi":"10.1109/BRACIS.2016.015","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.015","url":null,"abstract":"Although Reinforcement Learning methods have successfully been applied to increasingly large problems, scalability remains a central issue. While Object-Oriented Markov Decision Processes (OO-MDP) are used to exploit regularities in a domain, Multiagent System (MAS) methods are used to divide workload amongst multiple agents. In this work we propose a novel combination of OO-MDP and MAS, called Multiagent Object-Oriented Markov Decision Process (MOO-MDP), so as to accrue the benefits of both strategies and be able to better address scalability issues. We present an algorithm to solve deterministic cooperative MOO-MDPs, and prove that it learns optimal policies while reducing the learning space by exploiting state abstractions. We experimentally compare our results with earlier approaches and show advantages with regard to discounted cumulative reward, number of steps to fulfill the task, and Q-table size.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129064067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Metaheuristic Design Pattern: Visitor for Genetic Operators 元启发式设计模式:遗传算子的访客
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.038
Giovani Guizzo, S. Vergilio
{"title":"Metaheuristic Design Pattern: Visitor for Genetic Operators","authors":"Giovani Guizzo, S. Vergilio","doi":"10.1109/BRACIS.2016.038","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.038","url":null,"abstract":"Metaheuristics, such as Genetic Algorithms (GAs), and hyper-heuristics have been widely studied and applied in the literature. This led to the development of several frameworks to aid the execution and development of such algorithms. Consequently, the reusability, scalability and maintainability became fundamental points to be attacked by developers. Such points can be improved using Design Patterns, but despite their advantages, few works have explored their usage with metaheuristics and hyper-heuristics. In order to contribute to this research topic, we present a solution based on the Visitor pattern used to design genetic operators. A case study is presented with the Hyper-heuristic for the Integration and Test Order problem (HITO). This case study shows that the proposed solution can increase the reusability of the implemented operators, and also enable easy addition of new genetic operators and representations.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132317236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信