Performance Of Algorithm Research Articles

Towards greener futures: SVR-based CO2 prediction model boosted by SCMSSA algorithm

This research presents the utilization of an enhanced Sine cosine perturbation with Chaotic perturbation and Mirror imaging strategy-based Salp Swarm Algorithm (SCMSSA), which incorporates three improvement mechanisms, to enhance the convergence accuracy and speed of the optimization algorithm. The study assesses the SCMSSA algorithm's performance against other optimization algorithms using six test functions to show the efficacy of the enhancement strategies. Furthermore, its efficacy in improving Support Vector Regression (SVR) models for CO2 prediction is assessed. The results reveal that the SVR-SCMSSA hybrid model surpasses other hybrid models and standard SVR in terms of training and prediction accuracy by obtaining 95 % accuracy. Its swift convergence, precision, and resistance to local optima position make it an excellent choice for addressing complex problems such as CO2 prediction, with critical implications for sustainability efforts. Moreover, feature importance analysis by SVR-SCMSSA offers valuable insights into the key contributors to CO2 prediction in the dataset, emphasizing the significance and impact of factors such as fossil fuel, Biomass, and Wood as major contributors to CO2 emission. The research suggests the adoption of the SVR-SCMSSA hybrid model for more accurate and reliable CO2 prediction to researchers and policymakers, which is essential for environmental sustainability and climate change mitigation.

Ultra-short time-echo based ray tracing for transcranial focused ultrasound aberration correction in human calvaria.

Magnetic resonance guided transcranial focused ultrasound holds great promises for treating neurological disorders. This technique relies on skull aberration correction which requires computed tomography (CT) scans of the skull of the patients. Recently, ultra-short time-echo (UTE) magnetic resonance (MR) sequences have unleashed the MRI potential to reveal internal bone structures. In this study, we measure the efficacy of transcranial aberration correction using UTE images.
Approach. We compare the efficacy of transcranial aberration correction using UTE scans to CT based correction on four skulls and two targets using a clinical device (Exablate Neuro, Insightec, Israel). We also evaluate the performance of a custom ray tracing algorithm using both UTE and CT estimates of acoustic properties and compare these against the performance of the manufacturer's proprietary aberration correction software. 
Main results. UTE estimated skull maps in Hounsfield units (HU) had a mean absolute error of 242 ± 20 HU (n=4). The UTE skull maps were sufficiently accurate to improve pressure at the target (no correction: 0.44 ± 0.10, UTE correction: 0.79 ± 0.05, manufacturer CT: 0.80 ± 0.05), pressure confinement ratios (no correction: 0.45 ± 0.10, UTE correction: 0.80 ± 0.05, manufacturer CT: 0.81 ± 0.05), and targeting error (no correction: 1.06 ± 0.42 mm, UTE correction 0.30 ± 0.23 mm, manufacturer CT: 0.32 ± 0.22) (n=8 for all values). When using CT, our ray tracing algorithm performed slightly better than UTE based correction with pressure at the target (UTE: 0.79 ± 0.05, CT: 0.84 ± 0.04), pressure confinement ratios (UTE: 0.80 ± 0.05, CT: 0.84 ± 0.04), and targeting error (UTE: 0.30 ± 0.23 mm, CT: 0.17 ± 0.15). 
Significance. These 3D transcranial measurements suggest that UTE sequences could replace CT scans in the case of MR guided focused ultrasound with minimal reduction in performance which will avoid ionizing radiation exposure to the patients and reduce procedure time and cost.&#xD.

An object detection method for catenary component images based on improved Faster R-CNN

Catenary components are an important part of electrified railways. Especially for catenary support devices, there are various types of components with significant differences in scale. According to statistical data, there is a high risk of failure for the catenary support device components during the operation of the catenary system. Therefore, in order to ensure the safe operation of the railways, it is critical to accurately locate and recognize the components in the catenary images. In this paper, we propose an improved method based on faster region-based convolutional neural networks (Faster R-CNN) framework to realize the detection and extraction of the components on the catenary support devices. Firstly, the anchor box parameters are reset using the K-means clustering method, which greatly improves the localization precision of the predicted box. Secondly, scaled exponential linear units activation function is introduced to improve the algorithm performance. Moreover, ResNet-34, the backbone of Faster R-CNN, is optimized. We design a transition structure for multi-scale filter combination convolution to avoid missing feature information and eliminate some redundant convolution structures. This modification substantially enhances the capability of the model to recognize a wide variety of component types. Finally, we conduct some control experiments comparing with single shot multibox detector and you only look once (YOLO) series (YOLOv3, YOLOv5 and YOLOv7) models. They are faster but less accurate, especially for small objects. The results show that the proposed method has better detection performance, achieving a mean average precision of 96.50% and running at 17.79 frames per second. In addition, our model has the highest average recall of 69.27%, which is 2.66% higher than the original model.

