{"title":"基于遗传算法的可重用类库多路聚类和检索优化","authors":"Byungjeong Lee, B. Moon, Chisu Wu","doi":"10.1109/APSEC.1998.733547","DOIUrl":null,"url":null,"abstract":"In order to improve code reliability and development productivity, software reuse is a clear solution and a reuse library based on object-oriented technology is essential. It is also very important to classify components elaborately and retrieve them accurately in the reuse library. In this paper, we present genetic algorithms for multi-way clustering, in which the number of clusters, similarity in a cluster and similarity between clusters are taken into consideration with the aim of finding optimized clusters into which components are classified, and for cluster-based linear retrieval with the aim of finding an optimal query which retrieves clusters containing components similar to a given query. We compare genetic algorithms with simulated annealing algorithms for multi-way clustering and cluster-based retrieval. The results of our experiments demonstrate that generic algorithms produce better solutions than those obtained by simulated annealing algorithms. We implemented a Reusable Class Library (RCL) using these methods, which is based on CORBA.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Optimization of multi-way clustering and retrieval using genetic algorithms in reusable class library\",\"authors\":\"Byungjeong Lee, B. Moon, Chisu Wu\",\"doi\":\"10.1109/APSEC.1998.733547\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to improve code reliability and development productivity, software reuse is a clear solution and a reuse library based on object-oriented technology is essential. It is also very important to classify components elaborately and retrieve them accurately in the reuse library. In this paper, we present genetic algorithms for multi-way clustering, in which the number of clusters, similarity in a cluster and similarity between clusters are taken into consideration with the aim of finding optimized clusters into which components are classified, and for cluster-based linear retrieval with the aim of finding an optimal query which retrieves clusters containing components similar to a given query. We compare genetic algorithms with simulated annealing algorithms for multi-way clustering and cluster-based retrieval. The results of our experiments demonstrate that generic algorithms produce better solutions than those obtained by simulated annealing algorithms. We implemented a Reusable Class Library (RCL) using these methods, which is based on CORBA.\",\"PeriodicalId\":296589,\"journal\":{\"name\":\"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APSEC.1998.733547\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSEC.1998.733547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimization of multi-way clustering and retrieval using genetic algorithms in reusable class library
In order to improve code reliability and development productivity, software reuse is a clear solution and a reuse library based on object-oriented technology is essential. It is also very important to classify components elaborately and retrieve them accurately in the reuse library. In this paper, we present genetic algorithms for multi-way clustering, in which the number of clusters, similarity in a cluster and similarity between clusters are taken into consideration with the aim of finding optimized clusters into which components are classified, and for cluster-based linear retrieval with the aim of finding an optimal query which retrieves clusters containing components similar to a given query. We compare genetic algorithms with simulated annealing algorithms for multi-way clustering and cluster-based retrieval. The results of our experiments demonstrate that generic algorithms produce better solutions than those obtained by simulated annealing algorithms. We implemented a Reusable Class Library (RCL) using these methods, which is based on CORBA.