2012 Brazilian Symposium on Neural Networks最新文献

筛选
英文 中文
Performance Comparison of Parameter Variation Operators in Self-Adaptive Differential Evolution Algorithms 自适应差分进化算法中参数变化算子的性能比较
2012 Brazilian Symposium on Neural Networks Pub Date : 2012-10-20 DOI: 10.1109/SBRN.2012.38
R. Silva, R. A. Lopes, A. Freitas, F. Guimarães
{"title":"Performance Comparison of Parameter Variation Operators in Self-Adaptive Differential Evolution Algorithms","authors":"R. Silva, R. A. Lopes, A. Freitas, F. Guimarães","doi":"10.1109/SBRN.2012.38","DOIUrl":"https://doi.org/10.1109/SBRN.2012.38","url":null,"abstract":"Differential Evolution (DE) algorithm is an important Evolutionary Algorithm (EA) for global optimization over continuous spaces, which can also work with discrete variables. The success of DE in solving a specific problem is closely related to appropriately choosing its control parameters, in this context, self-adaptation allows the algorithm to reconfigure itself, automatically adapting to the problem being solved. In self-adaptation the control parameters are encoded into the genotype of the individuals and undergo the actions of variation operators. In the literature, there are several different operators proposed to vary the encoded parameters, however, there is a lack of information about their influence on the algorithms performance. To cover part of this lack of knowledge, in this paper a comparison of variation operators, commonly used to adapt parameters in self-adaptive versions of DE, is presented. The experiments on well know benchmark functions indicates that operators which maintain the control parameters diversity work better than the others.","PeriodicalId":303166,"journal":{"name":"2012 Brazilian Symposium on Neural Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131287194","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}
引用次数: 0
A Hybrid RNN Model for Cursive Offline Handwriting Recognition 草书离线手写识别的混合RNN模型
2012 Brazilian Symposium on Neural Networks Pub Date : 2012-10-20 DOI: 10.1109/SBRN.2012.41
B. Bezerra, C. Zanchettin, Vinícius Braga de Andrade
{"title":"A Hybrid RNN Model for Cursive Offline Handwriting Recognition","authors":"B. Bezerra, C. Zanchettin, Vinícius Braga de Andrade","doi":"10.1109/SBRN.2012.41","DOIUrl":"https://doi.org/10.1109/SBRN.2012.41","url":null,"abstract":"This paper presents an approach to handwriting character recognition using recurrent neural networks. The method Multi-dimensional Recurrent Neural Network is evaluated against the classical techniques. To improve the model performance we propose the use of specialized Support Vector Machine combined with the original MDRNN in cases of confusion letters to avoid misclassifications. The performance of the method is verified in the C-Cube database and compared with different classifiers. The hierarchical combination presented promising results.","PeriodicalId":303166,"journal":{"name":"2012 Brazilian Symposium on Neural Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127859371","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}
引用次数: 9
Meta-Learning for Periodic Algorithm Selection in Time-Changing Data 时变数据中周期算法选择的元学习
2012 Brazilian Symposium on Neural Networks Pub Date : 2012-10-20 DOI: 10.1109/SBRN.2012.50
A. L. Rossi, A. Carvalho, Carlos Soares
{"title":"Meta-Learning for Periodic Algorithm Selection in Time-Changing Data","authors":"A. L. Rossi, A. Carvalho, Carlos Soares","doi":"10.1109/SBRN.2012.50","DOIUrl":"https://doi.org/10.1109/SBRN.2012.50","url":null,"abstract":"When users have to choose a learning algorithm to induce a model for a given dataset, a common practice is to select an algorithm whose bias suits the data distribution. In real-world applications that produce data continuously this distribution may change over time. Thus, a learning algorithm with the adequate bias for a dataset may become unsuitable for new data following a different distribution. In this paper we present a meta-learning approach for periodic algorithm selection when data distribution may change over time. This approach exploits the knowledge obtained from the induction of models for different data chunks to improve the general predictive performance. It periodically applies a meta-classifier to predict the most appropriate learning algorithm for new unlabeled data. Characteristics extracted from past and incoming data, together with the predictive performance from different models, constitute the meta-data, which is used to induce this meta-classifier. Experimental results using data of a travel time prediction problem show its ability to improve the general performance of the learning system. The proposed approach can be applied to other time-changing tasks, since it is domain independent.","PeriodicalId":303166,"journal":{"name":"2012 Brazilian Symposium on Neural Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116716700","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}
引用次数: 19
Predicting Gene Functions Using Semi-supervised Clustering Algorithms with Objective Function Optimization 基于目标函数优化的半监督聚类算法预测基因功能
2012 Brazilian Symposium on Neural Networks Pub Date : 2012-10-20 DOI: 10.1109/SBRN.2012.33
V. M. Filho, Ivan G. Costa, João F. L. Oliveira, F. D. Carvalho
{"title":"Predicting Gene Functions Using Semi-supervised Clustering Algorithms with Objective Function Optimization","authors":"V. M. Filho, Ivan G. Costa, João F. L. Oliveira, F. D. Carvalho","doi":"10.1109/SBRN.2012.33","DOIUrl":"https://doi.org/10.1109/SBRN.2012.33","url":null,"abstract":"Despite the complete sequencing of human genome, most of the gene functions are still unknown. Micro array techniques provides a fast and reliable means to analysis of the gene expression and the understanding of their function. In this context, clustering gene expression data is an essential step for gene function discovery, as groups of genes with similar expressions potentially having the same biological function. In this work, we analyze the use of external biological knowledge, such as the ones provided in ontologies to improve the functional grouping of gene expression measured from micro array data set. We propose here application of semi-supervised clustering algorithms that optimize an objective function for clustering functionally related genes. These algorithms demonstrated improvements on finding functionally related genes in relation to a previously proposed model based approach.","PeriodicalId":303166,"journal":{"name":"2012 Brazilian Symposium on Neural Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122118054","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}
引用次数: 0
Harmony Search for Multi-objective Optimization 多目标优化的和谐搜索
2012 Brazilian Symposium on Neural Networks Pub Date : 2012-10-20 DOI: 10.1109/SBRN.2012.19
L. M. Pavelski, C. Almeida, Richard A. Gonçalves
{"title":"Harmony Search for Multi-objective Optimization","authors":"L. M. Pavelski, C. Almeida, Richard A. Gonçalves","doi":"10.1109/SBRN.2012.19","DOIUrl":"https://doi.org/10.1109/SBRN.2012.19","url":null,"abstract":"This paper investigates the efficiency of Harmony Search based algorithms for solving multi-objetive problems. For this task, four variants of the Harmony Search algorithm were adapted in the Non-dominated Sorting Genetic Algorithm II (NSGA-II) framework. Harmony Search is a recent proposed music-inspired metaheuristic while NSGA-II is a very successful evolutionary multi-objective algorithm. The four proposed methods are tested against each other using a set of benchmark instances proposed in CEC 2009. The best proposed algorithm is also compared with NSGA-II. The preliminary results are very promising and stand the proposed approach as a candidate to the State-of-the-art for multi-objective optimization, encouraging further researches in the hybridization of the Harmony Search and Multi-objective Evolutionary Algorithms.","PeriodicalId":303166,"journal":{"name":"2012 Brazilian Symposium on Neural Networks","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131473690","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}
引用次数: 14
An Epsilon-Greedy Mutation Operator Based on Prior Knowledge for GA Convergence and Accuracy Improvement: An Application to Networks Inference 一种基于先验知识的贪心变异算子用于遗传算法的收敛和精度提高——在网络推理中的应用
2012 Brazilian Symposium on Neural Networks Pub Date : 2012-10-20 DOI: 10.1109/SBRN.2012.40
M. R. Mendoza, A. Werhli, A. Bazzan
{"title":"An Epsilon-Greedy Mutation Operator Based on Prior Knowledge for GA Convergence and Accuracy Improvement: An Application to Networks Inference","authors":"M. R. Mendoza, A. Werhli, A. Bazzan","doi":"10.1109/SBRN.2012.40","DOIUrl":"https://doi.org/10.1109/SBRN.2012.40","url":null,"abstract":"This paper introduces a new mutation operator for networks inference based on the epsilon-greedy strategy. Given some prior knowledge, either provided by a third party method or collected from literature, our approach performs mutations by randomly exploring the search space with epsilon-frequency and by exploiting the available prior knowledge in the remaining cases. The algorithm starts with a highly exploitative profile and gradually decreases the probability of employing prior knowledge in the mutation operator, thus reaching a trade-off between exploration and exploitation. Tests performed have shown that the proposed approach has great potential when compared to the traditional genetic algorithm: it not only outperforms the latter in terms of results accuracy, but also accelerates its convergence and allows user to control the evolvability speed by adjusting the rate with which the probability of using prior knowledge is decreased.","PeriodicalId":303166,"journal":{"name":"2012 Brazilian Symposium on Neural Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130438435","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}
引用次数: 3
Multiobjective Genetic Optimization of Fuzzy Partitions and T-Norm Parameters in Fuzzy Classifiers 模糊分类器中模糊分区和t -范数参数的多目标遗传优化
2012 Brazilian Symposium on Neural Networks Pub Date : 2012-10-20 DOI: 10.1109/SBRN.2012.45
Edward Hinojosa Cárdenas, Heloisa A. Carmago
{"title":"Multiobjective Genetic Optimization of Fuzzy Partitions and T-Norm Parameters in Fuzzy Classifiers","authors":"Edward Hinojosa Cárdenas, Heloisa A. Carmago","doi":"10.1109/SBRN.2012.45","DOIUrl":"https://doi.org/10.1109/SBRN.2012.45","url":null,"abstract":"This paper proposes the use of a multiobjective genetic algorithm to tune fuzzy partitions and t-norm parameters in Fuzzy Rule Based Classifications Systems (FRBCSs). We consider a rule base and a data base already defined and apply a multiobjective genetic algorithm to tune the database, and simultaneously search for the most appropriate t-norm to be used in the inference engine. The optimization process is designed to handle the trade-off between interpretability and accuracy. We present a comparative study which examines a number of t-norms and their influence in the quality of the non-dominated solutions found in the optimization process. The experiments showed that significant improvements can be made in the Pareto front when the most appropriate t-norm is optimized for a specific domain. The proposed algorithm is based on the well-known technique Strength Pareto Evolutionary Algorithm (SPEA2).","PeriodicalId":303166,"journal":{"name":"2012 Brazilian Symposium on Neural Networks","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114453145","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}
引用次数: 2
Combining Information from Distributed Evolutionary k-Means 结合分布式进化k-均值信息
2012 Brazilian Symposium on Neural Networks Pub Date : 2012-10-20 DOI: 10.1109/SBRN.2012.11
M. Naldi, R. Campello
{"title":"Combining Information from Distributed Evolutionary k-Means","authors":"M. Naldi, R. Campello","doi":"10.1109/SBRN.2012.11","DOIUrl":"https://doi.org/10.1109/SBRN.2012.11","url":null,"abstract":"One of the challenges for clustering resides in dealing with huge amounts of data, which causes the need for distribution of large data sets in separate repositories. However, most clustering techniques require the data to be centralized. One of them, the k-means, has been elected one of the most influential data mining algorithms. Although exact distributed versions of the k-means algorithm have been proposed, the algorithm is still sensitive to the selection of the initial cluster prototypes and requires that the number of clusters be specified in advance. This work tackles the problem of generating an approximated model for distributed clustering, based on k-means, for scenarios where the number of clusters of the distributed data is unknown. We propose a collection of algorithms that generate and select k-means clustering for each distributed subset of the data and combine them afterwards. The variants of the algorithm are compared from two perspectives: the theoretical one, through asymptotic complexity analyses, and the experimental one, through a comparative evaluation of results obtained from a collection of experiments and statistical tests.","PeriodicalId":303166,"journal":{"name":"2012 Brazilian Symposium on Neural Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134564509","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
Electrical Transmission Lines Design through Integer Multiobjective Particle Swarm Optimization Approach 基于整数多目标粒子群优化方法的输电线路设计
2012 Brazilian Symposium on Neural Networks Pub Date : 2012-10-20 DOI: 10.1109/SBRN.2012.10
H. V. Ayala, L. Coelho, F. Guerra, Mariana Cristina Coelho
{"title":"Electrical Transmission Lines Design through Integer Multiobjective Particle Swarm Optimization Approach","authors":"H. V. Ayala, L. Coelho, F. Guerra, Mariana Cristina Coelho","doi":"10.1109/SBRN.2012.10","DOIUrl":"https://doi.org/10.1109/SBRN.2012.10","url":null,"abstract":"Electrical Transmission Lines (ETL) design is normally performed aiming to reach minimum cost while satisfying project requirements. However, achieving one only design goal may not be sufficient, as the designer may need to impose other technical design metrics. This work aims to perform the ETL design task while offering the designer the possibility to impose other design goals than cost, like the ETL reliability efficiency. Multiobjective optimization algorithms are therefore suggested to perform the design task. An improved multiobjective integer version of Particle Swarm Optimization, the Integer Multiobjective Particle Swarm Optimization (IMOPSO), is proposed in this paper. The IMOPSO is applied in order to solve the multiobjective ETL design showing promising results. Conclusions are drawn regarding the IMOPSO algorithm performance and design results, through statistical analysis.","PeriodicalId":303166,"journal":{"name":"2012 Brazilian Symposium on Neural Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133942012","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 Semi-supervised Approach to Estimate the Number of Clusters per Class 估计每类簇数的半监督方法
2012 Brazilian Symposium on Neural Networks Pub Date : 2012-10-20 DOI: 10.1109/SBRN.2012.31
Davidson M. Sestaro, T. Covões, Eduardo R. Hruschka
{"title":"A Semi-supervised Approach to Estimate the Number of Clusters per Class","authors":"Davidson M. Sestaro, T. Covões, Eduardo R. Hruschka","doi":"10.1109/SBRN.2012.31","DOIUrl":"https://doi.org/10.1109/SBRN.2012.31","url":null,"abstract":"The disparity between the available amount of unlabeled and labeled data in several applications made semi-supervised learning become an active research topic. Most studies on semi-supervised clustering assume that the number of classes is equal to the number of clusters. This paper introduces a semi-supervised clustering algorithm, named Multiple Clusters per Class k-means (MCCK), which estimates the number of clusters per class via pair wise constraints generated from class labels. Experiments with eight datasets indicate that the algorithm outperforms three traditional algorithms for semi-supervised clustering, especially when the one-cluster-per-class assumption does not hold. Finally, the learned structure can offer a valuable description of the data in several applications. For instance, it can aid the identification of subtypes of diseases in medical diagnosis problems.","PeriodicalId":303166,"journal":{"name":"2012 Brazilian Symposium on Neural Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126966666","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}
引用次数: 2
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学术官方微信
小红书