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

Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018)最新文献

筛选
英文 中文
Flower Pollination Algorithm Combined with Multiple Strategies of Opposition–Based Learning 基于对立学习的多策略花授粉算法
Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018) Pub Date : 2018-10-22 DOI: 10.5753/ENIAC.2018.4453
Cácio L. N. A. Bezerra, Fábio G. B. C. Costa, Lucas V. Bazante, P. Carvalho, Fábio A. P. Paiva
{"title":"Flower Pollination Algorithm Combined with Multiple Strategies of Opposition–Based Learning","authors":"Cácio L. N. A. Bezerra, Fábio G. B. C. Costa, Lucas V. Bazante, P. Carvalho, Fábio A. P. Paiva","doi":"10.5753/ENIAC.2018.4453","DOIUrl":"https://doi.org/10.5753/ENIAC.2018.4453","url":null,"abstract":"Flower Pollination Algorithm (FPA) has been widely used to solve optimization problems. However, it faces the problem of stagnation in local optimum. Several approaches have been proposed to deal with this problem. To improve the performance of the FPA, this paper presents a new variant that combines FPA and two variants of the Opposition Based Learning (OBL), such as Quasi OBL (QOBL) and Elite OBL (EOBL). To evaluate this proposal, 10 benchmark functions were used. In addition, the proposed algorithm was compared with original FPA and three variants such as FA–EOBL, SBFPA and DE–FPA. The proposal presented significant results.","PeriodicalId":152292,"journal":{"name":"Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116090097","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
Computer-Aided Tuberculosis Detection from Chest X-Ray Images with Convolutional Neural Networks 基于卷积神经网络的胸部x射线图像计算机辅助肺结核检测
Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018) Pub Date : 2018-10-22 DOI: 10.5753/eniac.2018.4444
Lucas Gabriel Coimbra Evalgelista, Elloá B. Guedes
{"title":"Computer-Aided Tuberculosis Detection from Chest X-Ray Images with Convolutional Neural Networks","authors":"Lucas Gabriel Coimbra Evalgelista, Elloá B. Guedes","doi":"10.5753/eniac.2018.4444","DOIUrl":"https://doi.org/10.5753/eniac.2018.4444","url":null,"abstract":"Diagnosing Tuberculosis is crucial for proper treatment since it is one of the top 10 causes of deaths worldwide. Considering a computer-aided approach based on intelligent pattern recognition on chest X-ray with Convolutional Neural Networks, this work presents the proposition, training and test results of 9 different architectures to address this task as well as two ensembles. The highest performance verified reaches accuracy of 88.76%, surpassing human experts on similar data as previously reported by literature. The experimental data used comes from public medical datasets and comprise real-world examples from patients with different ages and physical characteristics, what favours reproducibility and application in practical scenarios.","PeriodicalId":152292,"journal":{"name":"Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123434042","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}
引用次数: 10
Relevance, diversity and serendipity in content recommendation using clustering 基于聚类的内容推荐的相关性、多样性和偶然性
Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018) Pub Date : 2018-10-22 DOI: 10.5753/ENIAC.2018.4463
Fernando Costa, Andrei Martins Silva, S. M. Peres
{"title":"Relevance, diversity and serendipity in content recommendation using clustering","authors":"Fernando Costa, Andrei Martins Silva, S. M. Peres","doi":"10.5753/ENIAC.2018.4463","DOIUrl":"https://doi.org/10.5753/ENIAC.2018.4463","url":null,"abstract":"In this paper, over-specialization in content-based recommender sys- tems is explored through the definition and analysis of recommendation strate- gies aiming at quality in terms of relevance, diversity and serendipity. Clustering is applied as the basis for building these strategies, applied to the news context. The results show the feasibility of the proposed strategies.","PeriodicalId":152292,"journal":{"name":"Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126797256","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
An Agent Program Capable of Applying Local Search Strategies in the State Space of Well Defined Problems 一种能够在明确问题状态空间中应用局部搜索策略的智能体程序
Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018) Pub Date : 2018-10-22 DOI: 10.5753/eniac.2018.4432
Thayanne França, R. J. F. Junior, J. H. A. Pereira, F. R. V. Silveira, Lídio Mauro Lima de Campos, T. P. D. Araujo, Gustavo Campos
{"title":"An Agent Program Capable of Applying Local Search Strategies in the State Space of Well Defined Problems","authors":"Thayanne França, R. J. F. Junior, J. H. A. Pereira, F. R. V. Silveira, Lídio Mauro Lima de Campos, T. P. D. Araujo, Gustavo Campos","doi":"10.5753/eniac.2018.4432","DOIUrl":"https://doi.org/10.5753/eniac.2018.4432","url":null,"abstract":"Classical models of agents for solving well-defined problems are widely used in the literature but are limited to systematic search strategies in order to find the solutions. However, these strategies are not suited for all types of application. This work presents an adaption of classical models of agents for local search strategies. One agent system for neural network automatic design is used to show the feasibility of the proposal. The results are promising, since the model found satisfactory solutions for the proposed problems.","PeriodicalId":152292,"journal":{"name":"Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122251419","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
Automatic Identification of Equivalence of Concepts in Different Languages for Never-Ending Learning 基于永无休止学习的不同语言概念对等自动识别
Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018) Pub Date : 2018-10-22 DOI: 10.5753/eniac.2018.4412
Silvio C. Marino, E. R. H. Junior
{"title":"Automatic Identification of Equivalence of Concepts in Different Languages for Never-Ending Learning","authors":"Silvio C. Marino, E. R. H. Junior","doi":"10.5753/eniac.2018.4412","DOIUrl":"https://doi.org/10.5753/eniac.2018.4412","url":null,"abstract":"This paper describes the process of automatic identification of concepts in different languages using a base that relies on simple semantic and morphosyntactic characteristics like string similarity, difference in words amount and translation position on dictionary (when exists) and a neural network that has been used as a model of machine learning. All experiments use data that was obtained from a few categories of Read The Web (RTW) project and an endless learning computation system called NELL: Never-Ending Language Learning. The results were compared with dictionary and showed that the introduction of neural network brought a significant gain in the process of equivalence of concepts.","PeriodicalId":152292,"journal":{"name":"Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134282273","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
Transfer Learning for Synthetic Examples Selection in Meta-learning 元学习中综合示例选择的迁移学习
Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018) Pub Date : 2018-10-22 DOI: 10.5753/eniac.2018.4469
Regina R. Parente, R. Prudêncio
{"title":"Transfer Learning for Synthetic Examples Selection in Meta-learning","authors":"Regina R. Parente, R. Prudêncio","doi":"10.5753/eniac.2018.4469","DOIUrl":"https://doi.org/10.5753/eniac.2018.4469","url":null,"abstract":"In Meta-learning, training examples are generated from experiments performed with a pool of candidate algorithms in a number of problems (real or synthetic). Generating a good set of examples can be difficult due to the low availability of real datasets in some domains and the high computational cost of labeling. In this paper, we focus on the selection of training meta-examples by combining data manipulation and Transfer Learning via One-class classification. So, the most relevant examples are selected to be labeled. Our experiments revealed that it is possible to reduce the computational cost of generating meta- examples and maintain the meta-learning performance.","PeriodicalId":152292,"journal":{"name":"Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128576450","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 GA-Based Approach for Building Regularized Sparse Polynomial Models for Wind Turbine Power Curves 基于遗传算法的风电功率曲线正则化稀疏多项式模型构建方法
Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018) Pub Date : 2018-10-22 DOI: 10.5753/ENIAC.2018.4455
H. Maya, G. Barreto
{"title":"A GA-Based Approach for Building Regularized Sparse Polynomial Models for Wind Turbine Power Curves","authors":"H. Maya, G. Barreto","doi":"10.5753/ENIAC.2018.4455","DOIUrl":"https://doi.org/10.5753/ENIAC.2018.4455","url":null,"abstract":"In this paper, the classical polynomial model for wind turbines power curve estimation is revisited aiming at an automatic and parsimonious design. In this regard, using genetic algorithms we introduce a methodoloy for estimating a suitable order for the polynomial as well its relevant terms. The proposed methodology is compared with the state of the art in estimating the power curve of wind turbines, such as logistic models (with 4 and 5 parameters), artificial neural networks and weighted polynomial regression. We also show that the proposed approach performs better than the standard LASSO approach for building regularized sparse models. The results indicate that the proposed methodology consistently outperforms all the evaluated alternative methods.\u0000","PeriodicalId":152292,"journal":{"name":"Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131400993","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
Sentiment Analysis of Twitter Posts About the 2017 Academy Awards 2017年奥斯卡金像奖推文情感分析
Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018) Pub Date : 2018-10-22 DOI: 10.5753/eniac.2018.4427
Igor T. Correa, D. Abdala, R. Miani, E. Faria
{"title":"Sentiment Analysis of Twitter Posts About the 2017 Academy Awards","authors":"Igor T. Correa, D. Abdala, R. Miani, E. Faria","doi":"10.5753/eniac.2018.4427","DOIUrl":"https://doi.org/10.5753/eniac.2018.4427","url":null,"abstract":"This paper aims to perform the sentiment analysis of Twitter posts related to the movies nominated for Best Picture of the 2017 Oscars in order to find out if there is a correlation between the posts and the Oscar winners. A tweets database was built, pre-processed, and later evaluated by three distinct approaches: Naive Bayes, Distant Supervision Learning, and Polarity Function. It was possible to predict which movie would be considered the winner and which would be among the less prestigious ones. It was noted that Twitter users prefer to post positive comments about movies rather than saying bad things about the ones they did not like. Furthermore, it was verified that award shows such as the Oscars cause a growth in the number of posts on Twitter.","PeriodicalId":152292,"journal":{"name":"Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131505221","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
Risk Sensitive Probabilistic Planning with ILAO* and Exponential Utility Function 具有ILAO*和指数效用函数的风险敏感概率规划
Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018) Pub Date : 2018-10-22 DOI: 10.5753/ENIAC.2018.4434
Elthon Manhas de Freitas, K. V. Delgado, Valdinei Freire
{"title":"Risk Sensitive Probabilistic Planning with ILAO* and Exponential Utility Function","authors":"Elthon Manhas de Freitas, K. V. Delgado, Valdinei Freire","doi":"10.5753/ENIAC.2018.4434","DOIUrl":"https://doi.org/10.5753/ENIAC.2018.4434","url":null,"abstract":"Markov Decision Process (MDP) has been used very efficiently to solve sequential decision-making problems. However, there are problems in which dealing with the risks of the environment to obtain a reliable result is more important than minimizing the total expected cost. MDPs that deal with this type of problem are called risk-sensitive Markov decision processes (RSMDP). In this paper we propose an efficient heuristic search algorithm that allows to obtain a solution by evaluating only the relevant states to reach the goal states starting from an initial state.","PeriodicalId":152292,"journal":{"name":"Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126249884","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
Biased Mutation and Tournament Selection Approaches for Designing Combinational Logic Circuits via Cartesian Genetic Programming 基于笛卡尔遗传规划的组合逻辑电路设计中的偏差突变和竞赛选择方法
Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018) Pub Date : 2018-10-22 DOI: 10.5753/ENIAC.2018.4471
J. E. H. D. Silva, Francisco A. L. Manfrini, H. Bernardino, H. Barbosa
{"title":"Biased Mutation and Tournament Selection Approaches for Designing Combinational Logic Circuits via Cartesian Genetic Programming","authors":"J. E. H. D. Silva, Francisco A. L. Manfrini, H. Bernardino, H. Barbosa","doi":"10.5753/ENIAC.2018.4471","DOIUrl":"https://doi.org/10.5753/ENIAC.2018.4471","url":null,"abstract":"Cartesian Genetic Programming (CGP) is often applied to design combinational logic circuits. However, there is no consensus in the literature regarding the more appropriate objective function when it is desired to minimize the number of logic gates of the circuit. Thus, we analyze here two strategies: the minimization of the number of logic gates and the maximization of the number of wire gates. Additionally, a biased mutation strategy for CGP, which were previously presented and tested only to find a feasible solution, are extended in this paper for the subsequent optimization step. Several configurations were proposed and tested varying objective function and selection schemes. Compu- tational experiments are conducted with some benchmark circuits to relatively compare the proposed methods, and the results obtained are better than those found by the other techniques considered here.\u0000","PeriodicalId":152292,"journal":{"name":"Anais do XV Encontro Nacional de Inteligência Artificial e Computacional (ENIAC 2018)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128372717","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信