{"title":"Speciated GA for optimal ensemble classifiers in DNA microarray classification","authors":"Sung-Bae Cho, Chanho Park","doi":"10.1109/CEC.2004.1330911","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330911","url":null,"abstract":"With the development of microarray technology, the classification of microarray data has risen as an important topic over the past decade. From various feature selection methods and classifiers, it is very hard to find a perfect method to classify microarray data due to the incompleteness of algorithms, the defects of data, etc. This paper proposes a sophisticated ensemble of such features and classifiers to obtain high classification performance. Speciated genetic algorithm has been exploited to get the diverse ensembles of features and classifiers in a reasonable time. Experimental results with two well-known datasets indicate that the proposed method finds many good ensembles that are superior to other individual classifiers.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127473127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A local analysis of the genotype-fitness mapping in hardware optimization problems","authors":"E. Sánchez, Giovanni Squillero, M. Violante","doi":"10.1109/CEC.2004.1330952","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330952","url":null,"abstract":"This paper suggests a framework to examine, evaluate and characterize an evolutionary test-program generation problem. The methodology exploits the definition of distance functions at the genotypic and phenotypic levels to perform a local analysis of an unknown space. A hardware accelerator device is used for speeding up test-program evaluations. A complex microprocessor was used as case study. Experiments show how the local analysis allowed discovering several characteristics of the task and foreseeing the behavior of the test-program generation.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127505090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An angular distance dependent alternation model for real-coded genetic algorithms","authors":"O. Takahashi, S. Kobayashi","doi":"10.1109/CEC.2004.1331164","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331164","url":null,"abstract":"When we use genetic algorithms to solve any type of problems, it is important to maintain the diversity of populations for avoiding early stage stagnation or falling into local minima. We propose an angular distance dependent alternation (ADDA) model as a generation alternation model on real-coded genetic algorithms (GA) to improve its performance by maintaining adequate diversity of populations. The basic concept of the ADDA is that all of offspring generated by crossover operations will be clustered by a corresponding parent based on the angular distance metric and will be transposed from the parent. We compare performance of the proposed alternation model with previous family based minimal generation gap (MGG) model and distance dependent alternation (DDA) model. Using with the multi-parental unimodal normal distribution crossover (UNDX-m), the ADDA model shows good performance on three typical benchmark problems.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124328329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"To understand one-dimensional continuous fitness landscapes by drift analysis","authors":"Jun He, X. Yao, Qingfu Zhang","doi":"10.1109/CEC.2004.1331040","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331040","url":null,"abstract":"This work shows that we could describe the characteristics of easy and hard fitness landscapes in one-dimensional continuous space by drift analysis. The work expends the existing results in the discrete space into the continue space. A fitness landscape, here, is regarded as the behaviour of an evolutionary algorithm on fitness functions. Based on the drift analysis, easy fitness landscapes are thought to be a \"short-distance\" landscape, which is easy for the evolutionary algorithm to find the optimal point; and hard fitness landscapes then are as a far-distance landscape, which the evolutionary algorithm had to spend a long time to find the optimal point.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124358952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparing performance of binary-coded detectors and constraint-based detectors","authors":"Haiyu Hou, G. Dozier","doi":"10.1109/CEC.2004.1330937","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330937","url":null,"abstract":"Artificial immune systems can be used to detect intrusion by classifying network activities as normal or abnormal. High detection rates and low false positive rates are two necessary features of successful AIS. Strong detectors are the basis of creating a successful AIS. Some preliminary experiments showed its promise to encode detectors in the form of data triples. Currently, there are two types of detectors: binary-coded and constraint-based. This paper compares the two types of detectors using simulated network traffic data. The results show that constraint-based detectors perform better than binary-coded detectors.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121810953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evolving document features for Web document clustering: a feasibility study","authors":"M. P. Sinka, D. Corne","doi":"10.1109/CEC.2004.1330955","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330955","url":null,"abstract":"Document analysis and its associated research underpins Web intelligence and the envisaged 'semantic Web'. A key issue is how to encode a document without losing salient information. Current research almost always uses fixed-length vectors based on word (term) frequency (TF) and/or variants thereof. We explore the question of alternative encodings, and we search for such encodings using an evolutionary algorithm (EA). These alternatives consider a variety of other features that can be extracted from a document, and the EA explores the space of weighted combinations of these. Tests on the BankSearch dataset were able to find encodings which outperformed previous results using TF-based encodings. Among several tentative findings it seems clear that the ideal encoding is highly task-dependent, and we can recommend certain features as useful for specific types of document clustering tasks.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121707078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Swarm guidance using a multi-objective co-evolutionary on-Line evolutionary algorithm","authors":"E. Hughes","doi":"10.1109/CEC.2004.1331192","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331192","url":null,"abstract":"This paper details the application of a multi-objective cooperative co-evolutionary on-line EA (MOC-COLEA) to the guidance of a swarm of multiple missiles, against multiple targets. The multi-objective algorithm is used to develop a dynamic objective front which is used to trade the spatial distribution of missiles at impact, against the time to impact. Each missile optimises its own performance, based on limited information of the current intended actions of the other missiles. The decision making process is thus distributed between the missiles giving distributed coordination. Results demonstrate the algorithm can form effective leader-less distributed control for multiple missiles against multiple targets in noisy and environments.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"559 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123314465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Recent advances in particle swarm","authors":"Xiaohui Hu, Yuhui Shi, R. Eberhart","doi":"10.1109/CEC.2004.1330842","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330842","url":null,"abstract":"This paper reviews the development of the particle swarm optimization method in recent years. Included are brief discussions of various parameters. Modifications to adapt to different and complex environments are reviewed, and real world applications are listed.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125652388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Soundness and quality of semantic retrieval in DNA-based memories with abiotic data","authors":"A. Neel, M. Garzon, Phani Penumetsa","doi":"10.1109/CEC.2004.1331126","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331126","url":null,"abstract":"Associative memories based on DNA-affinity have been proposed based in L. M. Adleman (1994) and E. Baum (1995). Previously, we have quantified the quality of retrieval of genomic information in simulation as stated in M. Garzon et al. (2003). Here, the ability of two types of DNA-based memories to store abiotic data and retrieve semantic information is evaluated for soundness and compared to state-of-the-art symbolic methods available, such as LSA (latent semantic analysis) of T. K. Landauer et al. Their ability is poor when performed without a proper compaction procedure. However, when the corpus is summarized through a selection protocol based on PCR or a training procedure on J. Chen et al. (2004) to extract useful information, their performance is much closer to that of LSA, according to human expert ratings. These results are expected to improve and scale up when actual DNA molecules are employed in real test tubes, currently a feasible goal.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128335056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new cellular automaton: five elements balance chart and its application to forest industry ecosystem","authors":"Cheng-Hsiung Chiang, Liang-Hsuan Chen","doi":"10.1109/CEC.2004.1331128","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331128","url":null,"abstract":"We propose a new cellular automaton, i.e. five elements balance chart, based on the theory of five elements, which is one of the most important parts of traditional Chinese philosophy. There are five kinds of basic elements in five elements balance chart, i.e. wood, fire, earth, metal, and water. Ancient Chinese thought used the relations of creating and controlling within the five elements to analogize the relationship between all situations and beings. In the proposed method, each element can be regarded as a cell. The transition rules are constructed according to the principle of creating and controlling. Thus, these rules are simple and intuitive. A simulation model of the forest industry ecosystem is presented to demonstrate the proposed approach. The five elements balance chart can well evaluate the balance status of the ecosystem. It also can help us to predict the quantitative variations of each member in the ecosystem.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"31 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120843931","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}