S. M. D. M. Maia, E. Goldbarg, Lucas D. M. dos S. Pinheiro, M. Goldbarg
{"title":"Tabu Search with Ejection Chain for the Biobjective Adjacent-Only Quadratic Spanning Tree","authors":"S. M. D. M. Maia, E. Goldbarg, Lucas D. M. dos S. Pinheiro, M. Goldbarg","doi":"10.1109/BRACIS.2016.064","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.064","url":null,"abstract":"Given an edge-weighted simple graph G, the minimum quadratic spanning tree problem consists in finding a spanning tree of G such that the sum of the weights of its edges plus the sum of the product of the weights of pairs of edges is minimum over all spanning trees of G. When the product of the weights of pairs of edges is calculated only for adjacent edges, the problem is called adjacent-only minimum quadratic spanning tree. This problem belongs to NP-hard. In this study we investigate the performance of a tabu search algorithm with ejection chain for the bi-objective version of this problem. An experiment with 168 instances is reported.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"56 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":"126231763","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}
Rogerio C. P. Fragoso, Roberto H. W. Pinheiro, George D. C. Cavalcanti
{"title":"A Method for Automatic Determination of the Feature Vector Size for Text Categorization","authors":"Rogerio C. P. Fragoso, Roberto H. W. Pinheiro, George D. C. Cavalcanti","doi":"10.1109/BRACIS.2016.055","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.055","url":null,"abstract":"In this paper, we propose a feature selection method for text categorization based on the filtering approach named Automatic Feature Subsets Analyzer (AFSA). The AFSA extends the Class-dependent Maximum Features per Document (cMFDR) algorithm and automatically defines the best number of features per document. In the cMFDR algorithm, the number of features is selected after a repetitive application of the methods which is a time-consuming strategy. In contrast, AFSA finds the best number of features in a data-driven way which is faster than cMFDR. The experiments with the Naïve Bayes Multinomial classifier, using four benchmark datasets, and three Feature Evaluation Function showed that the AFSA outperforms or presents similar results when compared with the cMFDR.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"4 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":"115481772","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":"Using the Causal Graph to Enhance Translations to Solve Contingent Planning Problems","authors":"Ignasi Andrés, L. N. Barros","doi":"10.1109/BRACIS.2016.023","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.023","url":null,"abstract":"Planning with partial observation, an area called contingent planning, is a complex and challenging problem since it requires to keep track of belief states to search for a contingent plan of actions. Recent approaches considers the agent's knowledge about the world to compile a contingent planning problem into a full observable planning problem, described in an epistemic logic language, and then use an efficcient full observable planner to solve the translated problem. In this paper we use the concept of relevance and causality to propose a new translation based in a structure called Causal Graph that can improve the belief tracking task of contingent Planning problems described in a more general planning language, in particular problems envolving actions with uncertainty on its conditional effects.","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":"126438277","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}
Hilário Oliveira, Rinaldo Lima, R. Lins, F. Freitas, M. Riss, S. Simske
{"title":"A Concept-Based Integer Linear Programming Approach for Single-Document Summarization","authors":"Hilário Oliveira, Rinaldo Lima, R. Lins, F. Freitas, M. Riss, S. Simske","doi":"10.1109/BRACIS.2016.079","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.079","url":null,"abstract":"Automatic single-document summarization is a process that receives a single input document and outputs a condensed version with only the most relevant information. This paper proposes an unsupervised concept-based approach for singledocument summarization using Integer Linear Programming (ILP). Such an approach maximizes the coverage of the important concepts in the summary, avoiding redundancy, and taking into consideration some readability aspects of the generated summary as well. A new weighting method that combines both coverage and position of the sentences is proposed to estimate the importance of a concept. Moreover, a weighted distribution strategy that prioritizes sentences at the beginning of the document if they have relevant concepts is investigated. The readability of the generated summaries is improved by the inclusion of constraints into the ILP model to avoid dangling coreferences and breaks in the normal discourse flow of the document. Experimental results on the DUC 2001-2002 and the CNN corpora demonstrated that the proposed approach is competitive with state-of-the-art summarizers evaluated regarding the traditional ROUGE scores.","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":"130036180","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":"An Ontology for Property Crime Based on Events from UFO-B Foundational Ontology","authors":"C. Rodrigues, F. Freitas, R. Azevedo","doi":"10.1109/BRACIS.2016.067","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.067","url":null,"abstract":"Property Crime has been highlighted as one of the major criminal offenses within the Brazilian Legal System. Moreover, it is common that there is some misunderstanding amongst the subtypes of this crime, such as Theft, Robbery, Misappropriation, and Extortion. We still emphasize the verynuance of legal literature that makes this domain as hostile as challenging: a weakly formalized knowledge, the presence of conflicts and ambiguities between norms, the heterogeneity of legal literature, as well as the diversity in reasoning models. Therefore, this article presents, inspired by UFO-B foundational ontology, a conceptual model for the representation of crimes against property in the Brazilian Criminal Code, in order to support some decision-making process, as the agents behavior classification and the inference of punishments. Thus, we present throughout this article, an ontological formalization for the Theory of Crime from Brazilian Penal Code, as well as for Property Crimes applications.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"47 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":"130544664","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":"Extreme Learning Machines for Datasets with Missing Values Using the Unscented Transform","authors":"D. Mesquita, J. Gomes, L. R. Rodrigues","doi":"10.1109/BRACIS.2016.026","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.026","url":null,"abstract":"The existence of missing data is a common fact in real applications which can significantly affect the data analysis process. In order to overcome this problem, many methods have been proposed in the literature. Extreme Learning Machine (ELM) has become a very popular research topic in machine learning and artificial intelligence areas due to its characteristics such as fast training procedure, good generalization and universal approximation capability. Although ELM has been successfully applied in different domains, its basic formulation cannot handle datasets with missing values properly. This paper presents a variant of the Extreme Learning Machine (ELM) for datasets with missing values. In the proposed method, probability distributions for the missing values are estimated using the expectation maximization (EM) algorithm, assuming that data is normally distributed. The Unscented Transform (UT) is used to estimate the values of the hidden layer outputs, and the weights of the output layer are assigned using the Moore-Penrose Pseudoinverse. Numerical experiments are carried out in order to evaluate the performance of the proposed method in four real world and two synthetic regression datasets. The results show that the proposed method presented a good performance in terms of Average Root-Mean-Squared Error (ARMSE).","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":"130850558","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":"Image Classification Using Sum-Product Networks for Autonomous Flight of Micro Aerial Vehicles","authors":"B. Sguerra, Fabio Gagliardi Cozman","doi":"10.1109/BRACIS.2016.035","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.035","url":null,"abstract":"Flying autonomous micro aerial vehicles (MAVs) in indoor environments is still a challenging task, as MAVs are not capable of carrying heavy sensors as Lidar or RGD-B, and GPS signals are not reliable indoors. We investigate a strategy where image classification is used to guide a MAV, one of the main requirements then is to have a classifier that can produce results quickly during operation. The goal here is to explore the performance of Sum-Product Networks and Arithmetic Circuits as image classifiers, because these formalisms lead to deep probabilistic models that are tractable during operation. We have trained and tested our classifiers using the Libra toolkit and real images. We describe our approach and report the result of our experiments in the paper.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"100 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":"115828521","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":"Time Series Imputation Using Genetic Programming and Lagrange Interpolation","authors":"Damares C. O. de Resende, Á. Santana, F. Lobato","doi":"10.1109/BRACIS.2016.040","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.040","url":null,"abstract":"Time series have been used in several applications such as process control, environment monitoring, financial analysis and scientific researches. However, in the presence of missing data, this study may become more complex due to a strong break of correlation among samples. Therefore, this work proposes an imputation method for time series using Genetic Programming (GP) and Lagrange Interpolation. The heuristic adopted builds an interpretable regression model that explores time series statistical features such as mean, variance and auto-correlation. It also makes use of interrelation among multivariate time series to estimate missing values. Results show that the proposed method is promising, being capable of imputing data without loosing the dataset's statistical properties, as well as allowing a better understanding of the missing data pattern from the obtained interpretable model.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"35 9 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":"125725260","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}
Thiago Fialho de Queiroz Lafetá, Marcos L. P. Bueno, Christiane Regina Soares Brasil, G. Oliveira
{"title":"Many-Objective Evolutionary Algorithms for Multicast Routing with Quality of Service Problem","authors":"Thiago Fialho de Queiroz Lafetá, Marcos L. P. Bueno, Christiane Regina Soares Brasil, G. Oliveira","doi":"10.1109/BRACIS.2016.043","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.043","url":null,"abstract":"In order to guarantee a proper end-to-end communication in computer networks, many applications impose Quality of Service (QoS) requirements. In QoS routing, multiple conflicting objectives are optimized simultaneously. On the other hand, multicasting (i.e. sending data to multiple destinations) in its simplest form is a computationally difficult problem, which becomes more challenging when QoS requirements are considered. Previous works have investigated the use of multi-objective evolutionary algorithms (MOEAs) in the multicast routing with QoS problem under a Pareto-dominance approach. In particular, the so-called SPEA2 algorithm has provided good results in problem formulations involving up to four objectives. However, it has been recognized that for higher-dimension problems the convergence of MOEAs can decline substantially. In this work, we propose a model for routing based on the many-objectives algorithm MEAMT (multi-objective evolutionary algorithms with many tables), aiming at better dealing with the difficulty faced by state-of-the-art routing methods when solving for higherdimensional formulations. We present the new model for multicast routing based on MEAMT, as well as report experiments on a comparison with SPEA2-based routing in formulations involving 4, 5 and 6 objectives over several problem instances with different topologies and sizes. The results indicate that the new routing model overcomes SPEA2 in most cases, specially when solving for higher dimensional problems in routing.","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":"125358997","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}
C. Souza, José Remígio, F. Aragão, E. Costa, J. Fechine
{"title":"Investigating How \"Good\" Characteristics' Presence Are Related with Questions' Performance: An Empirical Study on a Programming Community","authors":"C. Souza, José Remígio, F. Aragão, E. Costa, J. Fechine","doi":"10.1109/BRACIS.2016.060","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.060","url":null,"abstract":"Social query is the practice of sharing questions through collaborative environments. In order to receive help, askers usually broadcast their requests to the entire community. However, the prerequisite to receive help is to have the problem noticed by someone who is able and available to answer. Previous works have identified a correlation between the characteristics of the questions and the outcome of receiving or not an answer. These findings suggest that there are some characteristics that are more likely to attract the helpers' attention. Our proposal is to analyze the CQA history to identify how these so-called \"good\" characteristics affect the performance of shared questions. Our results suggest that: (1) answered questions present more of these \"good\" characteristics than unanswered ones, (2) the more \"good\" characteristics are present in a question, the more people it attracts, (3) the more people are attracted by a question, the faster it will be answered and more responses will be received, (4) answered questions attract more people than unanswered ones, (5) difficulty does not play a role in attracting people.","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":"116912155","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}