2016 5th Brazilian Conference on Intelligent Systems (BRACIS)最新文献

筛选
英文 中文
Image-Set Matching by Two Dimensional Generalized Mutual Subspace Method 二维广义互子空间方法的图像集匹配
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.034
B. Gatto, E. M. Santos
{"title":"Image-Set Matching by Two Dimensional Generalized Mutual Subspace Method","authors":"B. Gatto, E. M. Santos","doi":"10.1109/BRACIS.2016.034","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.034","url":null,"abstract":"In this paper, we present a novel supervised learning algorithm for object recognition from sets of images, where the sets describe most of the variation in an object's appearance caused by lighting, pose and view angle. In this scenario, generalized mutual subspace method (gMSM) has attracted attention for image-set matching due to its advantages in accuracy and robustness. However, gMSM employs PCA, which has high computational cost contrasting to state-of-art appearance-based methods. To create a faster method, we replace the traditional PCA by 2D-PCA and variants on gMSM framework. In general, 2D-PCA and variants require less memory resource than conventional PCA since its covariance matrix is calculated directly from two-dimensional matrices. The introduced method has the advantage of representing the subspaces in a more compact manner, providing reasonably competitive recognition rate comparing to the traditional MSM, confirming the suitability of employing 2D-PCA and variants on gMSM framework. These results have been revealed through experimentation conducted on five widely used datasets.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"64 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":"134035832","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}
引用次数: 6
Using Preferences over Sources of Information in Argumentation-Based Reasoning 在基于论证的推理中对信息源的偏好
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.017
Alison R. Panisson, Victor S. Melo, Rafael Heitor Bordini
{"title":"Using Preferences over Sources of Information in Argumentation-Based Reasoning","authors":"Alison R. Panisson, Victor S. Melo, Rafael Heitor Bordini","doi":"10.1109/BRACIS.2016.017","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.017","url":null,"abstract":"Argumentation-based reasoning plays an important role in agent reasoning and communication, yet little research has been carried out on the issues in integrating argumentation techniques into practical multi-agent platforms and the various sources of information in such systems. In this work, we extend an argumentation-based reasoning mechanism to take into account preferences over arguments supporting contrary conclusions, which in practice means the agent will be able to act more informedly, being able to decide on beliefs about which it would be otherwise ambivalent. Such preferences come from elements that are present or can be more easily obtained in the context of practical multi-agent programming platforms, such as multiple sources from which the information (used to construct the arguments) was acquired, as well as varying degrees of trust on them. Further, we introduce different agent profiles by varying the way certain operators are applied over the various information sources leading to the preferences over competing arguments in our approach. Unlike previous approaches, our approach accounts for multiple sources for a single piece of information and is based on an argumentation-based reasoning mechanism implemented on a multi-agent platform so arguably more computationally grounded than those approaches.","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":"133027556","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}
引用次数: 13
Topic Modeling for Short Texts with Co-occurrence Frequency-Based Expansion 基于共现频率展开的短文本主题建模
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.058
Gabriel Pedrosa, Marcelo Pita, Paulo Viana Bicalho, A. Lacerda, G. Pappa
{"title":"Topic Modeling for Short Texts with Co-occurrence Frequency-Based Expansion","authors":"Gabriel Pedrosa, Marcelo Pita, Paulo Viana Bicalho, A. Lacerda, G. Pappa","doi":"10.1109/BRACIS.2016.058","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.058","url":null,"abstract":"Short texts are everywhere on the Web, including messages in social media, status messages, etc, and extracting semantically meaningful topics from these collections is an important and difficult task. Topic modeling methods, such as Latent Dirichlet Allocation, were designed for this purpose. However, discovering high quality topics in short text collections is a challenging task. This is because most topic modeling methods rely on information coming from the word co-occurrence distribution in the collection to extract topics. As in short text this information is scarce, topic modeling methods have difficulties in this scenario, and different strategies to tackle this problem have been proposed in the literature. In this direction, this paper introduces a method for topic modeling of short texts that creates pseudo-documents representations from the original documents. The method is simple, effective, and considers word co-occurrence to expand documents, which can be given as input to any topic modeling algorithm. Experiments were run in four datasets and compared against state-of-the-art methods for extracting topics from short text. Results of coherence, NPMI and clustering metrics showed to be statistically significantly better than the baselines in the majority of cases.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"55 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":"122379635","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}
引用次数: 15
ASAClu: Selecting Diverse and Relevant Clusters ASAClu:选择多样化和相关的集群
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.091
Joao Luis Baptista de Almeida, T. Sakata, Katti Faceli
{"title":"ASAClu: Selecting Diverse and Relevant Clusters","authors":"Joao Luis Baptista de Almeida, T. Sakata, Katti Faceli","doi":"10.1109/BRACIS.2016.091","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.091","url":null,"abstract":"No clustering algorithm is guaranteed to find actualgroups in any dataset. To deal with this problem, one can applyvarious clustering algorithms, generating a set of partitions andexplore them to find the most appropriated ones. The number ofpartitions and its component clusters may be too large, making itdifficult to the specialist analyze the final result. In this paper, weintroduce a new selection strategy namedASAClu, which is aimedat selecting a reduced set of clusters from a given collection ofpartitions generated by different clustering algorithms.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"3 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":"115965662","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 Bio-inspired Optimization Technique for Cluster Ensembles Optimization 一种生物启发的簇集成优化技术
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.054
Huliane M. Silva, A. Canuto, I. Medeiros, J. C. Xavier
{"title":"A Bio-inspired Optimization Technique for Cluster Ensembles Optimization","authors":"Huliane M. Silva, A. Canuto, I. Medeiros, J. C. Xavier","doi":"10.1109/BRACIS.2016.054","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.054","url":null,"abstract":"Several clustering algorithms have been applied to a great variety of problems in different application domains. Each algorithm, however, has its own advantages and limitations, which can result in different solutions for the same problem. In this sense, combining different clustering algorithms (cluster ensembles) is one of the most used approaches, in an attempt to overcome the limitations of each clustering technique. The main aim is to combine multiple partitions generated by different clustering algorithms into a single clustering solution (consensus partition). To date, several approaches have been proposed in literature in order to provide optimization, or continuously improve the solutions found by the cluster ensembles. Therefore, as a contribution to this important subject, this paper presents a new bio-inspired optimization technique to optimize the cluster ensembles. In this proposed technique, the cluster ensembles are heterogeneously created and the initial partitions are combined through a method which uses the Coral Reefs Optimization algorithm, resulting in a consensus partition. In order to evaluate the feasibility of the proposed technique, an empirical analysis will be conducted using 15 different problems and applying two different indexes in order to examine its efficiency and feasibility.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"80 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":"125162286","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
BaNHFaP: A Bayesian Network Based Failure Prediction Approach for Hard Disk Drives BaNHFaP:基于贝叶斯网络的硬盘故障预测方法
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.083
I. C. Chaves, M. R. P. Paula, L. G. Leite, Lucas P. Queiroz, J. Gomes, Javam C. Machado
{"title":"BaNHFaP: A Bayesian Network Based Failure Prediction Approach for Hard Disk Drives","authors":"I. C. Chaves, M. R. P. Paula, L. G. Leite, Lucas P. Queiroz, J. Gomes, Javam C. Machado","doi":"10.1109/BRACIS.2016.083","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.083","url":null,"abstract":"A Hard Disk Drive (HDD) failure may lead to serious consequences for users and companies. Hence, predicting failures in HDDs became a topic that attracted much attention in recent years. Monitoring a HDD status can provide information about its degradation, so as to let the user or a system manager know about a failure before it happens, preventing loss of information. In this paper, we propose a failure prediction method using a Bayesian Network. Our method uses the deterioration over time of a HDD, calculated via SMART (SelfMonitoring Analysis and Reporting Technology) attributes, for predicting eventual failures. To demonstrate practical usefulness, this method was applied to a dataset consisting of 49,056 hard drives from Backblaze's data centers. The proposed method has improved the mean and median quadratic errors in 28.3% and 17.6% respectively in comparison with a baseline model.","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":"130449399","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}
引用次数: 22
Evaluating the Impact of Reputation-Based Agents in Social Coalition Formation 评价基于声誉的代理人在社会联盟形成中的影响
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.047
C. Souza, F. Enembreck
{"title":"Evaluating the Impact of Reputation-Based Agents in Social Coalition Formation","authors":"C. Souza, F. Enembreck","doi":"10.1109/BRACIS.2016.047","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.047","url":null,"abstract":"This paper proposes a dynamic and decentralized model for coalitional skill games (CSG). The model calculates and exploits the reputation of individuals connected by a network, as an alternative to the usual CSG approaches that require reward analysis for every possible coalition to determine an optimal coalition structure for maximizing the total reward from the community. In this study, we restrict the search space for partnerships to the social neighborhoods of agents so that the social capital is used to reach a near-optimal solution by identifying how reputation can be used to better adapt the network, with the objective of bringing together agents who are more likely to cooperate in successful coalitions. In addition, our model allows a more precise quantifying of the relevance of the agents over time in social coalition formation. Experiments with different initial network topologies show that our approach is significantly better than static networks or structure-based adaptations whenever the initial network does not fit a high degree of interconnectedness, such as in a small-world model. In all the cases, the results are statistically better than current adaptation strategies.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"7 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":"116566153","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
Data Clustering Using Group Search Optimization with Alternative Fitness Functions 具有备选适应度函数的群体搜索优化数据聚类
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.062
L. Pacífico, Teresa B Ludermir
{"title":"Data Clustering Using Group Search Optimization with Alternative Fitness Functions","authors":"L. Pacífico, Teresa B Ludermir","doi":"10.1109/BRACIS.2016.062","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.062","url":null,"abstract":"Data clustering is an important tool for statistical data analysis and exploration, and it has been successfully applied in many fields like image understanding, bioinformatics, big data mining, and so on. From the past few decades, Evolutionary Algorithms (EAs) have been introduced to deal with clustering task, given their global search capabilities and their mechanisms to escape from local minima points. EAs execution is driven in an attempt to optimize a criterion function, also known as fitness function. In this work, we evaluate the influence of the fitness function on Group Search Optimization (GSO) meta-heuristic when applied to data clustering. Three different fitness function are proposed to GSO. Experiments are performed on twelve benchmark data sets obtained from UCI Machine Learning Repository to evaluate the performance of all alternative GSO models in comparison to other well-known partitional clustering methods from literature.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"270 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":"133782117","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}
引用次数: 6
Allocation of Volunteers in Non-governmental Organizations Aided by Non-supervised Learning 非监督学习辅助下的非政府组织志愿者分配
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.049
Carlos M. M. Bezerra, Danilo R. B. Araújo, V. Macário
{"title":"Allocation of Volunteers in Non-governmental Organizations Aided by Non-supervised Learning","authors":"Carlos M. M. Bezerra, Danilo R. B. Araújo, V. Macário","doi":"10.1109/BRACIS.2016.049","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.049","url":null,"abstract":"Nowadays recommender systems are successfully used in several application domains such in the educational field, e-commerce, tourism, online entertainment, and so on. However, there are some applications that could be aided by recommender systems but no previous study has already been developed to propose a suitable proposal for such applications. In this paper we develop a study related to the use of recommender systems techniques to aid the volunteers allocation in Non-Governmental Organizations (NGOs). We evaluated two different clustering algorithms by using two measures for evaluation of clusters. We evaluate the effectiveness of the algorithms when they are applied to create different groups of volunteers from Brazilian NGOs by considering the volunteering profile. According to our analysis, the non-supervised learning is promising to build a more complete support decision system to aid the management of NGOs related to volunteers allocation.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"5 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":"129755760","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 Module-Based Approach for Evaluating Differential Genome-Wide Expression Profiles 基于模块的差异全基因组表达谱评估方法
2016 5th Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2016-10-01 DOI: 10.1109/BRACIS.2016.069
J. D. S. Dias, Ronnie Alves, T. Commes
{"title":"A Module-Based Approach for Evaluating Differential Genome-Wide Expression Profiles","authors":"J. D. S. Dias, Ronnie Alves, T. Commes","doi":"10.1109/BRACIS.2016.069","DOIUrl":"https://doi.org/10.1109/BRACIS.2016.069","url":null,"abstract":"Transcription is the process of making an RNA copy of a gene sequence. Next, this copy (mRNA) is then translated into proteins. Proteins dictates the expected behavior inside the cells and are required for the structure, function, and regulation of the body's tissues and organs. Together, transcription and translation are known as gene expression. Transcriptograms are basically defined as \"images\" of gene expression data of genomes, by generating expression profiles for transcriptomes. They allow to assess cell metabolism, being capable of discriminating the stage the cell is going through at a given instant, as well as pointing metabolic changes in altered cellular states as compared to a control state, independently of the transcriptome profilling protocol. Though, they cannot highlight differential expression profiles. We present a new possibility of RNA-Seq data analysis using Transcriptograms for discovering module-based differential expression profiles. We demonstrate its practical application while obtaining more specific gene signatures as well as functional annotations, closely related to biomedical context. Moreover, these signatures are also enriched by survival cancer analysis.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"198 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":"133822260","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
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学术官方微信