Performance Evaluation Of Algorithms Research Articles

Comprehensive Performance Evaluation of Machine Learning Algorithms for detecting DDoS attacks in SDN

<div align="center">Software-Defined Networking (SDN) revolutionizes networking by separating control logic and data forwarding, enhancing security against threats like Distributed Denial of Service (DDoS) attacks. These attacks flood control plane bandwidth, causing SDN network failures. Recent studies emphasize the efficacy of machine learning and statistical approaches in identifying and mitigating these security risks. However, there has been a lack of focus on employing ensembling techniques, amalgamating diverse machine learning models, selecting pertinent features, and utilizing oversampling techniques to balance categorical data. Our study evaluates 20 machine-learning models, emphasizing feature engineering and addressing class imbalance using Synthetic Minority Oversampling TEchnique (SMOTE). The results indicate that Ensemble methods such as LGBM Classifier, Random Forest Classifier, XGB Classifier, Decision Tree Classifier attained near-perfect scores (almost 100%) across all metrics, suggesting potential overfitting. Conversely, models like AdaBoost Classifier, K-Neighbors Classifier, and SVC exhibited slightly lower (99%) but realistic performance, underscoring the intricacy of accurate prediction in cybersecurity. Simpler models, including Logistic Regression, Linear Discriminant Analysis, and Gaussian Naive Bayes, demonstrated moderate to low accuracy, approximately around 70%. These findings stress the imperative need for a nuanced approach in the selection and fine-tuning of machine learning models to ensure effective DDoS detection in SDN environments.</div>

Comparison of the performance of classical and quantum machine‐learning methods on the detection of sugar beet Cercospora leaf disease

AbstractImage processing and machine‐learning (ML) techniques are essential for the detection of diseases and pests in plants. This study explored the application of quantum ML (QML) algorithms for the early detection of Cercospora beticola leaf disease in sugar beet, which causes significant impact on global sugar production. Using a dataset of 1065 images (739 diseased and 326 healthy), we extracted 70 ML statistical features, including 10 from the grey‐level co‐occurrence matrix (GLCM) and 60 colour‐related features. Performance evaluations of classical ML algorithms, such as random forest (RF; 91.95% accuracy) and extreme gradient boosting (91.95% accuracy), demonstrated strong results compared to quantum approaches. Notably, the quantum support vector classifier (QSVC) achieved an accuracy of 85% with perfect recall of 1.00, while the variational quantum classifier (VQC) recorded an accuracy of 88.73%. Dimensionality reduction via principal component analysis reduced features from 70 to 5, enabling effective classification with competitive results: ML (RF) 91.41%, VQC with limited‐memory Broyden–Fletcher–Goldfarb–Shanno with box constraints (L_BFGS_B) 88.73% and QSVC 85%. These findings highlight the potential of QML algorithms in improving agricultural disease identification and aiding in the advancement of more efficient, sustainable farming techniques.

Inconsistency among evaluation metrics in link prediction

Abstract Link prediction is a paradigmatic and challenging problem in network science, which aims to predict missing links, future links and temporal links based on known topology. Along with the increasing number of link prediction algorithms, a critical yet previously ignored risk is that the evaluation metrics for algorithm performance are usually chosen at will. This paper implements extensive experiments on hundreds of real networks and 26 well-known algorithms, revealing significant inconsistency among evaluation metrics, namely different metrics probably produce remarkably different rankings of algorithms. Therefore, we conclude that any single metric cannot comprehensively or credibly evaluate algorithm performance. In terms of information content, we suggest the usage of at least two metrics: one is the area under the receiver operating characteristic curve (AUC), and the other is one of the following three candidates, say the area under the precision-recall curve (AUPR), the area under the precision curve (AUC-Precision), and the normalized discounted cumulative gain (NDCG). When the data is imbalanced, say the number of negative samples significantly outweighs the number of positive samples, the area under the generalized ROC curve (AUC-gROC) should also be used. In addition, as we have proved the essential equivalence of threshold-dependent metrics, if in a link prediction task, some specific thresholds are meaningful, we can consider any one threshold-dependent metric with those thresholds. This work completes a missing part in the landscape of link prediction, and provides a starting point toward a well-accepted criterion or standard to select proper evaluation metrics for link prediction.