Performance Evaluation of Parallel Graphs Algorithms Utilizing Graphcore IPU

Recent years have been characterized by increasing interest in graph computations. This trend can be related to the large number of potential application areas. Moreover, increasing computational capabilities of modern computers allowed turning theory of graph algorithms into explorations of best methods for their actual realization. These factors, in turn, brought about ideas like creation of a hardware component dedicated to graph computation; i.e., the Graphcore Intelligent Processor Unit (IPU). Interestingly, Graphcore systems are a hardware implementation of the Bulk Synchronous Parallel paradigm, which seemed to be a mostly theoretical concept from the end of last century. In this context, the question that has to be addressed experimentally is as follows: how good are Graphcore systems in comparison with standard systems that can be used to run graph algorithms, i.e., CPUs and GPUs. To provide a partial response to this broad question, in this contribution, PageRank, Single Source Shortest Path and Breadth-First Search algorithms are used to compare the performance of IPU-deployed algorithms to other parallel architectures. Obtained results clearly show that the Graphcore IPU outperforms other devices for the studied heterogeneous algorithms and, currently, provides best-in-class execution time results for a range of graph sizes and densities.

Virtual Position Guided Strategy for Particle Swarm Optimization Algorithms on Multimodal Problems.

Premature convergence is a thorny problem for particle swarm optimization (PSO) algorithms, especially on multimodal problems, where maintaining swarm diversity is crucial. However, most enhancement strategies for PSO, including the existing diversity-guided strategies, have not fully addressed this issue. This paper proposes the virtual position guided (VPG) strategy for PSO algorithms. The VPG strategy calculates diversity values for two different populations and establishes a diversity baseline. It then dynamically guides the algorithm to conduct different search behaviors, through three phases - divergence, normal, and acceleration - in each iteration, based on the relationships among these diversity values and the baseline. Collectively, these phases orchestrate different schemes to balance exploration and exploitation, collaboratively steering the algorithm away from local optima and towards enhanced solution quality. The introduction of 'virtual position' caters to the strategy's adaptability across various PSO algorithms, ensuring the generality and effectiveness of the proposed VPG strategy. With a single hyperparameter and a recommended usual setup, VPG is easy to implement. The experimental results demonstrate that the VPG strategy is superior to several canonical and the state-of-the-art strategies for diversity guidance, and is effective in improving the search performance of most PSO algorithms on multimodal problems of various dimensionalities.

Automated segmentation of liver and hepatic vessels on portal venous phase computed tomography images using a deep learning algorithm.

CT-image segmentation for liver and hepatic vessels can facilitate liver surgical planning. However, time-consuming process and inter-observer variations of manual segmentation have limited wider application in clinical practice. Our study aimed to propose an automated deep learning (DL) segmentation algorithm for liver and hepatic vessels on portal venous phase CT images. This retrospective study was performed to develop a coarse-to-fine DL-based algorithm that was trained, validated, and tested using private 413, 52, and 50 portal venous phase CT images, respectively. Additionally, the performance of the DL algorithm was extensively evaluated and compared with manual segmentation using an independent clinical dataset of preoperative contrast-enhanced CT images from 44 patients with hepatic focal lesions. The accuracy of DL-based segmentation was quantitatively evaluated using the Dice Similarity Coefficient (DSC) and complementary metrics [Normalized Surface Dice (NSD) and Hausdorff distance_95 (HD95) for liver segmentation, Recall and Precision for hepatic vessel segmentation]. The processing time for DL and manual segmentation was also compared. Our DL algorithm achieved accurate liver segmentation with DSC of 0.98, NSD of 0.92, and HD95 of 1.52mm. DL-segmentation of hepatic veins, portal veins, and inferior vena cava attained DSC of 0.86, 0.89, and 0.94, respectively. Compared with the manual approach, the DL algorithm significantly outperformed with better segmentation results for both liver and hepatic vessels, with higher accuracy of liver and hepatic vessel segmentation (all p<0.001) in independent 44 clinical data. In addition, the DL method significantly reduced the manual processing time of clinical postprocessing (p<0.001). The proposed DL algorithm potentially enabled accurate and rapid segmentation for liver and hepatic vessels using portal venous phase contrast CT images.

