Alvaro Vitor Polati de Souza, W. M. Caminhas, L. A. Aguirre
{"title":"Empregando o Neo Fuzzy Neuron para Modelagem de um Conjunto de Dados Fisiológicos e Avaliação do Monitoramento de Apnéia – Um Estudo de Caso","authors":"Alvaro Vitor Polati de Souza, W. M. Caminhas, L. A. Aguirre","doi":"10.21528/LNLM-VOL1-NO2-ART3","DOIUrl":"https://doi.org/10.21528/LNLM-VOL1-NO2-ART3","url":null,"abstract":"","PeriodicalId":386768,"journal":{"name":"Learning and Nonlinear Models","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133019541","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":"Técnica Não Destrutiva para Diagnóstico de Concreto a Partir de Termografia e Redes Neurais Artificiais","authors":"Roberto Pettres, Luiz Alkimin de Lacerda","doi":"10.21528/LNLM-VOL10-NO1-ART3","DOIUrl":"https://doi.org/10.21528/LNLM-VOL10-NO1-ART3","url":null,"abstract":"","PeriodicalId":386768,"journal":{"name":"Learning and Nonlinear Models","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133038674","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":"Coreference Resolution in Portuguese: Detecting Person, Location and Organization","authors":"E. Fonseca, R. Vieira, Aline A. Valin","doi":"10.21528/LNLM-VOL12-NO2-ART2","DOIUrl":"https://doi.org/10.21528/LNLM-VOL12-NO2-ART2","url":null,"abstract":"Coreference resolution is a task of great relevance for Natural Language Processing area, given that the performance of many other tasks depends on the correct output of this type of system, especially the extraction of relationships between named entities. The present work aims at resolving coreference in Portuguese, focusing on the following categories of named entities: Person, Location and Organization. The proposed method uses supervised learning. To this end, the selection and implementation of features that assist in the correct classification are fundamental, since the classification model is built from this data. KeywordsCoreference Resolution; Natural Language Processing; Named Entities, Machine Learning.","PeriodicalId":386768,"journal":{"name":"Learning and Nonlinear Models","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133262650","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}
Anthony Lins, Fernando Buarque de Lima-Neto, C. B. Filho
{"title":"Paralelização de Algoritmos de Busca baseados em Cardumes através de Unidades de Processamento Gráfico","authors":"Anthony Lins, Fernando Buarque de Lima-Neto, C. B. Filho","doi":"10.21528/LNLM-VOL13-NO1-ART1","DOIUrl":"https://doi.org/10.21528/LNLM-VOL13-NO1-ART1","url":null,"abstract":"","PeriodicalId":386768,"journal":{"name":"Learning and Nonlinear Models","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123160292","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":"CQChecker: A Tool to Check Ontologies in OWL-DL using Competency Questions written in Controlled Natural Language","authors":"Camila Bezerra, Filipe Santana, F. Freitas","doi":"10.21528/LNLM-VOL12-NO2-ART4","DOIUrl":"https://doi.org/10.21528/LNLM-VOL12-NO2-ART4","url":null,"abstract":"Competency Questions (CQs) play an important role in ontology development lifecycles as they represent functional ontology requirements. One of the main problems that hamper their proper use lies in the lack of tools that assist users to check if CQs are being fulfilled by the ontology being defined, particularly when these ontologies are defined in OWL (Ontology Web Language) under Description Logic formalism. Recently there has been a trend in checking CQs against ontologies using the RDF query engine SPARQL. Naturally, this language, being created for the formalism of Semantic Networks, is clearly not expressive enough, and, thus, inadequate to check the fulfillment of OWL CQs. As SPARQL queries can be performed only at the assertional level (instances), or at most the schema level, they are not shaped to entail an answer which may be deduced by the ontology using a subsumption not explicit in the ontology. The tool takes advantage of the WordNet lexical to deal with synonyms and adjectives stated in the CQs. In some cases, the tool shows an explanation of why the CQ being treated is considered valid with regard to the ontology. We present the tool’s architecture, capabilities and test examples against a number of controlled natural language CQs. Keywordscompetency questions, checking, ontology.","PeriodicalId":386768,"journal":{"name":"Learning and Nonlinear Models","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115656340","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 Review on Evolving Interval and Fuzzy Granular Systems","authors":"D. Leite, P. Costa, F. Gomide","doi":"10.21528/LNLM-VOL14-NO2-ART3","DOIUrl":"https://doi.org/10.21528/LNLM-VOL14-NO2-ART3","url":null,"abstract":"This article provides definitions and principles of granular computing and discusses the generation and online adaptation of rule-based models from data streams. Essential notions of interval analysis and fuzzy sets are addressed from the granular computing point of view. The article also covers different types of aggregation operators which perform information fusion by gathering large volumes of dissimilar information into a more compact form. We briefly summarize the main historical landmarks of evolving intelligent systems leading to the state of the art. Evolving granular systems extend evolving intelligent systems allowing data, variables and parameters to be granules (intervals and fuzzy sets). The aim of the evolution of granular systems is to fit the information carried by data streams from time-varying processes into rule-based models and, at the same time, provide granular approximation of functions and linguistic description of the system behavior.","PeriodicalId":386768,"journal":{"name":"Learning and Nonlinear Models","volume":"14 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124622440","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}
Rommel N. Carvalho, E. D. Paiva, Henrique A. Da Rocha, Gilson Libório Mendes
{"title":"Using Clustering and Text Mining to Create a Reference Price Database","authors":"Rommel N. Carvalho, E. D. Paiva, Henrique A. Da Rocha, Gilson Libório Mendes","doi":"10.21528/LNLM-VOL12-NO1-ART3","DOIUrl":"https://doi.org/10.21528/LNLM-VOL12-NO1-ART3","url":null,"abstract":"Since 2004, Brazil’s Office of the Comptroller General (CGU) has been publishing several data related to government expenditures in the Transparency Portal. In 2010, CGU started publishing daily every financial statement produced by the Federal Government. Nevertheless, inconsistencies which hinder accountability have been found in this data base. This paper presents how CGU uses clustering and text mining techniques to retrieve essential information for a good accountability, which includes what was bought, the price paid per item, a price reference per product, etc. This analysis has allowed CGU to draw some preliminary conclusions which are presented as a means to illustrate the research results. Finally, this information will eventually be incorporated in the Transparency Portal, allowing every citizen to understand how much the Government is really paying, in general, for products. Thus, improving social control and providing a solid accountability not only to CGU, as an internal control agency, but also to Brazil’s citizens who, in the end, are the ones paying the bill.","PeriodicalId":386768,"journal":{"name":"Learning and Nonlinear Models","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128443705","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 self-organizing genetic algorithm for protein structure prediction","authors":"Vinicius Tragante, R. Tinós","doi":"10.21528/lnlm-vol8-no3-art2","DOIUrl":"https://doi.org/10.21528/lnlm-vol8-no3-art2","url":null,"abstract":"In the Genetic Algorithm (GA) with the standard random immigrants approach, a fixed number of individuals of the current population are replaced by random individuals in every generation. The random immigrants inserted in every generation maintain, or increase, the diversity of the population, what is advantageous to GAs applied to complex problems like the protein structure prediction problem. The rate of replaced individuals in the standard random immigrants approach is defined a priori, and has a major influence on the performance of the algorithm. In this paper, we propose a new strategy to control the number of random immigrants in GAs applied to the protein structure prediction problem. Instead of using a fixed number of immigrants per generation, the proposed approach controls the number of new individuals to be inserted in the generation according to a self-organizing process. Experimental results indicate that the performance of the proposed algorithm in the protein structure prediction problem is superior or similar to the performance of the standard random immigrants approach with the best rate of individual replacement.","PeriodicalId":386768,"journal":{"name":"Learning and Nonlinear Models","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127020358","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}
Geraldo Browne Ribeiro Filho, M. S. Nagano, L. A. N. Lorena
{"title":"Metaheurística Híbrida Algoritmo Genético-Clustering Search Para A Otimização Em Sistemas De Produção Flow Shop Permutacional","authors":"Geraldo Browne Ribeiro Filho, M. S. Nagano, L. A. N. Lorena","doi":"10.21528/LNLM-vol4-no1-art4","DOIUrl":"https://doi.org/10.21528/LNLM-vol4-no1-art4","url":null,"abstract":"This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, therefore reducing in-process inventory. A new hybrid metaheuristic, Genetic Algorithm Cluster Search, is proposed for the scheduling problem solution. The proposed method is compared with the bests results reported in the literature. Experimental results show that the new method provides better solutions regarding the solution quality.","PeriodicalId":386768,"journal":{"name":"Learning and Nonlinear Models","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127119961","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":"NEURAL NETWORKS APPLIED TO STOCK MARKET FORECASTING: AN EMPIRICAL ANALYSIS","authors":"Leandro Maciel, R. Ballini","doi":"10.21528/LNLM-VOL8-NO1-ART1","DOIUrl":"https://doi.org/10.21528/LNLM-VOL8-NO1-ART1","url":null,"abstract":"Neural networks are an artificial intelligence method for modeling complex target functions. For certain types of problems, such as learning to interpret complex real-world sensor data, artificial neural networks (ANNs) are among the most effective learning methods. During the last decade, they have been widely applied to the domain of financial time series prediction, and their importance in this field is growing. This paper aims to analyze neural networks for financial time series forecasting, specifically, their ability to predict future trends of North American, European, and Brazilian stock markets. Their accuracy is compared to that of a traditional forecasting method, generalized autoregressive conditional heteroskedasticity (GARCH). Furthermore, the best choice of network design is examined for each data sample. This paper concludes that ANNs do indeed have the capability to forecast the stock markets studied, and, if properly trained, robustness can be improved, depending on the network structure. In addition, the Ashley–Granger–Schmalancee and Morgan–Granger–Newbold tests indicate that ANNs outperform GARCH models in statistical terms.","PeriodicalId":386768,"journal":{"name":"Learning and Nonlinear Models","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132404412","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}