Development and performance evaluation of an indoor thermal environment control algorithm incorporating MET estimation model with object detection

As people increasingly spend time indoors, the significance of the indoor environment in influencing occupant quality of life is becoming more pronounced. Traditionally, indoor environment control primarily relied on fixed temperature settings, which failed to accommodate the diverse circumstances of occupants. This approach limited the creation of a comfortable indoor environment and the enhancement of energy efficiency. Consequently, there is growing interest in occupant-centric control (OCC), which integrates metabolic rate (MET) information, which is a critical factor in determining the thermal sensation of occupants. Previously, a method was developed to estimate MET by classifying occupant poses and detecting the objects they interact with from indoor images. This study aims to develop and experimentally validate an indoor thermal environment control algorithm (ITEC-algorithm) using the MET estimation model and assess its effectiveness and applicability in real building environments.The performance evaluation revealed that the ITEC-algorithm significantly enhanced the comfort ratios, achieving improvements of up to 59% compared to the fixed temperature control and 28% compared to the control methods that only used the pose classification model for MET estimation. The energy consumption varied depending on the activity and control method, with a reduction of up to 88% compared to fixed temperature control. These results indicate that thermal comfort can be enhanced while minimizing unnecessary energy consumption by incorporating the MET of the occupants. Consequently, it has been confirmed that the ITEC-algorithm effectively improves thermal comfort by managing the MET of various occupants.

A Mountain Gazelle Optimization (MGO) for Enhancing the Deep Learning Performance in Various Operating Systems

This study introduces a novel optimization framework that assesses and enhances deep learning algorithm performance across autonomous car operating systems. The framework generates synthetic performance measures, including inference time, memory use, CPU/GPU utilization, and accuracy, to evaluate algorithm performance. By employing the Mountain Gazelle Optimizer (MGO), the study identifies the best deep learning algorithm and operating system setup for accuracy and resource efficiency. The proposed methodology normalizes performance indicators, defines a fitness function to assist optimization, and then iterates through numerous configurations to discover the optimum option. Extensive trials and scenario comparisons validate the effectiveness of our approach. Computational efficiency and accuracy improved significantly, revealing the ideal autonomous car system performance combinations. This study not only enhances deep learning optimization but also provides practical instructions for building robust autonomous car systems in varied operating contexts, thereby informing the development of future autonomous vehicles and offering actionable insights for developers and researchers in the field.

Using Online Algorithms to Solve NP-Hard Problems

This paper explores the application of online algorithms to tackle NP-hard problems, a class of computational challenges characterized by their intractability and wide-ranging real-world implications. Unlike traditional offline algorithms that have access to complete input data, online algorithms make decisions sequentially, often under constraints of incomplete information. We investigate various strategies, including greedy approaches, randomization, and competitive analysis, to assess their effectiveness in solving NP-hard problems such as the Traveling Salesman Problem, the Knapsack Problem, and the Set Cover Problem. Our analysis highlights the trade-offs between solution quality and computational efficiency, emphasizing the significance of the competitive ratio in evaluating algorithm performance. Additionally, we discuss the practical applications of online algorithms in dynamic environments, such as real-time systems and streaming data processing. Through a comprehensive review of existing literature and novel algorithmic designs, we aim to provide insights into the viability of online algorithms as a robust framework for addressing NP-hard problems in scenarios where immediate decision-making is crucial. The findings underscore the potential for future research to enhance these algorithms, making them increasingly applicable in complex, real-world contexts.

Performance evaluation of machine learning algorithms in predicting machining responses of superalloys

This study explores the application of machine learning algorithms—gene expression programming (GEP), adaptive neuro-fuzzy inference system (ANFIS), and artificial neural networks (ANN)—to predict machining responses during the milling of Inconel 690, a superalloy known for its exceptional mechanical properties and oxidation resistance. Machining Inconel 690 presents significant challenges due to its toughness and work-hardening tendencies, which can lead to rapid tool wear and poor surface finish. Traditional optimization methods often rely on empirical models and trial-and-error approaches, which are time-consuming and costly. In contrast, machine learning techniques can effectively model complex, nonlinear relationships between machining parameters and performance outcomes, such as surface roughness, cutting force, and cutting temperature. This study employs statistical metrics, including Root mean square error (RMSE), coefficient of determination (R2), and mean absolute percentage error (MAPE), to determine the predictive performance of the models. The results show that the GEP model achieved an R2 ranging from 0.944 572 to 0.992 999, with an RMSE between 0.015 527% and 0.694 523% and a MAPE ranging from 1.452 397% to 4.947 892%. ANFIS and ANN also demonstrated strong predictive capabilities, although GEP outperformed them. The importance of this study lies in its demonstration of advanced AI techniques as effective tools for optimizing machining processes, ultimately contributing to improved efficiency and quality in manufacturing superalloys.

