{"title":"用于比较嵌套软件分解的框架","authors":"Mark Shtern, Vassilios Tzerpos","doi":"10.1109/WCRE.2004.6","DOIUrl":null,"url":null,"abstract":"The evaluation of results obtained from software clustering algorithms has attracted the attention of many reverse engineering researchers. Several methods that compare flat decompositions of software systems have been presented in the literature. However, software clustering algorithms often produce nested decompositions. Converting nested decompositions to flat ones in order to compare them may remove significant information. We introduce a framework called END that reuses comparison methods for flat decompositions in order to compare nested decompositions without loss of information. We also present experimental results with END using several existing methods as plugins that demonstrate its usefulness.","PeriodicalId":443491,"journal":{"name":"11th Working Conference on Reverse Engineering","volume":"119 28","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"A framework for the comparison of nested software decompositions\",\"authors\":\"Mark Shtern, Vassilios Tzerpos\",\"doi\":\"10.1109/WCRE.2004.6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The evaluation of results obtained from software clustering algorithms has attracted the attention of many reverse engineering researchers. Several methods that compare flat decompositions of software systems have been presented in the literature. However, software clustering algorithms often produce nested decompositions. Converting nested decompositions to flat ones in order to compare them may remove significant information. We introduce a framework called END that reuses comparison methods for flat decompositions in order to compare nested decompositions without loss of information. We also present experimental results with END using several existing methods as plugins that demonstrate its usefulness.\",\"PeriodicalId\":443491,\"journal\":{\"name\":\"11th Working Conference on Reverse Engineering\",\"volume\":\"119 28\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"11th Working Conference on Reverse Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCRE.2004.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"11th Working Conference on Reverse Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCRE.2004.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A framework for the comparison of nested software decompositions
The evaluation of results obtained from software clustering algorithms has attracted the attention of many reverse engineering researchers. Several methods that compare flat decompositions of software systems have been presented in the literature. However, software clustering algorithms often produce nested decompositions. Converting nested decompositions to flat ones in order to compare them may remove significant information. We introduce a framework called END that reuses comparison methods for flat decompositions in order to compare nested decompositions without loss of information. We also present experimental results with END using several existing methods as plugins that demonstrate its usefulness.