2015 Brazilian Conference on Intelligent Systems (BRACIS)最新文献

筛选
英文 中文
Transducer State Prediction System for Smart Environment Intelligent Control 面向智能环境智能控制的传感器状态预测系统
2015 Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2015-11-04 DOI: 10.1109/BRACIS.2015.32
Marcelo Bassani de Freitas, George D. C. Cavalcanti, R. Sabourin
{"title":"Transducer State Prediction System for Smart Environment Intelligent Control","authors":"Marcelo Bassani de Freitas, George D. C. Cavalcanti, R. Sabourin","doi":"10.1109/BRACIS.2015.32","DOIUrl":"https://doi.org/10.1109/BRACIS.2015.32","url":null,"abstract":"Smart environments possess devices that collaborate to help the user non-intrusively. One possible aid smart environment offer is to anticipate user's tasks and perform them on his/her behalf or facilitate the action completion. In this paper, we propose a framework that predicts user's actions by learning his/her behavior when interacting with the smart environment. We prepare the datasets and train a predictor that is responsible to decide whether a target transducer value should be changed or not. Our solution achieves a significant improvement for all target transducers studied and most combinations of parameters yields better results than the base case.","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115455854","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
Context-Aware Techniques for Cross-Domain Recommender Systems 跨领域推荐系统的上下文感知技术
2015 Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2015-11-04 DOI: 10.1109/BRACIS.2015.42
D. V. D. Silva, R. Prudêncio, C. Ferraz, Alysson Bispo, T. Prota
{"title":"Context-Aware Techniques for Cross-Domain Recommender Systems","authors":"D. V. D. Silva, R. Prudêncio, C. Ferraz, Alysson Bispo, T. Prota","doi":"10.1109/BRACIS.2015.42","DOIUrl":"https://doi.org/10.1109/BRACIS.2015.42","url":null,"abstract":"In the last few years, cross-domain recommender systems emerged in order to improve and alleviate problems of single-domain recommender systems. Despite the great number of cross-domain recommender system approaches, there is a lack of studies concerned about the use of contextual features in cross domain recommender systems. The context-aware approach uses different contextual information (e.g., Location, time, and mood) in order to improve recommendations, where context can be treated as a bridge between different domains. In this paper, we investigate the adoption of two context-aware approaches in a cross-domain recommender system in order to improve its recommendation accuracy. For that, we describe the context aware cross-domain recommendation problem and the proposed context-aware algorithms. An experimental evaluation performed using a real dataset indicates that context-aware techniques can be a good approach in order to improve the cross-domain recommendation accuracy.","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128290490","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}
引用次数: 7
Grouping Similar Trajectories for Carpooling Purposes 为拼车目的对相似轨迹进行分组
2015 Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2015-11-04 DOI: 10.1109/BRACIS.2015.36
Michael Cruz, Hendrik T. Macedo, Adolfo P. Guimarães
{"title":"Grouping Similar Trajectories for Carpooling Purposes","authors":"Michael Cruz, Hendrik T. Macedo, Adolfo P. Guimarães","doi":"10.1109/BRACIS.2015.36","DOIUrl":"https://doi.org/10.1109/BRACIS.2015.36","url":null,"abstract":"Vehicle congestion is a serious concern in metropolitan areas. Some policies have been adopted in order to soften the problem: construction of alternative routes, encouragement for the use of bicycles, improvement on public transportation, among others. A practice that might help is carpooling. Carpooling consists in sharing private vehicle space among people with similar trajectories. Although there exist some software initiatives to facilitate the carpooling practice, none of them actually provides some key facilities such as searching for people with similar trajectories. The way in which such a trajectory is represented is also central. In the specific context of carpooling, the use of Points of Interest (POI) as a method for trajectory discretization is rather relevant. In this paper, we consider that and other assumptions to propose an innovative approach to generate trajectory clusters for carpooling purposes, based on Optics algorithm. We also propose a new similarity measure for trajectories. Two experiments have been performed in order to prove the feasibility of the approach. Furthermore, we compare our approach with K-means and Optics. Results have showed that the proposed approach has results similar for Davies-Boulding index (DBI).","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128954257","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}
引用次数: 39
Reference-Point Based Multi-swarm Algorithm for Many-Objective Problems 多目标问题的基于参考点的多群算法
2015 Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2015-11-04 DOI: 10.1109/BRACIS.2015.19
André Britto, A. Pozo
{"title":"Reference-Point Based Multi-swarm Algorithm for Many-Objective Problems","authors":"André Britto, A. Pozo","doi":"10.1109/BRACIS.2015.19","DOIUrl":"https://doi.org/10.1109/BRACIS.2015.19","url":null,"abstract":"Many-Objective Optimization Problems (MaOPs) are problems that have more than three objectives to be optimized. Usually, the state-of-art of Multi-Objective Evolutionary algorithms scale poorly when the number of objective functions increases. To overcome this limitation, researches are investigating multi-swarm approaches. Besides, another newly strategy is the use of reference points to enhance the search of the algorithms. Based on those strategies, this work proposes a new multi-swarm algorithm, called Reference-Point Based Multi-Swarm Algorithm, R-Multi, which takes advantages of reference points to guide a multi-swarm search. The main idea is to use reference points to guide the search towards the Pareto front and to perform the communication between swarms allowing the necessary collaboration to have an effective exploration of the search space. Furthermore, this work presents a set of experiments that compare R-Multi to others multi-swarm algorithms and to MOEA/D-DRA. The algorithms are evaluated in several MaOPs observing both convergence and diversity. The results shows the validity of the proposed algorithm and stresses the good results of multi-swarm approaches in Many-Objective Optimization.","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127374232","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
Evaluating a Multi-objective Hyper-Heuristic for the Integration and Test Order Problem 集成与测试顺序问题的多目标超启发式评价
2015 Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2015-11-04 DOI: 10.1109/BRACIS.2015.11
Giovani Guizzo, S. Vergilio, A. Pozo
{"title":"Evaluating a Multi-objective Hyper-Heuristic for the Integration and Test Order Problem","authors":"Giovani Guizzo, S. Vergilio, A. Pozo","doi":"10.1109/BRACIS.2015.11","DOIUrl":"https://doi.org/10.1109/BRACIS.2015.11","url":null,"abstract":"Multi-objective evolutionary algorithms (MOEAs) have been successfully applied for solving different software engineering problems. However, adapting and configuring these algorithms for a specific problem can demand significant effort from software engineers. Therefore, to help in this task, a hyper-heuristic, named HITO (Hyper-heuristic for the Integration and Test Order problem) was proposed to adaptively select search operators during the optimization process. HITO was successfully applied using NSGA-II for solving the integration and test order problem. HITO can use two hyper-heuristic selection methods: Choice Function and Multi-armed Bandit. However, a hypotheses behind this study is that HITO does not depend of NSGA-II and can be used with other MOEAs. To this aim, this paper presents results from evaluation experiments comparing the performance of HITO using two different MOEAs: NSGA-II and SPEA2. The results show that HITO is able to outperform both MOEAs.","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132158486","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}
引用次数: 12
Predicting Overtemperature Events in Graphics Cards Using Regression Models 使用回归模型预测显卡过温事件
2015 Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2015-11-04 DOI: 10.1109/BRACIS.2015.38
Francisco Caio M. Rodrigues, Lucas P. Queiroz, J. Gomes, Javam C. Machado
{"title":"Predicting Overtemperature Events in Graphics Cards Using Regression Models","authors":"Francisco Caio M. Rodrigues, Lucas P. Queiroz, J. Gomes, Javam C. Machado","doi":"10.1109/BRACIS.2015.38","DOIUrl":"https://doi.org/10.1109/BRACIS.2015.38","url":null,"abstract":"Graphics cards are complex electronic systems designed for high performance applications. Due to its processing power, graphics cards may operate at high temperatures, leading its components to a significant degradation level. This fact is even more present when any of the heat exchange components is not working properly. In such cases, graphics cards may operate in temperatures that are higher than the specified by the manufacturers. This work presents a methodology to detect over temperature events in graphics cards using regression models. The proposed approach was tested in real graphics cards from different manufacturers. The final model achieved promising results.","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122236729","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
Probabilistic Fuzzy Naive Bayes 概率模糊朴素贝叶斯
2015 Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2015-11-04 DOI: 10.1109/BRACIS.2015.48
Gabriel Moura, M. Roisenberg
{"title":"Probabilistic Fuzzy Naive Bayes","authors":"Gabriel Moura, M. Roisenberg","doi":"10.1109/BRACIS.2015.48","DOIUrl":"https://doi.org/10.1109/BRACIS.2015.48","url":null,"abstract":"Bayesian networks are probabilistic graphical models capable of modeling statistical uncertainty and are widely applied in many classification problems. Specifically, Naive Bayesian networks are largely used due to their simple, naive structure, while still producing precise results. Fuzzy systems, on the other hand, are a well known technique capable of dealing with linguistic vagueness by representing knowledge with simple and interpretable rules and membership functions. As traditional fuzzy systems are unable to model statistical uncertainty, Probabilistic Fuzzy Systems were developed in order to account for both kinds of uncertainties. In this work we propose the Probabilistic Fuzzy Naive Bayes classifier as a combination of both probabilistic fuzzy systems and naive bayesian networks, also capable of simultaneously modeling both kinds of uncertainties. The proposed model is firstly applied in a very simple classification problem in order to show its potential and advantage over traditional naive bayes classifiers, while maintaining their interpretability. For validation, experiments were done using benchmark classification data sets from the UCI machine learning repository and the results are then compared with other similar alternate methods.","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127734099","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
Dyna-MLAC: Trading Computational and Sample Complexities in Actor-Critic Reinforcement Learning 动态- mlac: Actor-Critic强化学习中的交易计算和样本复杂性
2015 Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2015-11-04 DOI: 10.1109/BRACIS.2015.62
Bruno Costa, W. Caarls, D. Menasché
{"title":"Dyna-MLAC: Trading Computational and Sample Complexities in Actor-Critic Reinforcement Learning","authors":"Bruno Costa, W. Caarls, D. Menasché","doi":"10.1109/BRACIS.2015.62","DOIUrl":"https://doi.org/10.1109/BRACIS.2015.62","url":null,"abstract":"Sampling and computation budgets are two of the key elements that determine the performance of a reinforcement learning algorithm. In essence, any reinforcement learning agent must sample the environment and perform some computation over the samples to decide its best action. Although very fundamental, the trade-off between sampling and computation is still not well understood. In this paper, we explore this trade-off in an actor-critic perspective. First, we propose a new RL algorithm, Dyna-MLAC, which uses model-based actor-critic updates (MLAC) within the Dyna framework. Then, we numerically indicate that the convergence time of Dyna-MLAC is smaller than pre-existing solutions, and that Dyna-MLAC allows to efficiently trade number of samples and computation time.","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114886005","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
Using Markov Models to Learn the Sentiment of Soccer Fans from Bets and the Result of Matches 利用马尔可夫模型从下注和比赛结果中学习球迷情绪
2015 Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2015-11-04 DOI: 10.1109/BRACIS.2015.60
Rafael Bomfim, Vasco Furtado
{"title":"Using Markov Models to Learn the Sentiment of Soccer Fans from Bets and the Result of Matches","authors":"Rafael Bomfim, Vasco Furtado","doi":"10.1109/BRACIS.2015.60","DOIUrl":"https://doi.org/10.1109/BRACIS.2015.60","url":null,"abstract":"In this paper we investigate variations of Hidden Markov Models (HMM) as a viable tool for predicting the sentiment of soccer fans based on information regarding the result of matches. The models were constructed from data collected from a social network where fans of a soccer team periodically express feelings towards their team. Our claim is that the change in a fan's sentiment is analogous to a Markovian process of change of state through time. A comparative evaluation performed between variations of the proposed models showed that a second order HMM, considering the match results and fan's gambling information, is the most accurate model.","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128657771","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
Adaptive Method for Segmentation of Vehicles through Local Threshold in the Gaussian Mixture Model 基于高斯混合模型的局部阈值自适应车辆分割方法
2015 Brazilian Conference on Intelligent Systems (BRACIS) Pub Date : 2015-11-04 DOI: 10.1109/BRACIS.2015.33
K. A. B. Lima, K. Aires, F. Reis
{"title":"Adaptive Method for Segmentation of Vehicles through Local Threshold in the Gaussian Mixture Model","authors":"K. A. B. Lima, K. Aires, F. Reis","doi":"10.1109/BRACIS.2015.33","DOIUrl":"https://doi.org/10.1109/BRACIS.2015.33","url":null,"abstract":"The segmentation of vehicles is a non-linear problem that has been tackled using methods for background subtraction in systems for traffic control. Probabilistic models, such as Gaussian Mixture Models (GMM), estimate the background of dynamic environments in this approach. The general modeling considers independent distributions for each pixel of the image. So, the classification is performed singly. The system uses often only one threshold to classify the pixels into background and foreground regions. This approach doest not work well when the cluster intersection is significant. In the vehicle segmentation, the color of the vehicles are similar to background, so the accuracy is affected. This paper proposes an approach to improve the classification of traffic scenes. This approach uses local thresholds to encourage the segmentation of vehicle regions. These thresholds are estimated by a spatial analysis of the previous classification. The results of the experiment performed shown that the classification process is improved by this approach.","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128994181","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
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学术官方微信
小红书