Performance Evaluation of Machine Learning Algorithms in Estimating Taxi Times at Istanbul Airport

Performance Evaluation of Machine Learning Algorithms in Estimating Taxi Times at Istanbul Airport

Advancements in Optimization: Critical Analysis of Evolutionary, Swarm, and Behavior-Based Algorithms

The research work on optimization has witnessed significant growth in the past few years, particularly within multi- and single-objective optimization algorithm areas. This study provides a comprehensive overview and critical evaluation of a wide range of optimization algorithms from conventional methods to innovative metaheuristic techniques. The methods used for analysis include bibliometric analysis, keyword analysis, and content analysis, focusing on studies from the period 2000–2023. Databases such as IEEE Xplore, SpringerLink, and ScienceDirect were extensively utilized. Our analysis reveals that while traditional algorithms like evolutionary optimization (EO) and particle swarm optimization (PSO) remain popular, newer methods like the fitness-dependent optimizer (FDO) and learner performance-based behavior (LPBB) are gaining attraction due to their adaptability and efficiency. The main conclusion emphasizes the importance of algorithmic diversity, benchmarking standards, and performance evaluation metrics, highlighting future research paths including the exploration of hybrid algorithms, use of domain-specific knowledge, and addressing scalability issues in multi-objective optimization.

A novel algorithm combined X-ray fluorescence and Neural Network (XRF-NN) for coal ash content prediction: Algorithm design and performance evaluation

This paper investigated a precise algorithm combining X-ray Fluorescence and Neural Network (XRF-NN) for predicting ash content. The 261 sets of XRF tests show that the 34 elements in the chosen Guqiao coal can be categorized as major, secondary and tiny elements, whose cumulative ratio were ~95%, 4-5% and <1%, respectively. Referring to the machine learning theory, the construction strategy of Element-Ash dataset was determined viz. value determination → standardization → division → optimization of generalization ability. Then, the hyperparameters optimization displays that XRF-NN model with 34 inputs and 1 output was suitable to predict coal ash content, where the activation function, loss function, and optimizer were ReLU, MAE, and Momentum, respectively. After iterative training, the new XRF-NN model provides the precise prediction of coal ash content with the absolute errors between -2.0% and 2%. Moreover, the prediction accuracy rose from 57.69% to 100%, as the expected relative error increased from 1% to 5%. Furthermore, the comparisons between different prediction methods reveal that the minimum MRE of 1.22% can be obtained by XRF-NN with total elements, which was only half of those given by the conventional Multiple Linear Regression and Partial Least Squares Regression. Besides, XRF-NN model presents the root mean squared error 0.797%, the mean absolute error 0.625% and the coefficient of determination 0.999, which were significantly superior to those calculated by Dual-Energy Gamma-ray Transmission, Ploy, RFR, XGBoost and DNN model. The results of this study suggest the excellent performance of the new XRF-NN model in predicting ash content.

Performance Evaluation of Machine Learning Algorithms for Iris Dataset Classification

The problem of classifying iris flowers is a well-known issue in the fields of machine learning and pattern recognition. The Iris dataset is widely recognized as a standard for evaluating the effectiveness of classification algorithms in machine learning. This paper offers a comparative assessment of different machine learning algorithms when applied to the Iris dataset. We implement and assess the performance of k-Nearest Neighbors, Logistic Regression, Decision Tree, Linear SVC methods, Random Forest, Gaussian Naïve Bayes and AdaBoost algorithms based on their accuracy in classification. We examine diverse classification methods, appraise their effectiveness, and discuss our findings. The outcomes reveal the accuracy of these models in correctly categorizing the Iris species. To achieve high accuracy, k-Nearest Neighbors, Logistic Regression, Linear SVC methods,Decision Tree,, Random Forest and AdaBoost classifiers are utilised.

