Comparative Analysis Performance of K-Nearest Neighbor Algorithm and Adaptive Boosting on the Prediction of Non-Cash Food Aid Recipients

Yustikasari, Yusi; Mubarok, Husni; Rianto, Rianto

doi:10.15294/sji.v9i2.32369

Cited by 2 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Technological advances and the increasing Internet use have impacted all aspects of life [1]- [3], including education [4]. Educational organizations have a responsibility towards society as users of their services.…”

Section: Introductionmentioning

confidence: 99%

Analysis Impact of Rapid Application Development Method on Development Cycle and User Satisfaction: A Case Study on Web-Based Registration Service

Riadi,

Yudhana,

Elvina

2024

SJI

View full text Add to dashboard Cite

Purpose: This research was conducted to respond to obstacles and inefficiencies in the new student registration system at RA Plus Rabbani. Currently, the conventional method of using physical documents for registration is vulnerable to damage and data loss. Therefore, the proposed solution is implementing a website-based online registration system using the Rapid Application Development (RAD) method. This aims to simplify the process, increase accessibility for prospective students, and reduce the costs and time required.Methods: This research commenced by identifying constraints within the conventional student registration system at RA Plus Rabbani through observations and interviews. The development, following the RAD methodology, involved testing with PHPUnit and Blackbox Testing to ensure the functionality of the system aligned with specifications. In addition, usability evaluation was conducted based on the ISO 9126 standard.Result: The research results show that testing on MVC indicated a 100% success rate for each architectural feature. Referring to expectations with a “valid” conclusion on functionality using Blackbox testing, based on ISO 9126 percentage displayed, it is known that the criterion with the most significant value is the understandability characteristic with a value of 83%. Novelty: This research makes a significant contribution by improving student registration services at RA Plus Rabbani through the implementation of various testing techniques, following the research flow offered by RAD. The study also provides substantial references for further research in web-based system development.

show abstract

Section: Introductionmentioning

confidence: 99%

Analysis Impact of Rapid Application Development Method on Development Cycle and User Satisfaction: A Case Study on Web-Based Registration Service

Riadi,

Yudhana,

Elvina

2024

SJI

View full text Add to dashboard Cite

show abstract

“…This algorithm calculates the minimum cost in numerical units needed to transform one or an array of strings into another, thereby providing a resultant similarity value. The next step used a Confusion Matrix table to assess the successful and failed rate [23], [24] of detecting plagiarism pairs. From the confusion matrix, metrics such as Accuracy [25], Precision, Recall, and F-Measure values were obtained.…”

Section: Introductionmentioning

confidence: 99%

Damerau-Levenshtein Distance Algorithm Based on Abstract Syntax Tree to Detect Code Plagiarism

Nuraminah,

Ammar

2023

SJI

View full text Add to dashboard Cite

Purpose: This research aimed to detect source code plagiarism based on Abstract Syntax Tree using Damerau-Levenshtein Distance algorithm, which is expected to streamline the inaccuracies and time-consumption associated with the manual process.Methods: Damerau-Levenshtein Distance algorithm was used to determine the similarity between source code files and calculate F-Measure. The dataset, which consisted of 178 source code files from 20 coursework assignments, was obtained from GitHub by Lawton Nichols in 2019. Damerau-Levenshtein Distance algorithm was used to compute the minimum cost required to transform one line of code into another. Furthermore, ANTLR detected AST, which was processed through preprocessing, including node pruning, function and variable sorting, and log output removal. Result: The result showed that the two methods took 5.704 seconds and 0.996 seconds to complete. The lowest and highest values obtained using F-Measure were 0.16 and 0.8, respectively. Therefore, the system performed detection processes quickly and effectively detected common forms of code plagiarism with difficulty in the more complex forms. Novelty: In conclusion, this research used AST and Damerau-Levenshtein Distance algorithm to calculate the 5 levels of similarity in Java programming language source code. For further development, preprocessing steps were needed to prune unnecessary nodes and detect equivalent but differently syntaxed code.

show abstract

Comparative Analysis Performance of K-Nearest Neighbor Algorithm and Adaptive Boosting on the Prediction of Non-Cash Food Aid Recipients

Cited by 2 publications

References 7 publications

Analysis Impact of Rapid Application Development Method on Development Cycle and User Satisfaction: A Case Study on Web-Based Registration Service

Analysis Impact of Rapid Application Development Method on Development Cycle and User Satisfaction: A Case Study on Web-Based Registration Service

Damerau-Levenshtein Distance Algorithm Based on Abstract Syntax Tree to Detect Code Plagiarism

Contact Info

Product

Resources

About