A Graph Clustering Algorithm for the Homology Detection

Li Xiao; Jing Zhong Xiao

doi:10.4028/www.scientific.net/AMM.52-54.1981

Paper Titles

Multidisciplinary Optimization Method about the Thickness of Engine Hood Based on Pedestrian Protection
p.1958

Measurement Slub Yarn Parameter by Parallel-Plate Capacitor
p.1964

Determination on Slub Length for Slubby Yarn of Ring Bobbin
p.1970

Analysis and Improvement for K-Means Algorithm
p.1976

A Graph Clustering Algorithm for the Homology Detection
p.1981

Experimental Investigation on the Polypropylene Fiber Concrete Performance of Yellow River Canal Lining in the Middle Line of South-to-North Water Transfer Project
p.1987

Research about Application of Informatization Service on Tourism Economy Management
p.1992

An Automation Fuzzy Switching Bang-Bang Controller for Industrial Applications
p.1997

Performance of Cryogenic Machining with Nitrogen Gas in Machining of Titanium
p.2003

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 52-54A Graph Clustering Algorithm for the Homology...

A Graph Clustering Algorithm for the Homology Detection

Abstract:

In order to detect a large number of source program samples which are homologous files (files with plagiarism), a new graph-based cluster detection algorithm is proposed，the algorithm is divided into two phases, in the first phase, proposed algorithm based on the keyword program to calculate pairwise similarity in the detected sample program files,in the second stage,by means of graph clustering algorithm, the results of the first phase is dectected, homologous files (files with plagiarism) will form a cluster. The simulation results shows that the algorithm improved detection rate compare with the traditional homologous files detection algorithm and can determine which files are homologous.

You might also be interested in these eBooks

Advances in Mechanical Engineering (ICME)

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 52-54)

Pages:

1981-1986

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.52-54.1981

Citation:

Cite this paper

Online since:

March 2011

Authors:

Li Xiao, Jing Zhong Xiao

Keywords:

Graphics Cluster, Plagiarism Detection, Two-Stage

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] TR 14-03 (2003) An XML plagiarism detection model for procedural programming languages. Iowa State University, IA.

Google Scholar

[2] Grier, S. (1981) A tool that detects plagiarism in Pascal programs. ACM SIGCSE Bull, 13, 21–25.

DOI: 10.1145/953049.800954

Google Scholar

[3] Donaldson, J, Lancaster, A and Sposato, P (1981) A plagiarism detection system. ACM SIGCSE Bull, 13, 15–20.

DOI: 10.1145/953049.800955

Google Scholar

[4] Allen, F and Cocke, J (1976) A program data ﬂow analysis procedure. Commun ACM, 19, 137–147.

Google Scholar

[5] Verco, K. and Wise, M(1996).

Google Scholar

[6] Verco KL, Wise MJ Software for detecting suspected plagiarism: compareing structure and attribute-counting systems. In: Proceedings of the 1st Australian Conference on Computer Science Education. 1996. pp.3-5.

DOI: 10.1145/369585.369598

Google Scholar

[7] Parker, A and Hamblen, J (1989) Computer algorithms for plagiarism detection. IEEE Trans. on Educ., 32, 94–99.

DOI: 10.1109/13.28038

Google Scholar

[8] P.K. Agarwal and C.M. Procopiuc, ªExact and Approximation Algorithms for Clustering, º Proc. Ninth Ann. ACM-SIAM Symp. Discrete Algorithms, pp.658-667, Jan. (1998).

Google Scholar

[9] K. Alsabti, S. Ranka, and V. Singh, ªAn Efficient k-means Clustering Algorithm, º Proc. First Workshop High Performance DataMining, Mar. (1998).

Google Scholar

[10] S. Arora, P. Raghavan, and S. Rao, ªApproximation Schemes for Euclidean k-median and Related Problems, º Proc. 30th Ann. ACM Symp. Theory of Computing, pp.106-113, May (1998).

Google Scholar

[11] S. Arya and D. M. Mount, ªApproximate Range Searching, Computational Geometry: Theory and Applications, vol. 17, pp.135-163, (2000).

Google Scholar