Performance evaluation of symbol detection algorithms in massive MIMO communication systems

Abstract Massive MIMO (mMIMO) is the essential technique for attaining the exponential increase in the data rate needed for future communication systems. These advancements have been significantly supported by progress in VLSI technology, which enables the integration of an enormous number of antennas and the complex signal processing essential for massive MIMO systems on a single chip. This work conducts a comprehensive analysis of the intricacy of seven matrix decomposition techniques for symbol detection in future mMIMO communication systems: ADMM-based infinity norm (ADMIN), Neumann series (NS), Newton iteration (NI), Jacobi iteration (Ja), improved Gauss-Seidel (IGS), conjugate gradient (CG), and QR decomposition (QR), against linear and near-optimal minimum mean square error (MMSE). QR, GS, Ja, and CG belong to linear algebraic methods based on matrix decomposition. MMSE and ADMIN are nonlinear optimization methods; NS and NI are iterative methods. The analysis examines into the complexity of these detection algorithms, considering the symbol error rate, the convergence rate, the initial solution vector, and the correlation factor. Performance evaluations are conducted on 8 and 16-user mMIMO systems with 64 and 128 base station antennas, modulation schemes (32-QAM and 64-QAM), iteration counts (p = 1, 2, 3, 4), correlation factors (α = 0.2, 0.4, and 0.6), and initial solution vectors (zero vector, D −1 and W 2 −1 yMF ). The result clearly shows that if the initial solution and number of iterations are chosen properly, the IGS-based linear detector achieves near-optimal performance with a lower computational complexity of O(K 2) compared to the nonlinear MMSE-based detector with a computational complexity of O(K 3).

Performance Evaluation of Machine Learning Algorithms in Reduced Dimensional Spaces

Performance Evaluation of Machine Learning Algorithms in Reduced Dimensional Spaces

A review of the development of YOLO object detection algorithm

The You Only Look Once (YOLO) algorithm series, as the forefront of object detection technology, has evolved from YOLOv1 to YOLOv10, consistently enhancing detection speed and accuracy. Through literature review and data analysis. This paper mainly discusses the development processes of the YOLO algorithm series, focuses on the changes and innovations in network structure, training strategies, and performance optimization. By introducing techniques, such as CSPNet, Anchor-free, data augmentation, and multi-scale training, the YOLO algorithm has progressively found a better balance between detection speed and accuracy, demonstrating excellent performance in processing real-time images and handling high-complexity scenarios. Furthermore, this paper also addresses some challenges faced by the YOLO algorithms and potential future research directions, such as the lower accuracy in detecting small targets and reduced robustness in complex scenarios. Through analysis, potential optimization directions for the future include further refining network structure and employing more efficient training methods to enhance algorithm efficiency. This paper intends to offer a thorough performance evaluation of the YOLO series algorithms, identify potential areas for future improvements to advance YOLO technology.

Early classification and recognition algorithm for sudden cardiac arrest based on limited electrocardiogram data trained with a two-stages convolutional neural network

Sudden cardiac arrest (SCA) is a lethal cardiac arrhythmia that poses a serious threat to human life and health. However, clinical records of sudden cardiac death (SCD) electrocardiogram (ECG) data are extremely limited. This paper proposes an early prediction and classification algorithm for SCA based on deep transfer learning. With limited ECG data, it extracts heart rate variability features before the onset of SCA and utilizes a lightweight convolutional neural network model for pre-training and fine-tuning in two stages of deep transfer learning. This achieves early classification, recognition and prediction of high-risk ECG signals for SCA by neural network models. Based on 16 788 30-second heart rate feature segments from 20 SCA patients and 18 sinus rhythm patients in the international publicly available ECG database, the algorithm performance evaluation through ten-fold cross-validation shows that the average accuracy (Acc), sensitivity (Sen), and specificity (Spe) for predicting the onset of SCA in the 30 minutes prior to the event are 91.79%, 87.00%, and 96.63%, respectively. The average estimation accuracy for different patients reaches 96.58%. Compared to traditional machine learning algorithms reported in existing literatures, the method proposed in this paper helps address the requirement of large training datasets for deep learning models and enables early and accurate detection and identification of high-risk ECG signs before the onset of SCA.

