On the Effect of Minimum Support and Maximum Gap for Code Clone Detection － An Approach Using Apriori-based Algorithm －
On the Effect of Minimum Support and Maximum Gap for Code Clone Detection － An Approach Using Apriori-based Algorithm －
复制标题
DOI：
--
复制
发表时间：
2017
影响因子：
2.4
通讯作者：
Yoshihisa Udagawa
中科院分区：
文献类型：
--
作者：
Yoshihisa Udagawa
— Software clones are introduced to source code by copying and slightly modifying code fragments for reuse. Thus, detection of code clones requires a partial match of code fragments. The essential idea of the proposed approach is a combination of a partial string match using the longest-common-subsequence (LCS) and an apriori -based mining for finding frequent sequences. The novelty of our approach includes the maximal frequent sequences to find the most compact representation of sequential patterns. After outlining the proposed methods, the paper reports on the results of a case study using Java SDK 1.8.0_101 awt graphics package with highlighting the effect analysis on thresholds of the proposed algorithm, i.e., a minimum support and a maximum gap. The results demonstrate the proposed algorithm can detect all possible code clones in the sense that code clones are similar code segments that occur at least twice in source code under consideration.
