Claim Missing Document
Check
Articles

Found 2 Documents
Search

WEKA-based machine learning for traffic congestion prediction in Amman City Arabiat, Areen; Hassan, Mohammad; Almomani, Omar
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 13, No 4: December 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v13.i4.pp4422-4434

Abstract

Traffic congestion leads to wasted time, pollution, and increased fuel consumption. Traffic congestion prediction has become a developing research topic in recent years, particularly in the field of machine learning (ML). The evaluation of various traffic parameters is used to predict traffic congestion by relying on historical data. In this study, we will predict traffic congestion in Amman City, specifically at the 8th circle, using different ML classifiers. The 8th circle links four main streets: Westbound, Northbound, Eastbound, and Southbound. Datasets were collected from the greater Amman municipality hourly. The logistic regression (LR), k-nearest neighbor (KNN), decision tree (DT), random forest (RF), support vector machine (SVM), and multi-layer perceptron (MLP) classifiers have been chosen to predict traffic congestion at each street linked with the 8th circle. The waikato environment for knowledge analysis (WEKA) data mining tool is used to evaluate chosen classifiers by determining accuracy, F-measure, sensitivity, and precision evaluation metrics. The results obtained from all experiments have demonstrated that SVM is the best classifier to predict traffic congestion. The accuracy of SVM to predict traffic congestion at Westbound Street, Northbound Street, Eastbound Street, and Southbound Street was 99.4%, 99.7%, 99.6%, and 99.1%, respectively.
ARP Spoofing Attack Detection Model in IoT Network using Machine Learning: Complexity vs. Accuracy Alsaaidah, Adeeb; Almomani, Omar; Abu-Shareha, Ahmad Adel; Abualhaj, Mosleh M; Achuthan, Anusha
Journal of Applied Data Sciences Vol 5, No 4: DECEMBER 2024
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v5i4.374

Abstract

Spoofing attacks targeting the address resolution protocol, or the so-called ARP, are common cyber-attacks in IoT environments. In such an attack, the attacker sends a fake message over a local area network to spoof the users and interfere with the communication transferred from and into these users. As such, to detect such attacks, there is a need to check the network gateways and routers continuously to capture and analyze the transmitted traffic. However, there are three major problems with such traffic data: 1) there are substantial irrelevant data to the ARP attacks, 2) there are massive patterns in the way by which the spoof can be implemented, and 3) there is a need for fast processing of such data to reduce any delay resulting from the processing stage. Accordingly, this paper proposes a detection approach using supervised machine learning algorithms. The focus of this paper is to show the tradeoff between speed and accuracy to offer various solutions based on the demanded quality. Various algorithms were tested to find a solution that balanced time requirements and accuracy. As such, the results using all features and with various feature selection techniques were reported. Besides, the results using simple classifiers and ensemble learning algorithms were also reported. The proposed approach is evaluated on an IoT network intrusion dataset (IoTID20) collected from different IoT devices. The results showed that the highest accuracy is obtained using the RF classifier with a subset of features produced by the wrapper technique. In such a case, the accuracy obtained was 99.74%, with running time equal to 305 milliseconds. However, If time is more critical for a given application, then DT can be used with the whole feature set. In such a case, the accuracy was 99.41%, with running time equal to 11  milliseconds.