Performance and energy evaluation of dynamic adaptive deterministic routing algorithm for multicore architectures

Chip Multiprocessors (CMPs) leverage multiple processing units to improve computational speed and efficiency. Routing algorithms in NoC (Network-on-Chip) architectures ensure efficient data communication between these units, addressing challenges such as congestion, latency, and power consumption. This paper delves into an extensive analysis of the performance evaluation concerning the Dynamic Adaptive Deterministic (DyAD) routing for Network-on-Chip (NoC) and Wireless Network-on-Chip (WiNoC) configurations within the framework of a 64-core and 100-core multicore architecture. The evaluation involved a congestion threshold analysis of data transmission latency, the efficiency of network data throughput, and the amount of energy consumed. To substantiate our conclusions, we conducted simulations of the 64-core and 100-core mesh-based NoC and WiNoC architectures under the Video Image Processing System (VIPS) benchmark workload. These simulations were executed utilizing the Noxim simulator, a well-recognized tool acclaimed for its capacity to provide cycle-accurate simulations. Analyzing the simulation outcomes, it becomes evident that the DyAD routing approach for the 64-core and 100-core WiNoC architecture performs better in terms of network performance. It is characterized by enhanced capabilities at higher Packet Injection Rate (PIR) saturation loads, improved network throughput, and minimized latencies. This dominance is evident from its ability to handle heavier workloads and achieve lower delays in the investigated VIPS workload situations, compared to the 64-core and 100-core NoC multicore architecture.

Classification of Firewall Log Files with Different Algorithms and Performance Analysis of These Algorithms

Classifying firewall log files allows analysing potential threats and deciding on appropriate rules to prevent them. Therefore, in this study, firewall log files are classified using different classification algorithms and the performance of the algorithms are evaluated using performance metrics. The dataset was prepared using the log files of a firewall. It was filtered to make it free from any personal data and consisted of 12 attributes in total and from these attributes the action attribute was selected as the class. In the performance evaluation, Simple Cart and NB tree algorithms made the best predictions, achieving an accuracy rate of 99.84%. Decision Stump had the worst prediction performance, achieving an accuracy rate of 79.68%. As the total number of instances belonging to each of the classes in the dataset was not equal, the Matthews correlation coefficient was also used as a performance metric in the evaluations. The Simple Cart, BF tree, FT tree, J48 and NB Tree algorithms achieved the highest average values. However, although the reset-both class was not predicted successfully by the others, the Simple Cart algorithm made the best predictions for it. The values of other performance metrics used in this study also support this conclusion. Therefore, the Simple Cart algorithm is recommended for use in classifying firewall log files. However, there is a need to develop a prefiltering and parsing approach to process different log files as each firewall brand creates and maintains log files in its own format. Therefore, in this study, a novel prefiltering and parsing approach has been proposed to process log files with different structures and create structured datasets using them.

Construction of Risk Prediction Models for Enterprise Finance Sharing Operations Using K-Means and C4.5 Algorithms

The evaluation of financial sharing centres in enterprises typically relies on outdated financial data, lacks comprehensive assessment, and presents risks such as employee misconduct. To address these challenges, we propose a risk prediction model for enterprise financial sharing operations based on the K-means clustering algorithm for performance evaluation and the C4.5 algorithm for managing employee risks. Our approach enhances the accuracy and objectivity of performance evaluation while improving the efficiency of personnel risk management. Results indicate that the K-means algorithm classifies employee performance into five levels, facilitating comprehensive performance evaluation. Furthermore, through risk management optimisation, accuracy and recall rates increase to 0.905 and 0.890, respectively. The proposed risk prediction model achieves high accuracy rates of 90.5% and 92.4% in the training and test sets, respectively. Practical application of our methodology and model in A Group's financial sharing centre demonstrates their effectiveness and potential for enhancing the operation and management of enterprise financial sharing centres.

Scalable and Distributed Mathematical Modeling Algorithm Design and Performance Evaluation in Heterogeneous Computing Clusters

Scalable and Distributed Mathematical Modeling Algorithm Design and Performance Evaluation in Heterogeneous Computing Clusters

Performance Evaluation of Machine Learning Algorithms in Smart Agriculture

Performance Evaluation of Machine Learning Algorithms in Smart Agriculture