2014 Brazilian Conference on Intelligent Systems最新文献

筛选
英文 中文
A Hybrid Evolutionary System for Parameter Optimization and Lag Selection in Time Series Forecasting 时间序列预测中参数优化和滞后选择的混合进化系统
2014 Brazilian Conference on Intelligent Systems Pub Date : 2014-10-18 DOI: 10.1109/BRACIS.2014.24
João F. L. Oliveira, Teresa B Ludermir
{"title":"A Hybrid Evolutionary System for Parameter Optimization and Lag Selection in Time Series Forecasting","authors":"João F. L. Oliveira, Teresa B Ludermir","doi":"10.1109/BRACIS.2014.24","DOIUrl":"https://doi.org/10.1109/BRACIS.2014.24","url":null,"abstract":"The accuracy of time series forecasting can be increased by the employment of evolutionary systems. The improvement in the precision of such systems impact positively on the decision making process of many organizations. In this work we explore the decomposition of time series into linear and nonlinear patterns by the use of an autoregressive integrated moving average (ARIMA) method and a support vector machine (SVM) method using a particle swarm optimization algorithm to simultaneously perform parameter selection and lag selection. Experiments were performed using datasets from the time series data library amd the results demonstrated that the proposed method achieved promising results for one-step ahead predictions.","PeriodicalId":195948,"journal":{"name":"2014 Brazilian Conference on Intelligent Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115653075","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}
引用次数: 13
ELMOEA/D-DE: Extreme Learning Surrogate Models in Multi-objective Optimization Based on Decomposition and Differential Evolution ELMOEA/D-DE:基于分解和差分进化的多目标优化中的极限学习代理模型
2014 Brazilian Conference on Intelligent Systems Pub Date : 2014-10-18 DOI: 10.1109/BRACIS.2014.64
L. M. Pavelski, M. Delgado, C. Almeida, Richard A. Gonçalves, Sandra M. Venske
{"title":"ELMOEA/D-DE: Extreme Learning Surrogate Models in Multi-objective Optimization Based on Decomposition and Differential Evolution","authors":"L. M. Pavelski, M. Delgado, C. Almeida, Richard A. Gonçalves, Sandra M. Venske","doi":"10.1109/BRACIS.2014.64","DOIUrl":"https://doi.org/10.1109/BRACIS.2014.64","url":null,"abstract":"Despite the success of Evolutionary Algorithms in solving complex problems, they may require many function evaluations. This becomes an issue when dealing with costly problems. Surrogate models may overcome this difficulty, though their use in problems with medium to large dimensionality is underexplored in the literature. Problems with multiple conflicting objectives can be formulated as Multi-objective Optimization Problems (MOPs). MOPs have received a great attention lately, mainly with Multi-objective Evolutionary Algorithms (MOEAs). This paper proposes ELMOEA/D-DE, a surrogate-assisted MOEA, for solving expensive MOPs in small evaluation budgets. ELMOEA/D-DE encompasses a state-of-the-art MOEA based on decomposition, Differential Evolution (DE) operators and Extreme Learning Machines. This paper tests three variants of ELMOEA/D-DE, using different DE operators, for solving five known benchmark MOPs with 10 to 60 decision variables. All variants achieve good results in terms of hyper volume metric and the best variant with operator DE/rand/1/bin is compared with two state-of-the-art approaches (MOEA/D-RBF and a non-surrogate-based MOEA), achieving the best results in all but one problems instances.","PeriodicalId":195948,"journal":{"name":"2014 Brazilian Conference on Intelligent Systems","volume":"290 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125885816","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}
引用次数: 18
An ALC Description Default Logic with Exceptions-First 带有异常优先的ALC描述默认逻辑
2014 Brazilian Conference on Intelligent Systems Pub Date : 2014-10-18 DOI: 10.1109/BRACIS.2014.40
Debora Farias Frota, Ana Teresa C. Martins, João F. L. Alcântara, Luis Henrique Bustamante
{"title":"An ALC Description Default Logic with Exceptions-First","authors":"Debora Farias Frota, Ana Teresa C. Martins, João F. L. Alcântara, Luis Henrique Bustamante","doi":"10.1109/BRACIS.2014.40","DOIUrl":"https://doi.org/10.1109/BRACIS.2014.40","url":null,"abstract":"Knowledge formalization and reasoning automation are central within Artificial Intelligence. Classical logic has been traditionally used for such purposes. However, it is better suited to deal with complete knowledge in ideal circumstances. In real situations, in which the knowledge is partial, classical logic is not sufficient since it is monotonic. No monotonic logics have been proposed to better cope with practical reasoning. A successful formalization of no monotonic reasoning is Reiter's default logic which extends classical logic with default rules. Unfortunately, default logic is undividable. One reason for that is the use of classical logic as its monotonic basis. In this work, we change the default logic monotonic basis and propose a new default logic based on the description logic ALC. This new default logic is decidable and useful to formalize practical reasoning on hierarchical ontology's with exceptions, specially the ones that deals with legal knowledge and reasoning. On the default counterpart, we add some restrictions to the application of defaults in order to obtain nice properties such as coherence and elimination of anomalous extensions. We present the main algorithms used to build the extensions for this logic with its complexity analysis.","PeriodicalId":195948,"journal":{"name":"2014 Brazilian Conference on Intelligent Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126831925","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 Competent Multi-swarm Approach for Many-Objective Problems 多目标问题的混合胜任多群方法
2014 Brazilian Conference on Intelligent Systems Pub Date : 2014-10-18 DOI: 10.1109/BRACIS.2014.82
Olacir Rodrigues Castro Junior, A. Pozo
{"title":"A Hybrid Competent Multi-swarm Approach for Many-Objective Problems","authors":"Olacir Rodrigues Castro Junior, A. Pozo","doi":"10.1109/BRACIS.2014.82","DOIUrl":"https://doi.org/10.1109/BRACIS.2014.82","url":null,"abstract":"Many-objective optimization problems (MaOPs) are a class of multi-objective problems that presents more than three functions to be optimized. As most Pareto based algorithms scale poorly according to the number of objectives, researchers are working on alternatives to overcome these limitations. An algorithm that has shown good results in solving MaOPs is the Iterated Multi-swarm (I-Multi) which presents a clever multi-swarm strategy to spread the solutions across different areas of the objective space while keeping a good convergence. As the I-Multi is a very recent algorithm, alternative approaches are yet to be explored. Here we investigate the use of an Estimation of Distribution Algorithm (EDA) in the multi-swarm stage of I-Multi. EDAs create a model based on the best solutions found and sample new solutions based in this model. An EDA that presents good performance is the rBOA which is a real-valued version of the Bayesian optimization algorithm. This work presents an algorithm called C-Multi consisting of a hybrid between the I-Multi and the rBOA with the aim to join the diversity strength of I-Multi and the convergence characteristic of rBOA. An experimental study is conducted using the seven well-known DTLZ test functions with 3, 5, 10, 15 and 20 objectives to evaluate the performance of the algorithms as the number of objectives scales up. The results point that the new algorithm presents superior convergence and diversity on hard problems.","PeriodicalId":195948,"journal":{"name":"2014 Brazilian Conference on Intelligent Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122741601","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
Archive Based Multi-swarm Algorithm for Many-Objective Problems 基于存档的多目标问题多群算法
2014 Brazilian Conference on Intelligent Systems Pub Date : 2014-10-18 DOI: 10.1109/BRACIS.2014.25
André Britto, Sanaz Mostaghim, A. Pozo
{"title":"Archive Based Multi-swarm Algorithm for Many-Objective Problems","authors":"André Britto, Sanaz Mostaghim, A. Pozo","doi":"10.1109/BRACIS.2014.25","DOIUrl":"https://doi.org/10.1109/BRACIS.2014.25","url":null,"abstract":"Multi-Objective Optimization Problems (MOPS) present several challenges. In particular, when the number of objectives is greater than three, they are actually called Many-Objective Optimization Problems (MaOPs). To overcome this limitation, researches are investigating multi-swarm approaches. Multi-swarm is a very interesting approach that allows the decomposition of different aspects of the problem and each swarm could specialize on a dedicate part of the problem. This study explores this idea to create a novel multi-swarm algorithm, called A-Multi, which tackles the main challenge of MaOPs: to convergence towards the true Pareto front and to diversify the obtained solutions covering the entire Pareto front. A-Multi project is based on different swarms use different archiving methods, ones specialized on diversity and others specialized on convergence. The algorithm is evaluated with several MaOPs in terms of both convergence and diversity and the results shows the validity of archive based multi-swarm approach.","PeriodicalId":195948,"journal":{"name":"2014 Brazilian Conference on Intelligent Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128311395","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
Mapping of Facial Elements for Emotion Analysis 面向情感分析的面部元素映射
2014 Brazilian Conference on Intelligent Systems Pub Date : 2014-10-18 DOI: 10.1109/BRACIS.2014.48
Giampaolo L. Libralon, R. Romero
{"title":"Mapping of Facial Elements for Emotion Analysis","authors":"Giampaolo L. Libralon, R. Romero","doi":"10.1109/BRACIS.2014.48","DOIUrl":"https://doi.org/10.1109/BRACIS.2014.48","url":null,"abstract":"The recognition of emotions from others' face is an universal and fundamental skill for social interaction. Many researchers argue that there is a set of basic emotions which were preserved during evaluative process because they allow the adaption of the organisms behaviour to distinct daily situations. This paper is about emotion analysis and the identification of facial elements relevant for this task. The proposed approach is based on psychological research. Different facial representations are proposed to represent the geometrical characteristics of the human face and their performance is evaluated using Machine Learning techniques. Also, an investigation of the facial elements related to the identification of the six basic emotions plus the neutral state is presented.","PeriodicalId":195948,"journal":{"name":"2014 Brazilian Conference on Intelligent Systems","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121300957","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
SAT and MaxSAT Encodings for Trees Applied to the Steiner Tree Problem 树的SAT和MaxSAT编码在Steiner树问题中的应用
2014 Brazilian Conference on Intelligent Systems Pub Date : 2014-10-18 DOI: 10.1109/BRACIS.2014.43
Ricardo Tavares de Oliveira, Fabiano Silva
{"title":"SAT and MaxSAT Encodings for Trees Applied to the Steiner Tree Problem","authors":"Ricardo Tavares de Oliveira, Fabiano Silva","doi":"10.1109/BRACIS.2014.43","DOIUrl":"https://doi.org/10.1109/BRACIS.2014.43","url":null,"abstract":"In this paper we present some SAT and MaxSAT codifications for trees in graphs. We review two known encodings and suggest four new ones. We categorize the encodings into three categories: Absolute encodings state that each vertex must be in a fixed position in some structure, Relative encodings state the relative positions between the vertices in some structure, Counting-based encodings use theoretical graph properties to hardcode the degree of each vertex in a tree. We use these encodings to reduce the Steiner Tree Problem in Graphs to (Partial Weighted) MaxSAT and compare their efficiency to solve random instances and ones from the SteinLib benchmark. The experiments strongly suggest that relative encodings are more efficient than absolute ones, but there is not an overall best encoding between relative and counting-based ones.","PeriodicalId":195948,"journal":{"name":"2014 Brazilian Conference on Intelligent Systems","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126290291","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
An Object-Based Visual Selection Model Combining Physical Features and Memory 结合物理特征和记忆的基于对象的视觉选择模型
2014 Brazilian Conference on Intelligent Systems Pub Date : 2014-10-18 DOI: 10.1109/BRACIS.2014.50
A. X. Benicasa, M. G. Quiles, T. C. Silva, Liang Zhao, R. Romero
{"title":"An Object-Based Visual Selection Model Combining Physical Features and Memory","authors":"A. X. Benicasa, M. G. Quiles, T. C. Silva, Liang Zhao, R. Romero","doi":"10.1109/BRACIS.2014.50","DOIUrl":"https://doi.org/10.1109/BRACIS.2014.50","url":null,"abstract":"In this paper, a new visual selection model is proposed, which combines both early visual features and object-based visual selection modulations. This model integrates three main mechanisms. The first is responsible for the segmentation of the scene allowing the identification of objects. In the second one, the average of saliency of each object is calculated for each feature considered in this work, which provides the modulation of the visual attention for one or more features. Finally, the third mechanism is responsible for building the object-saliency map, which highlights the salient objects in the scene. It will be shown that top-down modulation can overcome bottom-up saliency by selecting a known object instead of the most salient (bottom-up) and is even clear in the absence of any bottom-up clue. Several experiments with synthetic and real images are conducted and the obtained results demonstrate the effectiveness of the proposed approach for visual attention.","PeriodicalId":195948,"journal":{"name":"2014 Brazilian Conference on Intelligent Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131757852","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 Group Search Optimization Method for Data Clustering 数据聚类的组搜索优化方法
2014 Brazilian Conference on Intelligent Systems Pub Date : 2014-10-18 DOI: 10.1109/BRACIS.2014.68
L. Pacífico, Teresa B Ludermir
{"title":"A Group Search Optimization Method for Data Clustering","authors":"L. Pacífico, Teresa B Ludermir","doi":"10.1109/BRACIS.2014.68","DOIUrl":"https://doi.org/10.1109/BRACIS.2014.68","url":null,"abstract":"Clustering analysis aims to distribute a dataset in-groups in such a way that individuals from the same group have a high degree of similarity among each other, while individuals from different groups have a high degree of dissimilarity among each other. Clustering analysis has become an important mechanism for data exploration and understanding. Evolutionary Algorithms (EAs) have been widely applied for clustering analysis, given their flexibility and capabilities to deal with difficult environments. In this context, Group Search Optimizer (GSO) is a nature-inspired algorithm based on animal searching behaviour and group living theory to solve continuous optimization problems. This paper presents a new evolutionary algorithm for data clustering, named KGSO, which uses a Group Search Optimizer and K-Means approach to perform the clustering task. Experiments were performed on seven benchmark datasets obtained from UCI Machine Learning Repository and seven synthetic datasets to evaluate the performance of proposed algorithm in comparison to other well-known clustering methods from literature.","PeriodicalId":195948,"journal":{"name":"2014 Brazilian Conference on Intelligent Systems","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130939802","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
Clustering Search Applied to Rank Aggregation 聚类搜索在秩聚合中的应用
2014 Brazilian Conference on Intelligent Systems Pub Date : 2014-10-18 DOI: 10.1109/BRACIS.2014.44
L. A. N. Lorena, Ana Carolina Lorena, L. A. N. Lorena, A. Carvalho
{"title":"Clustering Search Applied to Rank Aggregation","authors":"L. A. N. Lorena, Ana Carolina Lorena, L. A. N. Lorena, A. Carvalho","doi":"10.1109/BRACIS.2014.44","DOIUrl":"https://doi.org/10.1109/BRACIS.2014.44","url":null,"abstract":"Several practical applications require joining various rankings into a consensus ranking. These applications include gathering the results of multiple queries in information retrieval, deciding the result of a poll involving multiple judges and joining the outputs from ranking classification algorithms. Finding the ranking that best represents a set of rankings is a NP-hard problem, but a good solution can be found by using met heuristics. In this paper, we investigate the use of Clustering Search (CS) algorithm allied to Simulated Annealing (SA) for solving the rank aggregation problem. CS will clusters the solutions found by SA in order to find promising regions in the search space, that can be further exploited by a local search. Experimental results on benchmark data sets show the potential of this approach to find a consensus ranking, achieving similar or better solutions than those found by other popular rank aggregation strategies.","PeriodicalId":195948,"journal":{"name":"2014 Brazilian Conference on Intelligent Systems","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134491989","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学术官方微信
小红书