Non-relevant document reduction in anti-plagiarism using asymmetric similarity and AVL tree index

2014 5th International Conference on Intelligent and Advanced Systems: Technological Convergence for Sustainable Future, ICIAS 2014 - Proceedings

Volumn , Issue , 2014, Pages

  Oktoveri, Adeva ^a   Wibowo, Agung Toto ^a   Barmawi, Ari Moesriami ^a  

^a TELKOM UNIVERSITY   (Indonesia)

Author keywords

AVL Tree; Information Retrieval; Longest Common Subsequence; Plagiarism Detection; Term Frequency; Winnowing

Indexed keywords

FORESTRY; INFORMATION RETRIEVAL; INTELLECTUAL PROPERTY;

AVL TREE; LONGEST COMMON SUBSEQUENCES; PLAGIARISM DETECTION; TERM FREQUENCY; WINNOWING;

TREES (MATHEMATICS);

ALGORITHMS; FORESTRY; INFORMATION RETRIEVAL;

EID: 84906351331     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIAS.2014.6869547     Document Type: Conference Paper

References (15)

1. Adelson-Velskii, G., & Landis, E. M. (1963). An Algorithm for the Organization of Information. Proceedings of the USSR Academy of Sciences 146, 263-266.
2. Campos, R., & Martinez, F. (2012). Batch Source-Code Plagiarism Detection Using An Algorithm For the Bounded Longest Common Subsequence Problem. Electrical Engineering, Computing Science and Automatic Control (CCE), 2012 9th International Conference on IEEE, 1-4.
3. Finkel, R. A., Zaslavsky, A., Monostori, K., & Schmidt, H. (2002). Signature extraction for overlap detection in documents. Australian Computer Science Communications, 24, 59-64.
4. Foster, C. C. (1965). Information retrieval: information storage and retrieval using AVL trees. ACM '65 Proceedings of the 1965 20th national conference, 192-205.
5. Iliopoulos, C. S., & Rahman, M. S. (2009). A New Efficient Algorithm for Computing the Longest Common Subsequence. Theory of Computing Systems, 355-371.
6. Irving, R. W., & Love, L. (2003). The Suffix Binary Search Tree and Suffix AVL Tree. Journal of Discrete Algorithms, 387-408.
7. Manning, C. D., Raghavan, P., & Schütze, H. (2008). Introduction of Information Retrieval (Vol. 1). Cambridge: Cambridge University Press.
8. Schleimer, S., Wilkerson, D. S., & Aiken, A. (2003). Winnowing: Local Algorithms for Document Fingerprinting. Proceedings of the 2003 ACM SIGMOD international conference on Management of data, 76-85.
9. Stein, B., & Eissen, S. M. (2006). Near Similarity Search and Plagiarism Analysis. From Data and Information Analysis to Knowledge Engineering, 430-437.
10. Su, Z., Ahn, B.-R., Eom, K.-Y., & Kang, M.-K. (2008). Plagiarism Detection Using the Levenshtein Distance And Smith-Waterman Algorithm. Innovative Computing Information and Control, 2008. ICICIC'08. 3rd International Conference on IEEE, 569-569.
11. Sudarmadi, K. W. (2013). Analysis and Implementation of Plagiarism Indication Detection using Co-Occurrence Statistical Information and Longest Common Subsequence. Bandung: Telkom Institute of Technology.
12. Supriyanto, C., Rakasiwi, S., & Syukur, A. (2012). A Comparison of Rabin Karp and Semantic-Based Plagiarism Detection. 3rd International Conferences on Soft Computing, Intelligent System and Information Technology, 29-31.
13. Tala, F. (2003). A study of stemming effects on information retrieval in Bahasa Indonesia.
14. Tim Penyusun Kamus Pusat Bahasa. (2005). Kamus Besar Bahasa Indonesia. Jakarta: Balai Pustaka.
15. Wibowo, A. T., Sudarmadi, K. W., & Barmawi, A. M. (2013). Comparison Between Fingerprint and Winnowing Algorithm to Detect Plagiarism Fraud on Bahasa Indonesia Documents. Information and Communication Technology (ICoICT), 2013 International Conference of IEEE, 128-133.