OptiComm-GPT: a GPT-based versatile research assistant for optical fiber communication systems

With the increasing capacity and complexity of optical fiber communication systems, both academic and industrial requirements for the essential tasks of transmission systems simulation, digital signal processing (DSP) algorithms verification, system performance evaluation, and quality of transmission (QoT) optimization are becoming significantly important. However, due to the intricate and nonlinear nature of optical fiber communication systems, these tasks are generally implemented in a divide-and-conquer manner, which necessitates a profound level of expertise and proficiency in software programming from researchers or engineers. To lower this threshold and facilitate professional research easy-to-start, a GPT-based versatile research assistant named OptiComm-GPT is proposed for optical fiber communication systems, which flexibly and automatically performs system simulation, DSP algorithms verification, performance evaluation, and QoT optimization with only natural language. To enhance OptiComm-GPT’s abilities for complex tasks in optical fiber communications and improve the accuracy of generated results, a domain information base containing rich domain knowledge, tools, and data as well as the comprehensive prompt engineering with well-crafted prompt elements, techniques, and examples is established and performs under a LangChain-based framework. The performance of OptiComm-GPT is evaluated in multiple simulation, verification, evaluation, and optimization tasks, and the generated results show that OptiComm-GPT can effectively comprehend the user’s intent, accurately extract system parameters from the user’s request, and intelligently invoke domain resources to solve these complex tasks simultaneously. Moreover, the statistical results, typical errors, and running time of OptiComm-GPT are also investigated to illustrate its practical reliability, potential limitations, and further improvements.

Constructing and applying a neural-network-based architectural landscape evaluation model

With the continuous improvement of living standards, people go outdoors and spend more and more time in scenic spots. The landscape architecture design that serves people in urban scenic spots attracts more and more public attention, which puts forward higher requirements for landscape architecture design that serves people in scenic spots. How to integrate better the design of all kinds of landscape architecture into nature, to serve the public better, is an urgent problem to be solved at this stage. This paper selects the evaluation indexes of urban architectural landscapes, uses the analytic hierarchy process to determine the weight of each index and quantifies six evaluation indexes to build an evaluation model of architectural landscape design. In terms of the improvement of the you only look once version 4 (YOLOv4) model, MobileNetV3 was selected as the backbone feature extraction network, and the convolution in the feature enhancement extraction network was replaced by the depth-separable volume, and an architectural landscape recognition system based on the improved YOLOv4 model was constructed. In terms of algorithm performance verification, the improved algorithm was compared with the single-shot detector, MobileNetV3, ShuffleNetV2, YOLOv3, YOLOv4 and YOLOv5s algorithms under multiple evaluation indexes. The experimental results show that the size of the model is 51.4 MB, which does not cause a large burden. The mean average precision value of the improved YOLOv4 algorithm is 93.5%, and the frames per second (FPS) value is 30 FPS, which has higher recognition accuracy and detection speed and has obvious advantages.

LEO satellites selection-based computation offloading algorithm in aircraft–satellite multi-access edge computing networks

The emergence of sixth-generation (6G) mobile networks and non-terrestrial networks (NTNs) has led to increased interest in low Earth orbit (LEO) satellite-based communication networks for their potential to provide global coverage and ubiquitous connectivity. In this paper, we investigate the LEO satellites selection-based computation offloading problem in the aircraft–satellite multi-access edge computing (ASMEC) network, where LEO satellites and edge computing processors are integrated to provide ubiquitous and low-latency communication and computation services for aircraft during flights. In contrast to most existing works, which directly assume a fixed number of satellites or orbits in satellite-based MEC networks, we investigate the problem of how many satellites and which satellites to select in the ASMEC network. Our objective is to minimize the average total time delay of tasks during aircraft–satellite computation offloading. To achieve this, we formulate a nonlinear integer programming (NLIP) problem and propose the LEO satellites selection-based computation offloading (LSSBCO) algorithm to solve it, which includes the shortest aircraft–satellite distance based access satellite selection (ASS-SD) algorithm and the nearest k(t) neighboring satellites selection (NSS-k(t)) algorithm. We evaluate the performance of the LSSBCO algorithm in terms of the average total time delay, the maximum throughput, the average aircraft–satellite distance, the average connection duration, and the number of satellite handovers. Numerical results show that the proposed algorithm outperforms the benchmark algorithms with a lower average total time delay.

