Innovation In Project Management Utilizing Machine Learning Technology
Abstract
The successful adoption of programmable machines for complex tasks opens up opportunities for productivity and more efficient communication, but also poses serious challenges in IT project management. This study aims to tackle the issue of high project failure rates caused by inadequate planning. It aims to assist project managers in enhancing their project planning by implementing real-time solutions through the utilization of machine learning (ML) algorithms and a user-friendly graphical interface. This research is divided into two key phases. The initial phase involves an examination of existing literature in the field of machine learning to identify relevant concepts applicable to project management. In the subsequent stage, two distinct types of ML algorithms, namely example-based learning and regression modeling, will be integrated into a user-friendly platform. This research develops a system that utilizes machine learning algorithms to assist project managers in real-time or near real-time through a user-friendly graphical interface, with a focus on improving project planning and risk mitigation. This research shows that machine learning algorithms provide positive results in overcoming human factors and preventing risks based on the experience of project managers.
References
A. Gupta, P. Roy, P& V. Dutt, “Evaluation of Instance-Based Learning and Q-Learning Algorithms in Dynamic Environments”, IEEE Access, 9, 138775–138790, 2021. https://doi.org/10.1109/access.2021.3117855
A.R. Peslak. (2012, July 1). “Information Technology Project Management and Project Success”, International Journal of Information Technology Project Management, 3(3), 31–44, 2012. https://doi.org/10.4018/jitpm.2012070103
B. Martens, “The Importance of Data Access Regimes for Artificial Intelligence and Machine Learning”, SSRN Electronic Journal. 2018. https://doi.org/10.2139/ssrn.3357652
B. W. Boehm, “A spiral model of software development and enhancement”, Computer, 21(5), 61–72, 1988. https://doi.org/10.1109/2.59
J. Sirignano & K. Spiliopoulos, “Stochastic Gradient Descent in Continuous Time: A Central Limit Theorem”, Stochastic Systems, 10(2), 124–151, 2020. https://doi.org/10.1287/stsy.2019.0050
J.C. Stoltzfus, “Logistic Regression: A Brief Primer”, Academic Emergency Medicine, 18(10), 1099–1104, 2011. https://doi.org/10.1111/j.1553-2712.2011.01185.x
J.M. Wilson, “Gantt charts: A centenary appreciation”, European Journal of Operational Research, 149(2), 430–437, 2003. https://doi.org/10.1016/s0377-2217(02)00769-5
J.T/ Marchewka, Information Technology Project Management. John Wiley & Sons, 2016.
JT. Santoso. Introduction to Information Technology Project Management. Prima Agus Teknik Foundation: Indonesia. ISBN: 978-6238-12046-8.2023
K. Thirumoorthy, & K. Muneeswaran, “Feature selection using hybrid poor and rich optimization algorithm for text classification”, Pattern Recognition Letters, 147, 63–70, 2021. https://doi.org/10.1016/j.patrec.2021.03.034
M. Abadi, “TensorFlow: learning functions at scale”, ACM SIGPLAN Notices, 51(9), 1–1, 2016. https://doi.org/10.1145/3022670.2976746
M. Islam, G. Hu & Q. Liu, “Online Model Updating and Dynamic Learning Rate-Based Robust Object Tracking”, Sensors, 18(7), 2046, 2018. https://doi.org/10.3390/s18072046
M.A. Tahir, A. Bouridane, A., & F. Kurugollu, “Simultaneous feature selection and feature weighting using Hybrid Tabu Search/K-nearest neighbor classifier”, Pattern Recognition Letters, 28(4), 438-446, 2007.
Masahiro Shibuya, & Xuebin Chen, “Production Planning and Management Using Gantt Charts”, Journal of Mechanics Engineering and Automation, 11(3), 2021. https://doi.org/10.17265/2159-5275/2021.03.002
O. Lemke, & B. Keller, “Common Nearest Neighbor Clustering—A Benchmark”, Algorithms, 11(2), 19, 2018. https://doi.org/10.3390/a11020019
P. Bugata & P. Drotár, “Weighted nearest neighbors feature selection”, Knowledge-Based Systems, 163, 749–761, 2019. https://doi.org/10.1016/j.knosys.2018.10.004
P. Drotár, “Weighted k-Nearest Neighbors Feature Selection (WkNN-FS)”, Science Trends, 2019. https://doi.org/10.31988/scitrends.48207
P.W. Cahyo & A. I. Wicaksono, “Django Framework and Python-Gammu as Middleware SMS Broadcast”, Compiler, 8(1), 27, 2019. https://doi.org/10.28989/compiler.v8i1.430
R. Archibald, “A Stochastic Gradient Descent Approach for Stochastic Optimal Control”, East Asian Journal on Applied Mathematics, 10(4), 635–658, 2020. https://doi.org/10.4208/eajam.190420.200420
R.E. Bellman, Dynamic Programming. Courier Corporation. 2003.
R.V. Babu, Ayyappan, G., & A. Kumaravel, “Comparison of Linear Regression and Simple Linear Regression for critical temperature of semiconductor”, Indian Journal of Computer Science and Engineering, 10(6), 177–183, 2020. https://doi.org/10.21817/indjcse/2019/v10i6/191006050
S. Castelo, M. Ponti & R. Minghim, “A Visual Mining Approach to Improved Multiple- Instance Learning”, Algorithms, 14(12), 344, 2021. https://doi.org/10.3390/a14120344
S. McConnell, Rapid development: taming wild software schedules. Pearson Education. 1996
T. DeMarco, & A. Miller. Managing Large Software Projects. IEEE Software, 13(4), 24, 1996. https://doi.org/10.1109/ms.1996.526827
W. Yaokumah & E. Biney, “Integrated Financial Management Information System Project Implementation in Ghana Government Ministries”, International Journal of Information Technology Project Management, 11(1), 17–31, 2020. https://doi.org/10.4018/ijitpm.2020010102
X. Peng, R. Chen, K. Yu, F. Ye, & W. Xue, “An Improved Weighted K-Nearest Neighbor Algorithm for Indoor Localization”, Electronics, 9(12), 2117, 2020. https://doi.org/10.3390/electronics9122117
Y.T.J Kiran, “Computer vision accuracy analysis with deep learning model using tensorFlow”, International Journal of Innovative Research in Computer Science & Technology, 8(4), 2020. https://doi.org/10.21276/ijircst.2020.8.4.13
Z. Hajizadeh, M. Taheri & M.Z. Jahromi, “Nearest Neighbor Classification with Locally Weighted Distance for Imbalanced Data”, International Journal of Computer and Communication Engineering, 3(2), 81–86, 2014. https://doi.org/10.7763/ijcce.2014.v3.296
Z. Wang, Y. Zhao, YY. Liu, & C. Lv, “A speculative parallel simulated annealing algorithm based on Apache Spark”, Concurrency and Computation: Practice and Experience, 30(14), e4429, 2018. https://doi.org/10.1002/cpe.4429
Zhang, C., Yao, J., Hu, G., & Sch鴗t, T. (2020). Applying Feature-Weighted Gradient Decent K-Nearest Neighbor to Select Promising Projects for Scientific Funding. Computers, Materials & Continua, 64(3), 1741–1753. https://doi.org/10.32604/cmc.2020.010306
