Andressa Kappaun, Karine Camargo, Fábio Medeiros Rangel, Fabrício Firmino de Faria, P. Lima, Jonice Oliveira
{"title":"Evaluating Binary Encoding Techniques for WiSARD","authors":"Andressa Kappaun, Karine Camargo, Fábio Medeiros Rangel, Fabrício Firmino de Faria, P. Lima, Jonice Oliveira","doi":"10.1109/BRACIS.2016.029","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.029","url":null,"abstract":"Many weightless neural networks, such as WiSARD, are RAM-based classifiers that receive binary data as input. In order to convert raw data into binary input, several techniques are applicable. This work evaluates the impact of some of these binarization techniques on the accuracy of two types of classifiers: WiSARD model and WiSARD with bleaching mechanism. The binary encoding techniques explored were: (i) thermometer, (ii) threshold, (iii) local threshold, (iv) Marr-Hildreth filter, and (v) Laplacian filter. The MNIST digit dataset was used to compare the accuracy obtained by each encoding technique. Results showed a difference of more than 20% in the accuracy due to the choice of encoding approach.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"67 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":"131537443","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}
{"title":"Anomaly Detection under Cost Constraint","authors":"Bruno Barbarioli, R. Assunção","doi":"10.1109/BRACIS.2016.053","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.053","url":null,"abstract":"Anomaly detection is commonly used in fraud analysis. However, budget constraints can turn the audit process unfeasible when a sizable number of anomalies are identified. We propose a method to select cases probabilistically based on their impact, but guaranteeing that the relative discrepancy between the observed values and the expected behaviour are also taken into account. We apply the proposed method to a project designed to monitor the Brazilian public health care payment system in search for fraudulent behaviour.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"31 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":"133473642","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}
Tarcisio Pontes, Renato Vimieiro, Teresa B Ludermir
{"title":"SSDP: A Simple Evolutionary Approach for Top-K Discriminative Patterns in High Dimensional Databases","authors":"Tarcisio Pontes, Renato Vimieiro, Teresa B Ludermir","doi":"10.1109/BRACIS.2016.072","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.072","url":null,"abstract":"It is a great challenge to companies, governments and researchers to extract knowledge in high dimensional databases. Discriminative Patterns (DPs) is an area of data mining that aims to extract relevant and readable information in databases with target attribute. Among the algorithms developed for search DPs, it has highlighted the use of evolutionary computing. However, the evolutionary approaches typically (1) are not adapted for high dimensional problems and (2) have many nontrivial parameters. This paper presents SSDP (Simple Search Discriminative Patterns), an evolutionary approach to search the top-k DPs adapted to high dimensional databases that use only two easily adjustable external parameters.","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":"116604363","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}
{"title":"Improved Airport Ground Traffic Control with Domain-Dependent Heuristics","authors":"Augusto B. Corrêa, A. Pereira, M. Ritt","doi":"10.1109/BRACIS.2016.024","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.024","url":null,"abstract":"In this paper we study the application of a domain-dependent heuristic to airport ground traffic control. We consider two variants of the problem. In the first, proposed for the International Planning Competition in 2004, the in-bound and out-bound airplanes have fixed parking and take-off positions. In the second, more realistic variant a controller can assign dynamically for each airplane the runway for take-off or the parking position, such that the total movement of planes at the airport is minimized. We are particularly interested in the second variant, which has an implicitly defined goal state where multiple states could satisfy the goal condition, and the impact of this fact on domain-independent and domain-dependent heuristics. We compare domain-independent heuristics in the Fast Downward planner on this domain to a domain-dependent heuristic.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"219 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":"130420123","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}
Edson Wilian da Silva, Luiz A. Celiberto, Robson Santos Franca
{"title":"Multiagent Circumnavigation by Reactive Decentralized Algorithm","authors":"Edson Wilian da Silva, Luiz A. Celiberto, Robson Santos Franca","doi":"10.1109/BRACIS.2016.085","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.085","url":null,"abstract":"This paper presents the problem of reach and circumnavigation in multi-agent systems without direct communication among agents. The proposed solution is based on a decentralized and reactive algorithm executed by each agent and the emerging collective behavior from the interaction of such agents. The outcomes of the implementation and further execution of the simulation platform in the NetLogo environment show the effectiveness of the proposed algorithm.","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":"122229273","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}
R. Glatt, Felipe Leno da Silva, Anna Helena Reali Costa
{"title":"Towards Knowledge Transfer in Deep Reinforcement Learning","authors":"R. Glatt, Felipe Leno da Silva, Anna Helena Reali Costa","doi":"10.1109/BRACIS.2016.027","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.027","url":null,"abstract":"Driven by recent developments in the area of Artificial Intelligence research, a promising new technology for building intelligent agents has evolved. The technology is termed Deep Reinforcement Learning (DRL) and combines the classic field of Reinforcement Learning (RL) with the representational power of modern Deep Learning approaches. DRL enables solutions for difficult and high dimensional tasks, such as Atari game playing, for which previously proposed RL methods were inadequate. However, these new solution approaches still take a long time to learn how to actuate in such domains and so far are mainly researched for single task scenarios. The ability to generalize gathered knowledge and transfer it to another task has been researched for classical RL, but remains an open problem for the DRL domain. Consequently, in this article we evaluate under which conditions the application of Transfer Learning (TL) to the DRL domain improves the learning of a new task. Our results indicate that TL can greatly accelerate DRL when transferring knowledge from similar tasks, and that the similarity between tasks plays a key role in the success or failure of knowledge transfer.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"1 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":"115127954","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}
{"title":"A New Estimation Distributed Algorithm Applied to a Many-Objective Discrete Optimization Problem","authors":"Glauber Botelho, André Britto, Leila Silva","doi":"10.1109/BRACIS.2016.081","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.081","url":null,"abstract":"Many-Objective Optimization Problems are problems that have more than three objective functions. For a small number of objective functions, Multi-Objective Evolutionary Algorithms provide good results, but when the number of objective functions grows, these algorithms present scalability problems. In this paper we focus on Multi-Objective Discrete Problems (MODO) with many objectives. We propose a new Estimation Distributed Algorithm (EDA) applied to MODO, called ArchEDA, with the aim of improving the results achived by MOEAs. The main idea is to combine EDA with archiving methods, in order to select the solutions used on the probabilistic models. To evaluate Arch-EDA we apply the algorithm to the 0/1 Multi-Objective Knapsack Problem, considering two to ten objective functions and a set of benchmarking instances. The results achieved are compared, through statistical analysis, with the NSGA-III, NSGA-II and SPEA2 algorithms.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"8 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":"126596660","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}
Richard A. Gonçalves, C. Almeida, L. M. Pavelski, Sandra M. Venske, J. Kuk, A. Pozo
{"title":"Adaptive Operator Selection in NSGA-III","authors":"Richard A. Gonçalves, C. Almeida, L. M. Pavelski, Sandra M. Venske, J. Kuk, A. Pozo","doi":"10.1109/BRACIS.2016.042","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.042","url":null,"abstract":"Many-objective optimization (four or more objectives) presents many challenges to be considered, highlighting the need to create better algorithms prepared to deal efficiently with the increasing number of objectives. One such challenge is to determine the most efficient operator or combination of operators to be used during the optimization. In order to deal with this challenge, we propose the use of adaptive operator selection mechanisms in many-objective optimization algorithms. Two adaptive operator selection mechanisms, Adaptive Pursuit (AP) and Probability Matching (PM), are incorporated into the NSGA-III framework (a recently proposed, state-of-the-art algorithm to solve many-objective problems) to autonomously select the most suitable operator while solving a many-objective problem, according to the previous performance of each operator. The proposed algorithms, NSGA-IIIAP and NSGA-IIIPM, are tested in four different multi-objective problems from the DTLZ test suite with 3 up to 20 objectives. Statistical tests were performed to infer the significance of the results. The hypothesis that adaptive ways to select the operator to be applied during each stage of the evolutionary process is an effective way to improve the performance of the NSGA-III framework is corroborated by our results.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"2 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":"134022277","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}
{"title":"DualRadviz: Preserving Context between Classification Evaluation and Data Exploration with RadViz","authors":"Igor Bueno Correa, A. Carvalho","doi":"10.1109/BRACIS.2016.052","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.052","url":null,"abstract":"With today's flood of data coming from many types of sources, Machine Learning becomes increasingly important. Though, many times the use of Machine Learning is not enough to make sense of all this data. This makes visualization a very useful tool for Machine Learning practitioners and data analysts alike. Interactive visualization techniques can be very helpful by giving insight on the meaning of the output from classification tasks. This also applies to the data itself, as visualization can make some characteristics of the data become clear. Several bi-dimensional projection methods have been used to visualize data instances based on their attribute values. This visualization is more difficult when the instances have a large number of attributes. One of the visualization techniques that can deal with high dimensional data is Radial Coordinates Visualization (RadViz). RadViz can also be employed to visualize the performance of a probabilistic classifier, helping a user to find problematic instances that might have been misclassified. In this study, a new approach to use RadViz is proposed and investigated. The proposed approach combines the two aforementioned uses of RadViz (attribute-based data exploration and result exploration based on the output of probabilistic classification). For such, it approach provides an easy transition between the two types of visualization. This allows the context to be preserved, since the user can visually track the same data instance from one type of visualization to the other. In order to evaluate the proposed approach, a prototype, named DualRadviz, was implemented. On this prototype, in addition to RadViz, visualization by Parallel Coordinates is also provided, so that precise instance inspection can be performed, since, different from RadViz, Parallel coordinates visualization does not suffer from ambiguity. To illustrate the usefulness of the proposed method, a case study is presented.","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":"123548183","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}
{"title":"Automatic Identification of Security Risks in Edicts for Software Procurement","authors":"R. N. Peclat, G. N. Ramos","doi":"10.1109/BRACIS.2016.057","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.057","url":null,"abstract":"Brazilian Federal Institutions must obtain software tools by procurement, requiring that their software teams develop, verify and audit their specifications to ensure that software security risks concerns are clearly included in edicts. This work presents the Automated Analyst of Edicts tool for aiding the analysis of such document by automatically identifying the absence of relationships between its sentences and software security risks or security weaknesses concepts. This tool was tested on over 100 documents and compared to software security experts' performance for multi-label classification into five of the OWASP Top Ten risks. Specificity of 83% was achieved when analyzing individual sentences for multiple risks, and 90% negative prediction probability when applied to specific risk sentence relationships.","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":"115332128","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}