Evaluating the Performance of Machine Learning Algorithm for Classification of Safer Sexual Negotiation among Married Women in Bangladesh

Evaluating the Performance of Machine Learning Algorithm for Classification of Safer Sexual Negotiation among Married Women in Bangladesh

A Study on Speech Recognition by a Neural Network Based on English Speech Feature Parameters

In this study, from the perspective of English speech feature parameters, two feature parameters, the mel-frequency cepstral coefficient (MFCC) and filter bank (Fbank), were selected to identify English speech. The algorithms used for recognition employed the classical back-propagation neural network (BPNN), recurrent neural network (RNN), and long short-term memory (LSTM) that were obtained by improving RNN. The three recognition algorithms were compared in the experiments, and the effects of the two feature parameters on the performance of the recognition algorithms were also compared. The LSTM model had the best identification performance among the three neural networks under different experimental environments; the neural network model using the MFCC feature parameter outperformed the neural network using the Fbank feature parameter; the LSTM model had the highest correct rate and the highest speed, while the RNN model ranked second, and the BPNN model ranked worst. The results confirm that the application of the LSTM model in combination with MFCC feature parameter extraction to English speech recognition can achieve higher speech recognition accuracy compared to other neural networks.

ANALISIS PEMELIHARAAN PREDIKTIF KENDARAAN OPERASIONAL MENGGUNAKAN ALGORITMA NAÏVE BAYES DAN DECISION TREE

Utilizing the team to carry out operational vehicle maintenance activities is crucial to maintaining smooth mobility. Well-scheduled maintenance can prevent unexpected problems and minimize disruption to vehicle operations. The problem is that the implementation of operational vehicle maintenance policies is not yet optimal. The aim of this research is to focus on operational vehicles so that use is not disrupted and mobility runs smoothly, maintenance scheduling is needed. Completion of this research method will use the Naïve Bayes and Decision Tree data mining applications. This research produces a comparison of the two data mining applications to determine maintenance performance with an accuracy level of the Naïve Bayes method of 33.33% and a Decision Tree at 75.00%. The results of the best algorithm performance analysis are used as a reference for implementing vehicle maintenance scheduling.

Multi-Objective Automatic Clustering Algorithm Based on Evolutionary Multi-Tasking Optimization

Data mining technology is the process of extracting hidden knowledge and potentially useful information from a large number of incomplete, noisy, and random practical application data. The clustering algorithm based on multi-objective evolution has obvious advantages compared with the traditional single-objective method. In order to further improve the performance of evolutionary multi-objective clustering algorithms, this paper proposes a multi-objective automatic clustering model based on evolutionary multi-task optimization. Based on the multi-objective clustering algorithm that automatically determines the value of k, evolutionary multi-task optimization is introduced to deal with multiple clustering tasks simultaneously. A set of non-dominated solutions for clustering results is obtained by concurrently optimizing the overall deviation and connectivity index. Multi-task adjacency coding based on a locus adjacency graph was designed to encode the clustered data. Additionally, an evolutionary operator based on relevance learning was designed to facilitate the evolution of individuals within the population. It also facilitates information transfer between individuals with different tasks, effectively avoiding negative transfer. Finally, the proposed algorithm was applied to both artificial datasets and UCI datasets for testing. It was then compared with traditional clustering algorithms and other multi-objective clustering algorithms. The results verify the advantages of the proposed algorithm in clustering accuracy and algorithm convergence.

An adaptive reference vector guided many-objective optimization algorithm based on the pareto front density estimation

