Claim Missing Document
Check
Articles

Found 4 Documents
Search
Journal : Journal of Computing Theories and Applications

BEHeDaS: A Blockchain Electronic Health Data System for Secure Medical Records Exchange Oladele, James Kolapo; Ojugo, Arnold Adimabua; Odiakaose, Christopher Chukwufunaya; Emordi, Frances Uchechukwu; Abere, Reuben Akporube; Nwozor, Blessing; Ejeh, Patrick Ogholuwarami; Geteloma, Victor Ochuko
Journal of Computing Theories and Applications Vol. 1 No. 3 (2024): JCTA 1(3) 2024
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.9509

Abstract

Blockchain platforms propagate into every facet, including managing medical services with professional and patient-centered applications. With its sensitive nature, record privacy has become imminent with medical services for patient diagnosis and treatments. The nature of medical records has continued to necessitate their availability, reachability, accessibility, security, mobility, and confidentiality. Challenges to these include authorized transfer of patient records on referral, security across platforms, content diversity, platform interoperability, etc. These, are today – demystified with blockchain-based apps, which proffers platform/application services to achieve data features associated with the nature of the records. We use a permissioned-blockchain for healthcare record management. Our choice of permission mode with a hyper-fabric ledger that uses a world-state on a peer-to-peer chain – is that its smart contracts do not require a complex algorithm to yield controlled transparency for users. Its actors include patients, practitioners, and health-related officers as users to create, retrieve, and store patient medical records and aid interoperability. With a population of 500, the system yields a transaction (query and https) response time of 0.56 seconds and 0.42 seconds, respectively. To cater to platform scalability and accessibility, the system yielded 0.78 seconds and 063 seconds, respectively, for 2500 users.
Enhancing the Random Forest Model via Synthetic Minority Oversampling Technique for Credit-Card Fraud Detection Aghware, Fidelis Obukohwo; Ojugo, Arnold Adimabua; Adigwe, Wilfred; Odiakaose, Christopher Chukwufumaya; Ojei, Emma Obiajulu; Ashioba, Nwanze Chukwudi; Okpor, Margareth Dumebi; Geteloma, Victor Ochuko
Journal of Computing Theories and Applications Vol. 1 No. 4 (2024): JCTA 1(4) 2024
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.10323

Abstract

Fraudsters increasingly exploit unauthorized credit card information for financial gain, targeting un-suspecting users, especially as financial institutions expand their services to semi-urban and rural areas. This, in turn, has continued to ripple across society, causing huge financial losses and lowering user trust implications for all cardholders. Thus, banks cum financial institutions are today poised to implement fraud detection schemes. Five algorithms were trained with and without the application of the Synthetic Minority Over-sampling Technique (SMOTE) to assess their performance. These algorithms included Random Forest (RF), K-Nearest Neighbors (KNN), Naïve Bayes (NB), Support Vector Machines (SVM), and Logistic Regression (LR). The methodology was implemented and tested through an API using Flask and Streamlit in Python. Before applying SMOTE, the RF classifier outperformed the others with an accuracy of 0.9802, while the accuracies for LR, KNN, NB, and SVM were 0.9219, 0.9435, 0.9508, and 0.9008, respectively. Conversely, after the application of SMOTE, RF achieved a prediction accuracy of 0.9919, whereas LR, KNN, NB, and SVM attained accuracies of 0.9805, 0.9210, 0.9125, and 0.8145, respectively. These results highlight the effectiveness of combining RF with SMOTE to enhance prediction accuracy in credit card fraud detection.
Effects of Data Resampling on Predicting Customer Churn via a Comparative Tree-based Random Forest and XGBoost Ako, Rita Erhovwo; Aghware, Fidelis Obukohwo; Okpor, Margaret Dumebi; Akazue, Maureen Ifeanyi; Yoro, Rume Elizabeth; Ojugo, Arnold Adimabua; Setiadi, De Rosal Ignatius Moses; Odiakaose, Chris Chukwufunaya; Abere, Reuben Akporube; Emordi, Frances Uche; Geteloma, Victor Ochuko; Ejeh, Patrick Ogholuwarami
Journal of Computing Theories and Applications Vol. 2 No. 1 (2024): JCTA 2(1) 2024
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.10562

