Pub Date : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.41
A. C. E. S. Lima, L. N. de Castro
Social media allow web surfers to produce and share content about different subjects, exposing their activities, opinions, feelings and thoughts. In this context, online social media has attracted the interest of data analysis researchers seeking to infer behaviors and trends, besides creating statistics involving social sites. A possible research involving these data is known as personality analysis, which aims to understand the user's behavior in a social media. Thus, this paper uses machine learning techniques to predict personality traits in groups of tweets. In traditional approaches of personality prediction the analysis is made in the users' profiles and their tweets. However, in this paper the approach arises from the fact that the personality analysis is performed in groups of tweets. The prediction is based on the Big Five Model, also called Five Factor Model, which divides personality traits into five dimensions and uses linguistic information to identify these traits. This paper uses TV shows from Brazilian stations for benchmarking. The system achieved an average accuracy of 84%.
{"title":"Multi-label Semi-supervised Classification Applied to Personality Prediction in Tweets","authors":"A. C. E. S. Lima, L. N. de Castro","doi":"10.1109/BRICS-CCI-CBIC.2013.41","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.41","url":null,"abstract":"Social media allow web surfers to produce and share content about different subjects, exposing their activities, opinions, feelings and thoughts. In this context, online social media has attracted the interest of data analysis researchers seeking to infer behaviors and trends, besides creating statistics involving social sites. A possible research involving these data is known as personality analysis, which aims to understand the user's behavior in a social media. Thus, this paper uses machine learning techniques to predict personality traits in groups of tweets. In traditional approaches of personality prediction the analysis is made in the users' profiles and their tweets. However, in this paper the approach arises from the fact that the personality analysis is performed in groups of tweets. The prediction is based on the Big Five Model, also called Five Factor Model, which divides personality traits into five dimensions and uses linguistic information to identify these traits. This paper uses TV shows from Brazilian stations for benchmarking. The system achieved an average accuracy of 84%.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115299141","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}
Pub Date : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.112
Carlos Silva, E. Gonçalves, G. Dimuro, Glenda Dimuro, Esteban de Manuel Jerez
Periodic routines have been traditionally identified in Social Sciences as the essential component of social organizations that are persistent in time, with the temporal continuity of such routines constituting the foundation of the preservation of the social systems both between successive generations and between extant and immigrant populations. Open multiagent systems (MAS) with persistent social organizations are, thus, required to be organized around time-persistent periodic routines. In this paper we propose to make use of Coloured Petri Nets (CPN) for the specification of periodic routines that may characterize the social organization of MAS. In particular, the central notions of routine cut, selected routine cut, routine step, and routine step results, as well as the notion of satisfactory performance of a periodic routine, are defined, and illustrated through a detailed example. The notion of routine objective expectation and deviation are used for the analysis of routine performances.
{"title":"Modeling Agent Periodic Routines in Agent-Based Social Simulation Using Colored Petri Nets","authors":"Carlos Silva, E. Gonçalves, G. Dimuro, Glenda Dimuro, Esteban de Manuel Jerez","doi":"10.1109/BRICS-CCI-CBIC.2013.112","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.112","url":null,"abstract":"Periodic routines have been traditionally identified in Social Sciences as the essential component of social organizations that are persistent in time, with the temporal continuity of such routines constituting the foundation of the preservation of the social systems both between successive generations and between extant and immigrant populations. Open multiagent systems (MAS) with persistent social organizations are, thus, required to be organized around time-persistent periodic routines. In this paper we propose to make use of Coloured Petri Nets (CPN) for the specification of periodic routines that may characterize the social organization of MAS. In particular, the central notions of routine cut, selected routine cut, routine step, and routine step results, as well as the notion of satisfactory performance of a periodic routine, are defined, and illustrated through a detailed example. The notion of routine objective expectation and deviation are used for the analysis of routine performances.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116741450","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}
Pub Date : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.100
Ricardo T. A. De Oliveira, T. F. Oliveira, P. Firmino, T. Ferreira
Researchers have been challenged to combine time series forecasting models, with the intention of enhancing forecast accuracy and efficiency. In this way, to weight models accuracy, efficiency, and mutual dependency becomes paramount. A promising way to address this issue is via copulas. Copulas are joint probability distribution functions aimed to envelop both the marginal distribution as well as the dependency among variables (e:g: forecasting models). This paper introduces copulas in the problem of combining time series forecasting models and proposes a maximum likelihood-based methodology in this context. Specifically, a Gumbel-Hougaard copulas model is presented. The usefulness of the resulting methodology is illustrated by means of simulated cases involving the combination of two single ARIMA models.
{"title":"Combining Time Series Forecasting Models via Gumbel-Hougaard Copulas","authors":"Ricardo T. A. De Oliveira, T. F. Oliveira, P. Firmino, T. Ferreira","doi":"10.1109/BRICS-CCI-CBIC.2013.100","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.100","url":null,"abstract":"Researchers have been challenged to combine time series forecasting models, with the intention of enhancing forecast accuracy and efficiency. In this way, to weight models accuracy, efficiency, and mutual dependency becomes paramount. A promising way to address this issue is via copulas. Copulas are joint probability distribution functions aimed to envelop both the marginal distribution as well as the dependency among variables (e:g: forecasting models). This paper introduces copulas in the problem of combining time series forecasting models and proposes a maximum likelihood-based methodology in this context. Specifically, a Gumbel-Hougaard copulas model is presented. The usefulness of the resulting methodology is illustrated by means of simulated cases involving the combination of two single ARIMA models.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117247684","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}
Pub Date : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.57
A. Zaboleeva-Zotova, A. S. Bobkov, V. Rozaliev, A. B. Petrovsky
The paper describes a methodology, models and automated system for an identification of human emotions based on analysis of body movements, a recognition of characteristic gestures and poses. In the model of person emotions, the typical body movements are formalized with linguistic variables and fuzzy hyper graphs for temporal events. Emotional states of the real person recognized with the automated system are presented in a limited natural language.
{"title":"Automated Identification of Human Emotions by Gestures and Poses","authors":"A. Zaboleeva-Zotova, A. S. Bobkov, V. Rozaliev, A. B. Petrovsky","doi":"10.1109/BRICS-CCI-CBIC.2013.57","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.57","url":null,"abstract":"The paper describes a methodology, models and automated system for an identification of human emotions based on analysis of body movements, a recognition of characteristic gestures and poses. In the model of person emotions, the typical body movements are formalized with linguistic variables and fuzzy hyper graphs for temporal events. Emotional states of the real person recognized with the automated system are presented in a limited natural language.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115470003","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}
Pub Date : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.45
F. Eliott, C. Ribeiro
This paper reports modifications on a biologically inspired robotic architecture originally designed to work in single agent contexts. Several adaptations have been applied to the architecture, seeking as result a model-free artificial agent able to accomplish shared goals in a multiagent environment, from sensorial information translated into homeostatic variable values and a rule database that play roles respectively in temporal credit assignment and action-state space exploration. The new architecture was tested in a well-known benchmark game, and the results were compared to the ones from the multiagent RL algorithm Wolf-PHC. We verified that the proposed architecture can produce coordinated behaviour equivalent to WoLF-PHC in stationary domains, and is also able to learn cooperation in non-stationary domains. The proposal is a first step towards an artificial agent that cooperate as result of a biologically plausible computational model of morality.
{"title":"A Biologically Inspired Architecture for Multiagent Games","authors":"F. Eliott, C. Ribeiro","doi":"10.1109/BRICS-CCI-CBIC.2013.45","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.45","url":null,"abstract":"This paper reports modifications on a biologically inspired robotic architecture originally designed to work in single agent contexts. Several adaptations have been applied to the architecture, seeking as result a model-free artificial agent able to accomplish shared goals in a multiagent environment, from sensorial information translated into homeostatic variable values and a rule database that play roles respectively in temporal credit assignment and action-state space exploration. The new architecture was tested in a well-known benchmark game, and the results were compared to the ones from the multiagent RL algorithm Wolf-PHC. We verified that the proposed architecture can produce coordinated behaviour equivalent to WoLF-PHC in stationary domains, and is also able to learn cooperation in non-stationary domains. The proposal is a first step towards an artificial agent that cooperate as result of a biologically plausible computational model of morality.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115607563","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}
Pub Date : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.47
C. A. Soares, L. Batista, F. Campelo, F. Guimarães
Finding Nash equilibria has been one of the early objectives of research in game theory, and still represents a challenge to this day. We introduce a multiobjective formulation for computing Pareto-optimal sets of mixed Nash equilibria in normal form games. Computing these sets can be notably useful in decision making, because it focuses the analysis on solutions with greater outcome and hence more stable and desirable ones. While the formulation is suitable for any multiobjective optimization algorithm, we employ a method known as the cone-epsilon MOEA, due to its good convergence and diversity characteristics when solving multiobjective optimization problems. The adequacy of the proposed formulation is tested on most normal form games provided by the GAMBIT software test suite. The results show that the cone-epsilon MOEA working on the proposed formulation correctly finds the Pareto-optimal Nash equilibra in most games.
{"title":"Computation of Mixed Strategy Non-dominated Nash Equilibria in Game Theory","authors":"C. A. Soares, L. Batista, F. Campelo, F. Guimarães","doi":"10.1109/BRICS-CCI-CBIC.2013.47","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.47","url":null,"abstract":"Finding Nash equilibria has been one of the early objectives of research in game theory, and still represents a challenge to this day. We introduce a multiobjective formulation for computing Pareto-optimal sets of mixed Nash equilibria in normal form games. Computing these sets can be notably useful in decision making, because it focuses the analysis on solutions with greater outcome and hence more stable and desirable ones. While the formulation is suitable for any multiobjective optimization algorithm, we employ a method known as the cone-epsilon MOEA, due to its good convergence and diversity characteristics when solving multiobjective optimization problems. The adequacy of the proposed formulation is tested on most normal form games provided by the GAMBIT software test suite. The results show that the cone-epsilon MOEA working on the proposed formulation correctly finds the Pareto-optimal Nash equilibra in most games.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117135969","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}
Pub Date : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.31
A. Engelbrecht
A number of empirical studies have compared the two extreme neighborhood topologies used in particle swarm optimization (PSO) algorithms, namely the star and the ring topologies. Based on these empirical studies, and also based on intuitive understanding of these neighborhood topologies, there is a faction within the PSO research community that advocates the use of the local best (lbest) PSO due to its better exploration abilities, diminished susceptibility to being trapped in local minima, and because it does not suffer from premature convergence as is the case with the global best (gbest) PSO. However, the opinions that emanated from these studies were based on a very limited benchmark suite containing only a few benchmark functions. This paper conducts a very elaborate empirical comparison of the gbest and lbest PSO algorithms on a benchmark suite of 60 boundary constrained minimization problems of varying complexities. The statistical analysis conducted shows that the general statements made about premature convergence, exploration ability, and even solution accuracy are not correct, and shows that neither of the two algorithms can be considered outright as the best, not even for specific problem classes.
{"title":"Particle Swarm Optimization: Global Best or Local Best?","authors":"A. Engelbrecht","doi":"10.1109/BRICS-CCI-CBIC.2013.31","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.31","url":null,"abstract":"A number of empirical studies have compared the two extreme neighborhood topologies used in particle swarm optimization (PSO) algorithms, namely the star and the ring topologies. Based on these empirical studies, and also based on intuitive understanding of these neighborhood topologies, there is a faction within the PSO research community that advocates the use of the local best (lbest) PSO due to its better exploration abilities, diminished susceptibility to being trapped in local minima, and because it does not suffer from premature convergence as is the case with the global best (gbest) PSO. However, the opinions that emanated from these studies were based on a very limited benchmark suite containing only a few benchmark functions. This paper conducts a very elaborate empirical comparison of the gbest and lbest PSO algorithms on a benchmark suite of 60 boundary constrained minimization problems of varying complexities. The statistical analysis conducted shows that the general statements made about premature convergence, exploration ability, and even solution accuracy are not correct, and shows that neither of the two algorithms can be considered outright as the best, not even for specific problem classes.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126604132","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}
Pub Date : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.110
R. A. de Lima Moreto, S. Gimenez, C. Thomaz
Analog integrated circuits design is a complex task due to the large number of input variables that must be determined in order to achieve different design goals such as voltage gain, unit voltage gain frequency, phase margin and dissipated power. This paper describes and implements an evolutionary optimization solution based on genetic algorithms and the well-known SPICE simulator, named "AGSPICE/FEI", with current industry standard BSIM3v3 model that has the capability of searching solutions that better comply with the multiple design goals specified a priori of a single-end, single-stage operational transconductance amplifier (OTA). The AGSPICE/FEI can provide a large set of solutions allowing the designer to choose the best solutions, which fully meet the design goals, and, thus, analyze the performance obtained by the modified genetic algorithm, which performs two types of elitism: one conventional and another non-conventional. This paper performs the study of the performance of the non-conventional elitism by comparing the performance achieved by several different groups, in which in one of them is applied only the conventional elitism and in the other groups are applied the non-conventional elitism in different settings. The results have been analyzed for different design specifications. The experimental results have demonstrated that this new elitism stage is able to increase the speed of the AGSPICE/FEI searching process and also might provide solutions that better suit the design goals.
{"title":"Analysis of a New Evolutionary System Elitism for Improving the Optimization of a CMOS OTA","authors":"R. A. de Lima Moreto, S. Gimenez, C. Thomaz","doi":"10.1109/BRICS-CCI-CBIC.2013.110","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.110","url":null,"abstract":"Analog integrated circuits design is a complex task due to the large number of input variables that must be determined in order to achieve different design goals such as voltage gain, unit voltage gain frequency, phase margin and dissipated power. This paper describes and implements an evolutionary optimization solution based on genetic algorithms and the well-known SPICE simulator, named \"AGSPICE/FEI\", with current industry standard BSIM3v3 model that has the capability of searching solutions that better comply with the multiple design goals specified a priori of a single-end, single-stage operational transconductance amplifier (OTA). The AGSPICE/FEI can provide a large set of solutions allowing the designer to choose the best solutions, which fully meet the design goals, and, thus, analyze the performance obtained by the modified genetic algorithm, which performs two types of elitism: one conventional and another non-conventional. This paper performs the study of the performance of the non-conventional elitism by comparing the performance achieved by several different groups, in which in one of them is applied only the conventional elitism and in the other groups are applied the non-conventional elitism in different settings. The results have been analyzed for different design specifications. The experimental results have demonstrated that this new elitism stage is able to increase the speed of the AGSPICE/FEI searching process and also might provide solutions that better suit the design goals.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126364903","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}
Pub Date : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.115
Hugo Serrano Barbosa Filho, Josemar Faustino, R. R. Martins, R. Menezes
Brazil has a multi-party political system with 30 registered parties (as of 2013). However, anyone who knows a little about politics understands that is nearly impossible to have 30 dimensions of political positions (e.g. center, left, right, center-left, etc.) with no overlap. Hence, the obvious challenge is to understand this party system and how parties group together. However there is no obvious way to group these parties because the data we normally have come from the parties' self-assigned positioning. What we see in practice, based on how the alliances are built and how politicians change from one party to another, is that most of them do not have a well-defined positional basis. Such phenomenon has been investigated since the 90s but always based on how elected politicians migrate between different parties. Today, we have at our disposal much more data that may be used to review political leanings. In this paper, we focus on the inter-party movements of candidates and on the relationship between movements and parties' ideology and performance. Results suggest that parties' performance in elections is strongly correlated with the parties' strategies for promoting candidates.
{"title":"Strategies, Political Position, and Electoral Performance of Brazilian Political Parties","authors":"Hugo Serrano Barbosa Filho, Josemar Faustino, R. R. Martins, R. Menezes","doi":"10.1109/BRICS-CCI-CBIC.2013.115","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.115","url":null,"abstract":"Brazil has a multi-party political system with 30 registered parties (as of 2013). However, anyone who knows a little about politics understands that is nearly impossible to have 30 dimensions of political positions (e.g. center, left, right, center-left, etc.) with no overlap. Hence, the obvious challenge is to understand this party system and how parties group together. However there is no obvious way to group these parties because the data we normally have come from the parties' self-assigned positioning. What we see in practice, based on how the alliances are built and how politicians change from one party to another, is that most of them do not have a well-defined positional basis. Such phenomenon has been investigated since the 90s but always based on how elected politicians migrate between different parties. Today, we have at our disposal much more data that may be used to review political leanings. In this paper, we focus on the inter-party movements of candidates and on the relationship between movements and parties' ideology and performance. Results suggest that parties' performance in elections is strongly correlated with the parties' strategies for promoting candidates.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115121912","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}
Pub Date : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.24
M. Buzdalov, F. Tsarev
The shortest common superstring problem has important applications in computational biology (e.g. genome assembly) and data compression. This problem is NP-hard, but several heuristic algorithms proved to be efficient for this problem. For example, for the algorithm known as GREEDY it was shown that, if the optimal superstring has the length of N, it produces an answer with length not exceeding 3.5N. However, in practice, no test cases were found where the length of the answer is greater than or equal to 2N. For hard test case generation for such algorithms the traditional approach assumes creating such tests by hand. In this paper, we propose an evolutionary algorithm based framework for hard test case generation. We examine two approaches: single-objective and multi-objective. We introduce new test case quality measures and show that, according to these measures, automatically generated tests are better than any known ones.
{"title":"An Evolutionary Approach to Hard Test Case Generation for Shortest Common Superstring Problem","authors":"M. Buzdalov, F. Tsarev","doi":"10.1109/BRICS-CCI-CBIC.2013.24","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.24","url":null,"abstract":"The shortest common superstring problem has important applications in computational biology (e.g. genome assembly) and data compression. This problem is NP-hard, but several heuristic algorithms proved to be efficient for this problem. For example, for the algorithm known as GREEDY it was shown that, if the optimal superstring has the length of N, it produces an answer with length not exceeding 3.5N. However, in practice, no test cases were found where the length of the answer is greater than or equal to 2N. For hard test case generation for such algorithms the traditional approach assumes creating such tests by hand. In this paper, we propose an evolutionary algorithm based framework for hard test case generation. We examine two approaches: single-objective and multi-objective. We introduce new test case quality measures and show that, according to these measures, automatically generated tests are better than any known ones.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132652983","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：