K-Nearest Neighbor Algorithm for Data-Driven IT Governance: A Case Study of Project Outcome Prediction

0Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This study examines the application of the k-Nearest Neighbor (k-NN) algorithm for predicting IT project outcomes to support data-driven decision-making in IT governance. The algorithm was applied to a dataset of historical projects from a mid-sized technology company. Despite limitations like sensitivity to parameter tuning, the simplicity and interpretability of k-NN demonstrate its potential as an IT governance decision tool. However, the single case study design restricts generalizability. Further research should explore ensemble approaches to improve robustness, compare k-NN with other methods, and assess its effectiveness across diverse organizational contexts.

Cite

CITATION STYLE

APA

Suharyanto, A., Kraugusteeliana, K., Yuniningsih, Y., Agustinova, D. E., Ramdani, A., & Rahim, R. (2024). K-Nearest Neighbor Algorithm for Data-Driven IT Governance: A Case Study of Project Outcome Prediction. Journal of Logistics, Informatics and Service Science, 11(2), 142–154. https://doi.org/10.33168/JLISS.2024.0209

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free