{"title":"Finding Inference Rules Using Graph Mining in Ontological Knowledge Bases","authors":"L. Navarro, Estevam Hruschka, A. P. Appel","doi":"10.1109/BRACIS.2016.070","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.070","url":null,"abstract":"The exponentially grow of Web and data availability, the semantic web area has expanded and each day more data is expressed as knowledge bases. Knowledge bases (KB) used in most projects are represented in an ontology-based fashion, so the data can be better organized and easily accessible. It is common to map these KBs into a graph when trying to induce inference rules from the KB, thus it is possible to apply graph-mining techniques to extract implicit knowledge. One common graph-based task is link prediction, which can be used to predict edges (new facts for the KB) that will appear in a near future. In this paper, we present Graph Rule Learner (GRL), a method designed to extract inference rules from ontological knowledge bases mapped to graphs. GRL is based on graph-mining techniques, and explores the combination of link prediction metrics. Empirical analysis revealed GRL can successfully be applied to NELL(Never-Ending Language Learner) helping the system to infer new KB beliefs from existing beliefs (a crucial task for a never-ending learning system).","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"37 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":"127051519","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}
Tiago Buarque Assunção de Carvalho, M. Sibaldo, Ing Ren Tsang, George D. C. Cavalcanti, I. Tsang, Jan Sijbers
{"title":"Pixel Clustering for Face Recognition","authors":"Tiago Buarque Assunção de Carvalho, M. Sibaldo, Ing Ren Tsang, George D. C. Cavalcanti, I. Tsang, Jan Sijbers","doi":"10.1109/BRACIS.2016.032","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.032","url":null,"abstract":"This work proposes a theoretical framework for an unsupervised feature extraction called Pixel Clustering. The main idea is based on the clustering of the pixels in order to mitigate the multicollinearity issue and a new feature is extracted for each cluster of similar pixels. This allows to define feature extraction techniques by setting just three parts: (1) defining pixel vectors in the training set, each pixel vector is a representative for a pixel on every training image, (2) a clustering algorithm for the pixels vectors, (3) finally it is performed a linear combination of the pixel into a cluster, in order to create a single feature per cluster. The framework also makes it possible to create simpler, computationally cheaper and more general new implementations of well known feature extraction methods such as Waveletfaces. Two extraction methods are implemented and tested in three face datasets. Test results are compared to the traditional Eigenfaces and others state-of-art feature extraction methods for face recognition. The proposed method achieves up to 38% higher face recognition rate than Eigenfaces, if few classes are used for training the projections.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"58 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":"127194883","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":"Exploring Unsupervised Features in Conditional Random Fields for Spanish Named Entity Recognition","authors":"J. Copara, J. Ochoa, Camilo Thorne, Goran Glavas","doi":"10.1109/BRACIS.2016.059","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.059","url":null,"abstract":"Unsupervised features such as word representations mostly given by word embeddings have been shown significantly improve semi supervised Named Entity Recognition (NER) for English language. In this work we investigate whether unsupervised features can boost (semi) supervised NER in Spanish. To do so, we use word representations and collocations as additional features in a linear chain Conditional Random Field (CRF) classifier. Experimental results (82.44% F-score on the CoNLL-2002 corpus and 65.72% F-score on Ancora Corpus) show that our approach is comparable to some state-of-art Deep Learning approaches for Spanish, in particular when using cross-lingual Word Representations.","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":"131188792","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}
Jonatas Wehrmann, Rodrigo C. Barros, Gabriel S. Simões, Thomas S. Paula, D. Ruiz
{"title":"(Deep) Learning from Frames","authors":"Jonatas Wehrmann, Rodrigo C. Barros, Gabriel S. Simões, Thomas S. Paula, D. Ruiz","doi":"10.1109/BRACIS.2016.012","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.012","url":null,"abstract":"Learning content from videos is not an easy task and traditional machine learning approaches for computer vision have difficulties in doing it satisfactorily. However, in the past couple of years the machine learning community has seen the rise of deep learning methods that significantly improve the accuracy of several computer vision applications, e.g., Convolutional Neural Networks (ConvNets). In this paper, we explore the suitability of ConvNets for the movie trailers genre classification problem. Assigning genres to movies is particularly challenging because genre is an immaterial feature that is not physically present in a movie frame, so off-the-shelf image detection models cannot be directly applied to this context. Hence, we propose a novel classification method that encapsulates multiple distinct ConvNets to perform genre classification, namely CoNNECT, where each ConvNet learns features that capture distinct aspects from the movie frames. We compare our novel approach with the current state-of-the-art techniques for movie classification, which make use of well-known image descriptors and low-level handcrafted features. Results show that CoNNECT significantly outperforms the state-of-the-art approaches in this task, moving towards effectively solving the genre classification problem.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"11 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114052130","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":"The Role of Discount Factor in Risk Sensitive Markov Decision Processes","authors":"Valdinei Freire","doi":"10.1109/BRACIS.2016.092","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.092","url":null,"abstract":"Markov Decision Processes (MDPs) have long been the framework for modeling optimal decisions in stochastic environments. Although less known, Risk Sensitive Markov Decision Processes (RSMDP) extend MDPs by allowing arbitrary risk attitude. However, not every environment is well-defined in MDPs and RSMDPs and both versions make use of discount in costs to turn every problem well-defined, because of the exponential grow in RSMDPs, the problem of a well-defined problem is even harder. Here, we show that the use of discount in costs: (i) in MDPs induces a risk-prone attitude in MDPs, and (ii) in MDPs, hinders risk-averse attitude for some scenarios.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"71 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":"125981625","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 Risk Averse Policy for Goal-Directed Risk-Sensitive Markov Decision Process","authors":"Valdinei Freire, K. V. Delgado","doi":"10.1109/BRACIS.2016.025","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.025","url":null,"abstract":"The Goal-Directed Risk-Sensitive Markov Decision Process allows arbitrary risk attitudes for the probabilistic planning problem to reach a goal state. In this problem, the risk attitude is modeled by an expected exponential utility and a risk factor λ. However, the problem is not well defined for every λ, posing the problem of defining the maximum (extreme) value for this factor. In this paper, we propose an algorithm to find this e-extreme risk factor and the corresponding optimal policy.","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":"128540604","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":"Knowledge Representation for Argumentation in Agent-Oriented Programming Languages","authors":"Alison R. Panisson, Rafael Heitor Bordini","doi":"10.1109/BRACIS.2016.014","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.014","url":null,"abstract":"Argumentation in multi-agent systems provides both a mechanism for agent reasoning under uncertainty and conflicting information as well as for communication in a more elaborate way, allowing agents to understand each other through the exchange of additional information when compared to other forms of agent communication. Even though argumentation techniques can play an important role in multi-agent systems, little research has been carried out on the issues in integrating argumentation techniques and agent-oriented programming languages, which would allow the development of practical applications taking advantage of such combined techniques. In this work, we present an argumentation framework developed on the basis of an agent-oriented programming language. We cover mainly the practical aspects of such integration, focusing on the knowledge representation expressivity resulting from it. Our approach allows the development of multi-agent applications where agents are able to use arguments in their decision-making processes as well as for communication. The framework has been successfully used as part of the development of a healthcare multi-agent prototype application.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"132 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":"121967417","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}
Filipe F. R. Damasceno, Marcelo B. A. Veras, D. Mesquita, J. Gomes, Carlos Brito
{"title":"Shrinkage k-Means: A Clustering Algorithm Based on the James-Stein Estimator","authors":"Filipe F. R. Damasceno, Marcelo B. A. Veras, D. Mesquita, J. Gomes, Carlos Brito","doi":"10.1109/BRACIS.2016.084","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.084","url":null,"abstract":"In this work, we propose Shrinkage k-means (Sk-means), a novel variant of k-means based on the James-Stein estimator for the mean of a multivariate normal given a single sample point. We evaluate Sk-means on both synthetic and real-world data. The proposed method outperformed standard clustering methods and also the existing method based on k-means which uses the James-Stein estimator. Results also suggest that Sk-means is robust to outliers.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"61 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":"134497704","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 Pareto-Based Symbiotic Relationships Model for Unconstrained Continuous Optimization","authors":"Leanderson André, R. S. Parpinelli","doi":"10.1109/BRACIS.2016.066","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.066","url":null,"abstract":"Symbiotic relationships are one of several phenomena that can be observed in nature. These relationships consist of interactions between organisms and can lead to benefits or damages to those involved. In an optimization context, symbiotic relationships can be used to perform information exchange between populations of candidate solutions to a given problem. This paper presents an information exchange model inspired by symbiotic relationships and applies the model to unconstrained single-objective continuous optimization problems. The symbiotic relationships are modelled using the Pareto dominance criteria inside a computational ecosystem for optimization. The Artificial Bee Colony algorithm is used to compound the populations of the ecosystem. Four models of relationships are analyzed: slavery, competition, altruism and mutualism. Thirty unconstrained single-objective continuous benchmark functions with high number of dimensions (d = 200) are tested and obtained results compared. Results suggest that the proposed model for information exchange favors the balance between exploration and exploitation leading to better results.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"43 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":"129410727","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}
L. Almeida, C. Zanchettin, Hilton Pintor Bezerra Leite
{"title":"Building Ensembles with Classifier Selection Using Self-Organizing Maps","authors":"L. Almeida, C. Zanchettin, Hilton Pintor Bezerra Leite","doi":"10.1109/BRACIS.2016.087","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.087","url":null,"abstract":"Improving the performance of supervised classification methods is a subject of many literature works. An efficient strategy is the adoption of an ensemble of classifiers to divide the classification problem. In ensembles with classifier selection, there is no fusion of the classifiers decisions. A particular classifier is selected according to the input data instead. In this paper, well-known clustering methods based on self-organizing structures are used to implement ensembles with classifier selection. The self-organizing structures are used to detect the topological structure of data and help to divide the problem into smaller and easier sub-problems to solve. Experiments with different datasets show that the use of clustering methods to perform the classifier selection can contribute to split the problem and improve the classification accuracy compared to some traditional strategies. Additionally, the results encourage the development of more research to find out other ways to split problems using data clustering techniques.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"27 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":"132765320","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}