基于格点特征定位的可扩展算法

20th IEEE International Conference on Software Maintenance, 2004. Proceedings. Pub Date : 2004-09-11 DOI:10.1109/ICSM.2004.1357870

Wei Zhao, Lu Zhang, Dan Hao, Hong Mei, Jiasu Sun

{"title":"基于格点特征定位的可扩展算法","authors":"Wei Zhao, Lu Zhang, Dan Hao, Hong Mei, Jiasu Sun","doi":"10.1109/ICSM.2004.1357870","DOIUrl":null,"url":null,"abstract":"Considering the scalability of using formal concept analysis to locate features in source code, we present a set of alternative straightforward algorithms to achieve the same objectives. A preliminary experiment indicates that the alternative algorithms are more scalable to deal with the large numbers of data to some extent.","PeriodicalId":348668,"journal":{"name":"20th IEEE International Conference on Software Maintenance, 2004. Proceedings.","volume":"171 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Alternative scalable algorithms for lattice-based feature location\",\"authors\":\"Wei Zhao, Lu Zhang, Dan Hao, Hong Mei, Jiasu Sun\",\"doi\":\"10.1109/ICSM.2004.1357870\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Considering the scalability of using formal concept analysis to locate features in source code, we present a set of alternative straightforward algorithms to achieve the same objectives. A preliminary experiment indicates that the alternative algorithms are more scalable to deal with the large numbers of data to some extent.\",\"PeriodicalId\":348668,\"journal\":{\"name\":\"20th IEEE International Conference on Software Maintenance, 2004. Proceedings.\",\"volume\":\"171 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"20th IEEE International Conference on Software Maintenance, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSM.2004.1357870\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"20th IEEE International Conference on Software Maintenance, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSM.2004.1357870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

考虑到使用形式概念分析在源代码中定位特征的可扩展性，我们提出了一组替代的直接算法来实现相同的目标。初步实验表明，这些算法在处理大量数据时具有一定的可扩展性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Alternative scalable algorithms for lattice-based feature location

Considering the scalability of using formal concept analysis to locate features in source code, we present a set of alternative straightforward algorithms to achieve the same objectives. A preliminary experiment indicates that the alternative algorithms are more scalable to deal with the large numbers of data to some extent.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

20th IEEE International Conference on Software Maintenance, 2004. Proceedings.

自引率

0.00%

发文量