Alternative scalable algorithms for lattice-based feature location
ICSM（2004）
摘要
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.
更多查看译文
关键词
preliminary experiment,alternative algorithm,alternative straightforward algorithm,scalable algorithms,lattice-based feature location,formal concept analysis,large number,data visualisation,source code,alternative scalable algorithms,formal specification,binary relation,concept analysis
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要