The performance of evolutionary algorithms using reference vectors to guide the evolution process mainly depends on the adaptive reference vector update strategy. In order to solve the challenging many-objective optimization problems with irregular Pareto fronts, this paper proposes an adaptive reference vector update strategy based on the Pareto front density estimation, which estimates the true Pareto front by finding sparse regions while ensuring the uniform distribution of reference vectors. In addition, an improved environmental selection strategy using the angle-based neighborhood density estimation has been proposed for estimating the neighborhood density to effectively guide the population evolution. On this basis, this paper proposes an adaptive reference vector guided many-objective optimization algorithm based on Pareto front density estimation (MaOEA-PDE). Experimental results on a large number of benchmark problems show MaOEA-PDE achieves better performance compared with some state-of-the-art algorithms in the literature.

Partitioning urban forest evapotranspiration based on integrating eddy covariance of water vapor and carbon dioxide fluxes

Partitioning of evapotranspiration (ET) in urban forest lands plays a vital role in mitigating ambient temperature and evaluating the effects of urbanization on the urban hydrological cycle. While ET partitioning has been extensively studied in diverse natural ecosystems, there remains a significant paucity of research on urban ecosystems. The flux variance similarity (FVS) theory is used to partition urban forest ET into soil evaporation (E) and vegetation transpiration (T). This involves measurements from eddy covariance of water vapor and carbon dioxide fluxes, along with an estimated leaf-level water use efficiency (WUE) algorithm. The study compares five WUE algorithms in partitioning the average transpiration fraction (T/ET) and validates the results using two years of oxygen isotope observations. Although all five FVS-based WUE algorithms effectively capture the dynamic changes in hourly scale T and E across the four seasons, the algorithm that assumes a constant ratio of intercellular CO2 concentration (ci) to ambient CO2 concentration (ca) provides the most accurate simulation results for the ratio of T/ET. The performance metrics for this specific algorithm include the RMSE of 0.06, R2 of 0.88, the bias of 0.02, and MAPE of 8.9 %, respectively. Comparing urban forests to natural forests, the T/ET in urban areas is approximately 2.4–25.3 % higher, possibly due to the elevated air temperature (Ta), greater leaf area index (LAI), and increased soil water availability. Correlation analysis reveals that the T/ET dynamic is primarily controlled by Ta, LAI, net radiation, ca, and soil water content at half-hourly, daily, and monthly scales. This research provides valuable insights into the performance and applicability of various WUE algorithms in urban forests, contributing significantly to understanding the impact of urbanization on energy, water, and carbon cycles within ecosystems.

MRD-YOLO: A Multispectral Object Detection Algorithm for Complex Road Scenes

Object detection is one of the core technologies for autonomous driving. Current road object detection mainly relies on visible light, which is prone to missed detections and false alarms in rainy, night-time, and foggy scenes. Multispectral object detection based on the fusion of RGB and infrared images can effectively address the challenges of complex and changing road scenes, improving the detection performance of current algorithms in complex scenarios. However, previous multispectral detection algorithms suffer from issues such as poor fusion of dual-mode information, poor detection performance for multi-scale objects, and inadequate utilization of semantic information. To address these challenges and enhance the detection performance in complex road scenes, this paper proposes a novel multispectral object detection algorithm called MRD-YOLO. In MRD-YOLO, we utilize interaction-based feature extraction to effectively fuse information and introduce the BIC-Fusion module with attention guidance to fuse different modal information. We also incorporate the SAConv module to improve the model’s detection performance for multi-scale objects and utilize the AIFI structure to enhance the utilization of semantic information. Finally, we conduct experiments on two major public datasets, FLIR_Aligned and M3FD. The experimental results demonstrate that compared to other algorithms, the proposed algorithm achieves superior detection performance in complex road scenes.

OP-008 Performance of the FMF first-trimester preeclampsia-screening algorithm in women with high-risk factors

OP-008 Performance of the FMF first-trimester preeclampsia-screening algorithm in women with high-risk factors

Applications and Performance of Machine Learning Algorithms in Emergency Medical Services: A Scoping Review.