Abstract

Customer attrition has become the focus of many businesses today – since the online market space has continued to proffer customers, various choices and alternatives to goods, services, and products for their monies. Businesses must seek to improve value, meet customers' teething demands/needs, enhance their strategies toward customer retention, and better monetize. The study compares the effects of data resampling schemes on predicting customer churn for both Random Forest (RF) and XGBoost ensembles. Data resampling schemes used include: (a) default mode, (b) random-under-sampling RUS, (c) synthetic minority oversampling technique (SMOTE), and (d) SMOTE-edited nearest neighbor (SMOTEEN). Both tree-based ensembles were constructed and trained to assess how well they performed with the chi-square feature selection mode. The result shows that RF achieved F1 0.9898, Accuracy 0.9973, Precision 0.9457, and Recall 0.9698 for the default, RUS, SMOTE, and SMOTEEN resampling, respectively. Xgboost outperformed Random Forest with F1 0.9945, Accuracy 0.9984, Precision 0.9616, and Recall 0.9890 for the default, RUS, SMOTE, and SMOTEEN, respectively. Studies support that the use of SMOTEEN resampling outperforms other schemes; while, it attributed XGBoost enhanced performance to hyper-parameter tuning of its decision trees. Retention strategies of recency-frequency-monetization were used and have been found to curb churn and improve monetization policies that will place business managers ahead of the curve of churning by customers.
Investigating a SMOTE-Tomek Boosted Stacked Learning Scheme for Phishing Website Detection: A Pilot Study Ugbotu, Eferhire Valentine; Emordi, Frances Uchechukwu; Ugboh, Emeke; Anazia, Kizito Eluemunor; Odiakaose, Christopher Chukwufunaya; Onoma, Paul Avwerosuoghene; Idama, Rebecca Okeoghene; Ojugo, Arnold Adimabua; Geteloma, Victor Ochuko; Oweimieotu, Amanda Enaodona; Aghaunor, Tabitha Chukwudi; Binitie, Amaka Patience; Odoh, Anne; Onochie, Chris Chukwudi; Ezzeh, Peace Oguguo; Eboka, Andrew Okonji; Agboi, Joy; Ejeh, Patrick Ogholuwarami
Journal of Computing Theories and Applications Vol. 3 No. 2 (2025): in progress
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.14472

Abstract

The daily exchange of informatics over the Internet has both eased the widespread proliferation of resources to ease accessibility, availability and interoperability of accompanying devices. In addition, the recent widespread proliferation of smartphones alongside other computing devices has continued to advance features such as miniaturization, portability, data access ease, mobility, and other merits. It has also birthed adversarial attacks targeted at network infrastructures and aimed at exploiting interconnected cum shared resources. These exploits seek to compromise an unsuspecting user device cum unit. Increased susceptibility and success rate of these attacks have been traced to user's personality traits and behaviours, which renders them repeatedly vulnerable to such exploits especially those rippled across spoofed websites as malicious contents. Our study posits a stacked, transfer learning approach that seeks to classify malicious contents as explored by adversaries over a spoofed, phishing websites. Our stacked approach explores 3-base classifiers namely Cultural Genetic Algorithm, Random Forest, and Korhonen Modular Neural Network – whose output is utilized as input for XGBoost meta-learner. A major challenge with learning scheme(s) is the flexibility with the selection of appropriate features for estimation, and the imbalanced nature of the explored dataset for which the target class often lags behind. Our study resolved dataset imbalance challenge using the SMOTE-Tomek mode; while, the selected predictors was resolved using the relief rank feature selection. Results shows that our hybrid yields F1 0.995, Accuracy 0.997, Recall 0.998, Precision 1.000, AUC-ROC 0.997, and Specificity 1.000 – to accurately classify all 2,764 cases of its held-out test dataset. Results affirm that it outperformed bench-mark ensembles. Result shows the proposed model explored UCI Phishing Website dataset, and effectively classified phishing (cues and lures) contents on websites.