2009 Ninth International Conference on Intelligent Systems Design and Applications最新文献_第2页

Implementing Metaheuristic Optimization Algorithms with JECoLi 用JECoLi实现元启发式优化算法

2009 Ninth International Conference on Intelligent Systems Design and Applications Pub Date : 2009-11-30 DOI: 10.1109/ISDA.2009.161

Pedro Evangelista, Paulo Maia, Miguel Rocha

引用次数: 16

Algorithm Selection for Intracellular Image Segmentation Based on Region Similarity 基于区域相似度的细胞内图像分割算法选择

2009 Ninth International Conference on Intelligent Systems Design and Applications Pub Date : 2009-11-30 DOI: 10.1109/ISDA.2009.205

S. Takemoto, H. Yokota

引用次数: 19

Evaluating an Intelligent Business System with a Fuzzy Multi-criteria Approach 基于模糊多准则的智能业务系统评价

2009 Ninth International Conference on Intelligent Systems Design and Applications Pub Date : 2009-11-30 DOI: 10.1109/ISDA.2009.152

Sinan Apak, Ö. Vayvay

引用次数: 2

Speeding Up the Genetic Algorithm Convergence Using Sequential Mutation and Circular Gene Methods 利用序列突变和循环基因加速遗传算法收敛

2009 Ninth International Conference on Intelligent Systems Design and Applications Pub Date : 2009-11-30 DOI: 10.1109/ISDA.2009.140

M. B. Nia, Y. Alipouri

{"title":"Speeding Up the Genetic Algorithm Convergence Using Sequential Mutation and Circular Gene Methods","authors":"M. B. Nia, Y. Alipouri","doi":"10.1109/ISDA.2009.140","DOIUrl":"https://doi.org/10.1109/ISDA.2009.140","url":null,"abstract":"Genetic Algorithms (GAs) are intelligent computational tools which their simplicity, accuracy and adaptable topology cause them to be used in globally minimum or maximum finding problems. Developing the GAs to increase their speed in finding the global minimum or maximum of a cost function has been a big challenge until now and many variants of GA has been evolved to accomplish this goal. This paper presents two new Sequential Mutation Method and Circular Gene Method to increase the speed of the GA. These methods attain a better final answer accompanied by lesser use of cost function evaluations in comparison with the original GA and some other known complementary methods. In addition, it speeds up reaching the minimum or maximum point regarding the number of generations. A number of common test functions with known minimum values and points are tested and the results are compared with some other algorithms such as original GA, Bacterial Evolutionary Algorithm, Jumping Gene and PSO. Simulation results show that the presented methods in this paper can reach the global minimum point through lesser generations and evaluations of the cost function in comparison with the traditional methods.","PeriodicalId":330324,"journal":{"name":"2009 Ninth International Conference on Intelligent Systems Design and Applications","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114693685","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}

引用次数: 16

2009 Ninth International Conference on Intelligent Systems Design and Applications Pub Date : 2009-11-30 DOI: 10.1109/ISDA.2009.75

I. Boukhris, Zied Elouedi, T. Fober, Marco Mernberger, E. Hüllermeier

{"title":"Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Detection","authors":"I. Boukhris, Zied Elouedi, T. Fober, Marco Mernberger, E. Hüllermeier","doi":"10.1109/ISDA.2009.75","DOIUrl":"https://doi.org/10.1109/ISDA.2009.75","url":null,"abstract":"Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities and identifying functional relationships between them can thus be reduced to matching their corresponding graph descriptors. In this paper, we propose a method for the structural analysis of protein binding sites that makes use of such matching techniques to assess the similarity between proteins independently of sequence or fold homology. More specifically, we propose a similarity measure that generalizes the commonly used maximum common subgraph measure in two ways. First, using algorithms for so-called quasi-clique detection, our measure is based on maximum ‘approximately’ common subgraphs, a relaxation of maximum common subgraphs which is tolerant toward edge mismatches. Second, instead of focusing on equivalence, our measure is a compromise between a generalized equivalence and an inclusion measure. An experimental study is presented to illustrate the effectiveness of the method and to show that both types of relaxation are useful in the context of protein structure analysis.","PeriodicalId":330324,"journal":{"name":"2009 Ninth International Conference on Intelligent Systems Design and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124530847","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}

引用次数: 10

Content-Based Filtering with Tags: The FIRSt System 基于内容的标签过滤:第一个系统

2009 Ninth International Conference on Intelligent Systems Design and Applications Pub Date : 2009-11-30 DOI: 10.1109/ISDA.2009.84

P. Lops, M. Degemmis, G. Semeraro, P. Gissi, C. Musto, F. Narducci

引用次数: 6

Checking the Reliability of GeSES: Method for Detecting Symptoms of Low Performance 检查GeSES的可靠性:检测低性能症状的方法

2009 Ninth International Conference on Intelligent Systems Design and Applications Pub Date : 2009-11-30 DOI: 10.1109/ISDA.2009.213

Javier Bravo, Estefanía Martín, Alvaro Ortigosa, Rosa M. Carro

引用次数: 1

A Multiple Objective Particle Swarm Optimization Approach Using Crowding Distance and Roulette Wheel 基于拥挤距离和轮盘赌的多目标粒子群优化方法

2009 Ninth International Conference on Intelligent Systems Design and Applications Pub Date : 2009-11-30 DOI: 10.1109/ISDA.2009.73

R. A. Santana, M. R. Pontes, C. J. A. B. Filho

引用次数: 58

Neighbor Selection and Recommendations in Social Bookmarking Tools 社交书签工具中的邻居选择和推荐

2009 Ninth International Conference on Intelligent Systems Design and Applications Pub Date : 2009-11-30 DOI: 10.1109/ISDA.2009.245

A. Dattolo, Felice Ferrara, C. Tasso

引用次数: 2

A Strategy for Biodiversity Knowledge Acquisition Based on Domain Ontology 基于领域本体的生物多样性知识获取策略

2009 Ninth International Conference on Intelligent Systems Design and Applications Pub Date : 2009-11-30 DOI: 10.1109/ISDA.2009.87

Andréa Corrêa Flôres Albuquerque, José Laurindo Campos dos Santos, J. M. Netto

引用次数: 3