The aim of this study was to summarize the literature on the applications of machine learning (ML) and their performance in Emergency Medical Services (EMS). Four relevant electronic databases were searched (from inception through January 2024) for all original studies that employed EMS-guided ML algorithms to enhance the clinical and operational performance of EMS. Two reviewers screened the retrieved studies and extracted relevant data from the included studies. The characteristics of included studies, employed ML algorithms, and their performance were quantitively described across primary domains and subdomains. This review included a total of 164 studies published from 2005 through 2024. Of those, 125 were clinical domain focused and 39 were operational. The characteristics of ML algorithms such as sample size, number and type of input features, and performance varied between and within domains and subdomains of applications. Clinical applications of ML algorithms involved triage or diagnosis classification (n = 62), treatment prediction (n = 12), or clinical outcome prediction (n = 50), mainly for out-of-hospital cardiac arrest/OHCA (n = 62), cardiovascular diseases/CVDs (n = 19), and trauma (n = 24). The performance of these ML algorithms varied, with a median area under the receiver operating characteristic curve (AUC) of 85.6%, accuracy of 88.1%, sensitivity of 86.05%, and specificity of 86.5%. Within the operational studies, the operational task of most ML algorithms was ambulance allocation (n = 21), followed by ambulance detection (n = 5), ambulance deployment (n = 5), route optimization (n = 5), and quality assurance (n = 3). The performance of all operational ML algorithms varied and had a median AUC of 96.1%, accuracy of 90.0%, sensitivity of 94.4%, and specificity of 87.7%. Generally, neural network and ensemble algorithms, to some degree, out-performed other ML algorithms. Triaging and managing different prehospital medical conditions and augmenting ambulance performance can be improved by ML algorithms. Future reports should focus on a specific clinical condition or operational task to improve the precision of the performance metrics of ML models.

Proactive Resource Allocation for Cloud Manufacturing: A Dynamic Approach with DNN-Based Hybrid Many Objective Leopard Seal Algorithm

In the domain of cloud manufacturing, diverse services and the escalating demand for efficient and cost-effective service composition selection in cloud manufacturing have spurred day by day. Traditional methods face several challenges such as the risk of convergence issues and suboptimal solutions, high dimensionality of decision space, increased computational complexity, and scalability issues. To overcome these complexities, this paper proposed a novel method named the Deep Neural Network (DNN) based Hybrid Many Objective Leopard Seal (HMOLS) algorithm. In this study, DNN is employed to predict future Quality of Service (QoS) for each service based on historical data and integrated features. These predictions are fed back into the optimization model, influencing the dynamic weight calculation for each objective function. In this work, the Leopard Seal Optimization is implemented for hyperparameter optimization to enhance the performance of the HMOLS algorithm. Various evaluation metrics namely accuracy, throughput, reliability, resource utilization, and scalability are utilized to evaluate the performance of the HMOLS method and compare its performance with existing methods. The experimental outcomes depict the effectiveness of the HMOLS approach for the effective selection of services and fusion for cloud manufacturing. DNN-based predictions utilize deep neural networks to predict resource demand or utilization patterns and enable more accurate allocation decisions. These predictions optimize resource allocation by reallocating resources accordingly and address the challenges of resource utilization. Meanwhile, this method is required to overcome the computational overhead for applicability in cloud manufacturing.

Performance Evaluation of Some Selected Classification Algorithms in a Facial Recognition System

Facial Recognition (FR) has been an active area of research and has diverse applicable environment, it continues to be a challenging research topic. With the development of image processing and pattern recognition technology, there are many challenges in machine learning to select the appropriate classification algorithms, most especially in the area of classification of extracted features to have low classification time, high sensitivity and accuracy of the classification algorithms, so it is very important to explore the performance of different algorithms in image classification. The three selected supervised learning classification algorithms: Learning Vector Quantization (LVQ), Relevance Vector Machine (RVM), and Support Vector Machine (SVM) performance were evaluated so as to know the most effective out of the selected algorithms for facial images classification. The development of the system has four stages, the first stage is image acquisition and 180 images were taken by digital camera under same illumination and light colour background. The second stage is pre-processing to improve the images data by suppressing unwilling distortion; grayscale and normalization were used for image pre-processing. The third stage is feature extraction; Discrete Cosine Transform (DCT) is adopted for this purpose. While the fourth stage is face recognition classification, Receiver Operating Characteristics (ROC) was used to test the performance of each the three algorithms. However the Learning Vector Quantization algorithm, Relevance Vector Machine and Support Vector Machine performance have not been compared together to the most effective out of the three algorithms in term of False Positive Rate, Sensitivity, Specificity, Precision, Accuracy and Computation Time. Hence, this work evaluated the performance of the Learning Vector Quantization; Relevance Vector Machine and Support Vector Machine classification algorithms in facial recognition system and Support Vector Machine outwit the other two algorithms in facial recognition in term of specificity, recognition time and recognition accuracy at different threshold.