Search

In recent years, interest has grown in alternative strategies for the search for New Physics beyond the Standard Model. One envisaged solution lies in the development of anomaly detection algorithms based on unsupervised machine learning techniques. In this paper, we propose a new Generative Adversarial Network-based auto-encoder model that allows both anomaly detection and model-independent background modeling. This algorithm can be integrated with other model-independent tools in a complete heavy resonance search strategy. The proposed strategy has been tested on the LHC Olympics 2020 dataset with promising results. [ABSTRACT FROM AUTHOR]

The quality of sleep plays a crucial role in physical well-being, and individuals are becoming increasingly concerned about sleep quality and its associated health issues. Although various sleep monitoring devices exist, there remains a need for a highly accurate sleep state identification algorithm. To address this, we present a paper that utilizes machine learning techniques to identify human sleep states based on electroencephalogram (EEG) signals collected by an EEG instrument. We propose a model that incorporates two nonlinear characteristic parameters, MSE and PSE, extracted from artificially designed EEG signals as input. Additionally, we employ a Support Vector Machine (SVM) classifier algorithm to accurately identify sleep states, eliminating uncertainties associated with manually designed feature parameters. Experimental results demonstrate the superior accuracy of our proposed model for sleep state analysis, offering valuable insights for improving sleep quality and addressing related health concerns. [ABSTRACT FROM AUTHOR]

There is a widespread use of cluster-based routing in wireless sensor networks since it is the most energy-efficient. Idealizing cluster heads, on the other hand, is NP-hard and hence requires heuristic or metaheuristic approaches. However, while outperforming algorithms, metaheuristics computation time restricts its ability to respond to routing requests as rapidly as algorithms can today. A network's or an application's parameters can't be easily accommodated by routing methods. This paper offers the HMML, a combination model combining hybrid metaheuristics and machine-learning. Our HMML model makes use of an automated tuning metaheuristic (e.g. evolutionary algorithm) to fine-tune the heuristic technique for each specific configuration. For a variety of combinations, this is done. A network simulation is run using the modified heuristic algorithm in each configuration to arrive at a solution. As a result, a comprehensive dataset for a variety of conditions is produced (e.g., support vector machine). These characteristics include local (round-state), global (network-state), and application-specific aspects of the input feature vector. After training, the HMML model may be used to quickly cluster data. Machine learning's capacity to generalize helps us comprehend the metaheuristic algorithm's behavior in identifying optimal paths for previous configurations. Simulation studies show that HMML can adapt to varied applications while extending network life which increases upto 5% for total energy consumption. [ABSTRACT FROM AUTHOR]

Deficits in social verbal communication in individuals with Social Communication Disorder (SCD) is of concern and SCD in the human community is prevalent in large population throughout the globe. Deficits in verbal social communication are prevalent in a large population. This paper aimed to propose internet connected multi-system architecture which is capable to support verbal communication in a social environment for individuals with social communication deficits. Implementation methodology was included with corpus collection for specific communication, deep learning based machine training for intelligent communication, and implementation of the trained algorithm on internet connected electronic multiple social communication devices. The implemented system is smart enough to initiate and maintain two types of communication; the first type includes communication between multiple individuals on the remote location and the second type includes communication with the individual present in the physical listening range. The system was investigated in terms of its algorithmic parameters and found 97% to 100% in terms of training and testing accuracy with negligible mean squared error. Vocal-Friend analysed results based on audio-bot simulative conditions provide more than 91% accuracy, interaction rate and fallback rate. On the basis of the satisfaction analysis, above average results were noticed. In terms of technical implementations and satisfaction analysis, results found acceptable with above average score. Proposed framework is easy to use by caregivers with even having little knowledge. Support individual with deficit to learn social verbal communication skill to survive in society. Aiding parents, caregivers and professionals to understand the communication needs of individuals with communication deficits. Since technology is also grooming in the domain of rehabilitation, so this system could be used in various future applications such as social robots, social virtual assistants etc. [ABSTRACT FROM AUTHOR]

Multimedia data is crucial in the military, medical, forensics, social, etc., to transmit a large amount of data. Security of this sensitive information is the primary issue. This paper uses Latin square and machine learning techniques such as neural networks and genetic algorithm to design an image encryption algorithm. A new neural network-based pseudorandom number generator is proposed to generate a chaotic sequence for various applications. Encryption key images are designed using Latin squares in the finite field. Further, the Latin squares are XOR with the input matrix to get the encrypted images. The proposed algorithm is iterated a finite number of times to generate a cipher image population. Randomly two parents are chosen from the generated population, and row and column arrangements produce offspring. A genetic algorithm is the optimization technique used for the best encrypted image search. The pixel correlation value serves as a fitness function. Finally, the least correlated cipher image is obtained from the genetic algorithm applied to the parent and offspring of the population generated from the encryption algorithm. The simulation results from the proposed image encryption model surpass many communication channel attacks and perform better when compared to existing image security algorithms. [ABSTRACT FROM AUTHOR]

Since the inception of algorithmic trading during the mid-1970s, considerable resources and time have been committed by the financial sector to the development of trading algorithms in the hope of obtaining a competitive advantage over human contenders. A plethora of trading algorithms has been proposed in the literature; each algorithm is unique in its design, but little emphasis has been placed on heterogeneous trading strategy ensembling. In this paper, we propose a trading strategy ensemble method for combining three different domain-specific trading strategies: a deterministic strategy, a probabilistic strategy, and a machine-learning strategy. The objective of the trading strategy ensemble is to find an appropriate trade-off between the levels of return and the risk exposure of a trader. We implement our strategy across different historical forex currency pair data in a bid to validate the trading strategy ensemble, and we analyse the results by invoking appropriate return and risk performance measures. [ABSTRACT FROM AUTHOR]

This study utilizes classification models to provide a robust algorithm for imbalanced data where the minority class is of the interest, that is, in the context of default payments. In developing an integrated predictive accuracy algorithm, this study proposes machine learning classifiers and applies DNN, SVM, KNN, and ANN. The proposed algorithm utilizes a 30,000 imbalanced dataset to improve the accuracy of the prediction of default payments by implementing oversampling and undersampling strategies, such as synthetic minority oversampling technique (SMOTE), SVM SMOTE, random undersampling, and ALL-KNN. The results indicate that the SVM under the ALL-KNN sampling technique is able to achieve an accuracy of 98.6%, with the lowest cross entropy loss measurement of 0.028. Through the accurate implementation of the neural networks and neurons used in the proposed algorithm, this paper presents better insights into the functioning of the neural networks when used in conjunction with the resampling techniques. Using the methodology and algorithm presented in this study, credit risk assessments can be more accurately predicted in practical applications where most of the clients are categorized as non-default payments. [ABSTRACT FROM AUTHOR]

In recent years, the utilization of dual-arm robots has gained substantial prominence across various industries owing to their collaborative operational capabilities. In order to achieve collision avoidance and facilitate cooperative task completion, efficient path planning plays a pivotal role. The high dimensionality associated with collaborative task execution in dual-arm robots renders existing path planning methods ineffective for conducting efficient exploration. This paper introduces a multi-agent path planning reinforcement learning algorithm that integrates an experience replay strategy, a shortest-path constraint, and the policy gradient method. To foster collaboration and avoid competition between the robot arms, the proposed approach incorporates a mechanism known as "reward cooperation, punishment competition" during the training process. Our algorithm demonstrates strong performance in the control of dual-arm robots and exhibits the potential to mitigate the challenge of reward sparsity encountered during the training process. The effectiveness of the proposed algorithm is validated through simulations and experiments, comparing the results with existing methods and showcasing its superiority in dual-arm robot path planning. [ABSTRACT FROM AUTHOR]

Given that fingerprint localization methods can be effectively modeled as supervised learning problems, machine learning has been employed for indoor localization tasks based on fingerprint methods. However, it is often challenging for popular machine learning models to effectively capture the unstructured data features inherent in fingerprint data that are generated in diverse propagation environments. In this paper, we propose an indoor localization algorithm based on a high-order graph neural network (HoGNNLoc) to enhance the accuracy of indoor localization and improve localization stability in dynamic environments. The algorithm first designs an adjacency matrix based on the spatial relative locations of access points (APs) to obtain a graph structure; on this basis, a high-order graph neural network is constructed to extract and aggregate the features; finally, the designed fully connected network is used to achieve the regression prediction of the location of the target to be located. The experimental results on our self-built dataset show that the proposed algorithm achieves localization accuracy within 1.29 m at 80% of the cumulative distribution function (CDF) points. The improvements are 59.2%, 51.3%, 36.1%, and 22.7% compared to the K-nearest neighbors (KNN), deep neural network (DNN), simple graph convolutional network (SGC), and graph attention network (GAT). Moreover, even with a 30% reduction in fingerprint data, the proposed algorithm exhibits stable localization performance. On a public dataset, our proposed localization algorithm can also show better performance. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) and network-enabled smart devices are crucial to the digitally interconnected society of the present day. However, the increased reliance on IoT devices increases their susceptibility to malicious activities within network traffic, posing significant challenges to cybersecurity. As a result, both system administrators and end users are negatively affected by these malevolent behaviours. Intrusion-detection systems (IDSs) are commonly deployed as a cyber attack defence mechanism to mitigate such risks. IDS plays a crucial role in identifying and preventing cyber hazards within IoT networks. However, the development of an efficient and rapid IDS system for the detection of cyber attacks remains a challenging area of research. Moreover, IDS datasets contain multiple features, so the implementation of feature selection (FS) is required to design an effective and timely IDS. The FS procedure seeks to eliminate irrelevant and redundant features from large IDS datasets, thereby improving the intrusion-detection system's overall performance. In this paper, we propose a hybrid wrapper-based feature-selection algorithm that is based on the concepts of the Cellular Automata (CA) engine and Tabu Search (TS)-based aspiration criteria. We used a Random Forest (RF) ensemble learning classifier to evaluate the fitness of the selected features. The proposed algorithm, CAT-S, was tested on the TON_IoT dataset. The simulation results demonstrate that the proposed algorithm, CAT-S, enhances classification accuracy while simultaneously reducing the number of features and the false positive rate. [ABSTRACT FROM AUTHOR]

The complexity of modern war is increasing，and the rapid operational mission planning is of great importance to improve the efficiency of command and control. This paper presents a joint operational Task Matrix （TM） model，which is a theoretical method for mission planning; A belief network model is put forward to describe the relationship among the elements in TM model ;A naive bayesian learning method for belief network is designed; A mechanism of imagination is put forward to speed up the learning process ; A search algorithm named Deep Minimum Threat Generation Tree（DMTGT） is proposed, which can efficiently calculate task priority by balancing search error and search speed. Finally, the validity of above models and algorithms is verified by simulation experiments. [ABSTRACT FROM AUTHOR]

Identifying and assessing Parkinson's disease in its early stages is critical to effectively monitoring the disease's progression. Methodologies based on machine learning enhanced speech analysis are gaining popularity as the potential of this field is revealed. Acoustic features, in particular, are used in a variety of algorithms for machine learning and could serve as indicators of the general health of subjects' voices. In this research paper, a novel method is introduced for the automated detection of Parkinson's disease through speech signal analysis, a support vector machines classifier (SVM) and an Artificial Neural Network (ANN) are used to evaluate and classify the data based on two acoustic features: Bark Frequency Cepstral Coefficients (BFCC) and Mel Frequency Cepstral Coefficients (MFCC). These features are extracted from the denoised signals using Empirical Mode Decomposition (EMD). The most relevant results obtained for a dataset of 38 participants are by the BFCC coefficients with an accuracy up to 92.10%. These results confirm that EMD-BFCC-SVM method can contribute to the detection of Parkinson's disease. [ABSTRACT FROM AUTHOR]

Simple Summary: Melanoma is the most dangerous type of skin cancer worldwide. Early detection of melanoma is crucial for better outcomes, but this often can be challenging. This research explores the use of artificial intelligence (AI) techniques combined with non-invasive imaging methods to improve melanoma detection. The authors aim to evaluate the current state of AI-based techniques using tools including dermoscopy, optical coherence tomography (OCT), and reflectance confocal microscopy (RCM). The findings demonstrate that several AI algorithms perform as well as or better than dermatologists in detecting melanoma, particularly in the analysis of dermoscopy images. This research highlights the potential of AI to enhance diagnostic accuracy, leading to improved patient outcomes. Further studies are needed to address limitations and ensure the reliability and effectiveness of AI-based techniques. Background: Melanoma, the deadliest form of skin cancer, poses a significant public health challenge worldwide. Early detection is crucial for improved patient outcomes. Non-invasive skin imaging techniques allow for improved diagnostic accuracy; however, their use is often limited due to the need for skilled practitioners trained to interpret images in a standardized fashion. Recent innovations in artificial intelligence (AI)-based techniques for skin lesion image interpretation show potential for the use of AI in the early detection of melanoma. Objective: The aim of this study was to evaluate the current state of AI-based techniques used in combination with non-invasive diagnostic imaging modalities including reflectance confocal microscopy (RCM), optical coherence tomography (OCT), and dermoscopy. We also aimed to determine whether the application of AI-based techniques can lead to improved diagnostic accuracy of melanoma. Methods: A systematic search was conducted via the Medline/PubMed, Cochrane, and Embase databases for eligible publications between 2018 and 2022. Screening methods adhered to the 2020 version of the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analyses) guidelines. Included studies utilized AI-based algorithms for melanoma detection and directly addressed the review objectives. Results: We retrieved 40 papers amongst the three databases. All studies directly comparing the performance of AI-based techniques with dermatologists reported the superior or equivalent performance of AI-based techniques in improving the detection of melanoma. In studies directly comparing algorithm performance on dermoscopy images to dermatologists, AI-based algorithms achieved a higher ROC (>80%) in the detection of melanoma. In these comparative studies using dermoscopic images, the mean algorithm sensitivity was 83.01% and the mean algorithm specificity was 85.58%. Studies evaluating machine learning in conjunction with OCT boasted accuracy of 95%, while studies evaluating RCM reported a mean accuracy rate of 82.72%. Conclusions: Our results demonstrate the robust potential of AI-based techniques to improve diagnostic accuracy and patient outcomes through the early identification of melanoma. Further studies are needed to assess the generalizability of these AI-based techniques across different populations and skin types, improve standardization in image processing, and further compare the performance of AI-based techniques with board-certified dermatologists to evaluate clinical applicability. [ABSTRACT FROM AUTHOR]

In this paper, we study numerical solution of ruin probability of continuous time model. We develop an effective optimal adaptive particle swarm optimization-triangular neural network (PSO-TNN), which consists of three parts: particle swarm optimization algorithm (PSO) improved trigonometric function, extreme learning machine algorithm with initial conditions (IELM) and improved reduction algorithm. The results obtained that PSO-TNN is superior to triangular neural network (TNN) and physics-informed neural networks (PINNs), and PSO is superior to Aquila Optimizer (AO), Smell Agent Optimization (SAO), African vultures optimization algorithm (AVOA), Arithmetic optimization algorithm (AOA) in the optimization of neural network. Because the relationship between the number of neural networks and the mean square error is uncertain, we propose the adaptive reduction algorithm (AR). Through the comparison of numerical solutions with the analytical solutions and traditional numerical solutions, the PSO-TNN algorithm clearly reduced the mean square error and relative error. The PSO-TNN algorithm shows a clear improvement in terms of accuracy and overall efficiency. [ABSTRACT FROM AUTHOR]

In this paper, we formulate the problem of estimating the resident population, i.e. correcting for over-counts in administrative register data, as a binary classification problem. We propose a solution based on machine learning algorithms. The selection and the optimisation of the best algorithm is shown to depend on the goal of prediction. We illustrate this method for two important cases of official statistics, Census resident population and survey design with minimum non-response. The performance of the algorithms, the uncertainty of estimates and of the evaluation metrics are described in detail and implemented in shared, open source code. We exemplify with the results obtained by applying this method to Icelandic register and survey data. [ABSTRACT FROM AUTHOR]

In the era of healthcare and its related research fields, the dimensionality problem of high-dimensional data is a massive challenge as it is crucial to identify significant genes while conducting research on diseases like cancer. As a result, studying new Machine Learning (ML) techniques for raw gene expression biomedical data is an important field of research. Disease detection, sample classification, and early disease prediction are all important analyses of high-dimensional biomedical data in the field of bioinformatics. Recently, machine-learning techniques have dramatically improved the analysis of high-dimension biomedical data sets. Nonetheless, researchers' studies on biomedical data faced the challenge of vast dimensions, i.e., the vast features (genes) with a very low sample space. In this paper, two-dimensionality reduction methods, feature selection, and feature extraction are introduced with a systematic comparison of several dimension reduction techniques for the analysis of high-dimensional gene expression biomedical data. We presented a systematic review of some of the most popular nature-inspired algorithms and analyzed them. The paper is mainly focused on the original principles behind each of the algorithms and their applications for cancer classification and prediction from gene expression data. Lastly, the advantages and disadvantages of nature-inspired algorithms for biomedical data are evaluated. This review paper may guide researchers to choose the most effective algorithm for cancer classification and prediction for the satisfactory analysis of high-dimensional biomedical data. [ABSTRACT FROM AUTHOR]

Previous major earthquake events have revealed that soils susceptible to liquefaction are one of the factors causing significant damages to the structures. Therefore, accurate prediction of the liquefaction phenomenon is an important task in earthquake engineering. Over the past decade, several researchers have been extensively applied machine learning (ML) methods to predict soil liquefaction. This paper presents the prediction of soil liquefaction from the SPT dataset by using relatively new and robust tree-based ensemble algorithms, namely Adaptive Boosting, Gradient Boosting Machine, and eXtreme Gradient Boosting (XGBoost). The innovation points introduced in this paper are presented briefly as follows. Firstly, Stratified Random Sampling was utilized to ensure equalized sampling between each class selection. Secondly, feature selection methods such as Recursive Feature Elimination, Boruta, and Stepwise Regression were applied to develop models with a high degree of accuracy and minimal complexity by selecting the variables with significant predictive features. Thirdly, the performance of ML algorithms with feature selection methods was compared in terms of four performance metrics, Overall Accuracy, Precision, Recall, and F-measure to select the best model. Lastly, the best predictive model was determined using a statistical significance test called Wilcoxon's sign rank test. Furthermore, computational cost analyses of the tree-based ensemble algorithms were performed based on parallel and non-parallel processing. The results of the study suggest that all developed tree-based ensemble models could reliably estimate soil liquefaction. In conclusion, according to both validation and statistical results, the XGBoost with the Boruta model achieved the most stable and better prediction performance than the other models in all considered cases. [ABSTRACT FROM AUTHOR]

In the field of gas turbine (GT) monitoring and diagnostics, GT trip is of great concern for manufactures and users. In fact, due to the number of issues that may cause a trip, its occurrence is not infrequent, and its prediction is a quite unexplored field of research. This is demonstrated by the fact that, despite its relevance, a comprehensive study on the reliability of predicting GT trip has not been proposed yet. To fill this gap, this paper investigates the fusion of five data-driven base models by means of voting and stacking, in order to improve prediction accuracy and robustness. The five benchmark supervised machine learning and deep learning classifiers are k-nearest neighbors, support vector machine (SVM), Naïve Bayes (NB), decision trees (DTs), and long short-term memory (LSTM) neural networks. While voting just averages the predictions of base models, without providing additional pieces of information, stacking is a technique used to aggregate heterogeneous models by training an additional machine learning model (namely, stacked ensemble model) on the predictions of the base models. The analyses carried out in this paper employ filed observations of both safe operation and trip events, derived from a large fleet of industrial Siemens GTs in operation. The results demonstrate that the stacked model provides higher accuracy than base models and also outperforms voting by proving more effective, especially when the reliability of the prediction of base models is poor. [ABSTRACT FROM AUTHOR]

Simple Summary: In radiotherapy treatment, organs at risk and target volumes are contoured by the clinicians to prepare a dosimetry plan. In retrospective data, these structures are not often standardised to universal names across the patients plans, which is required to enable data mining and analysis. In this paper, a new method was proposed and evaluated to automatically standardise radiotherapy structures names using machine learning algorithms. The proposed approach was deployed over a dataset with 1613 patients collected from Liverpool & Macarthur Cancer Therapy Centres, New South Wales, Australia. It was concluded that machine learning techniques can standardise the dosimetry plan structures, taking into consideration the integration of multiple modalities representing each structure during the training process. In progressing the use of big data in health systems, standardised nomenclature is required to enable data pooling and analyses. In many radiotherapy planning systems and their data archives, target volumes (TV) and organ-at-risk (OAR) structure nomenclature has not been standardised. Machine learning (ML) has been utilised to standardise volumes nomenclature in retrospective datasets. However, only subsets of the structures have been targeted. Within this paper, we proposed a new approach for standardising all the structures nomenclature by using multi-modal artificial neural networks. A cohort consisting of 1613 breast cancer patients treated with radiotherapy was identified from Liverpool & Macarthur Cancer Therapy Centres, NSW, Australia. Four types of volume characteristics were generated to represent each target and OAR volume: textual features, geometric features, dosimetry features, and imaging data. Five datasets were created from the original cohort, the first four represented different subsets of volumes and the last one represented the whole list of volumes. For each dataset, 15 sets of combinations of features were generated to investigate the effect of using different characteristics on the standardisation performance. The best model reported 99.416% classification accuracy over the hold-out sample when used to standardise all the nomenclatures in a breast cancer radiotherapy plan into 21 classes. Our results showed that ML based automation methods can be used for standardising naming conventions in a radiotherapy plan taking into consideration the inclusion of multiple modalities to better represent each volume. [ABSTRACT FROM AUTHOR]

To improve the effect of commercial insurance risk decision, this paper applies neural network algorithms to commercial insurance risk decision under the guidance of machine learning ideas, and selects the neural network algorithm based on the actual situation. Moreover, this paper analyzes the nature of risks of commercial insurance, analyzes the types of risks and risk relevance, constructs a commercial insurance risk decision model based on neural network algorithms, and determines the system process. In addition, this paper uses a combination method of qualitative and quantitative to identify the influencing factors of risk estimation to obtain relevant influencing factors, and verify the model proposed in this paper in combination with experimental research. From the experimental research results, it can be seen that the commercial insurance risk decision system based on neural network algorithm is very good in terms of decision effect. [ABSTRACT FROM AUTHOR]

Aiming at the deficiency that K2 algorithm depends on the maximum number of parent nodes and node of order, this paper proposed an improved Bayesian network structure learning algorithm (MWST-CS-K2). The algorithm firstly obtained the maximum number of parent nodes by constructing the maximum support tree (MWST). Then it used the correlation degree and updated coefficient between variables to set rules for adding, subtracting and reversing edges. The paper used improved cuckoo algorithm to optimize the nest location, and applied the breadth first search strategy to search and traverse to get the node order. Finally, the paper used maximum number of parent nodes and the order of nodes as the input of K2 algorithm to get the final network. Experiments show that in the standard ASIA,SACHS and CHILD network data tests, the average correct edge ratio of MWST-CS-K2 algorithm reaches 97.3%, 87.7 % and 95.6% respectively. The learning effect is better than other corresponding comparison algorithms, and the network structure obtains the most similar to the standard network structure. [ABSTRACT FROM AUTHOR]

This paper presents a Bayesian model, called the Bayesian Bradley Terry (BBT) model, for comparing multiple algorithms on multiple data sets based on any metric. The model is an extension of the Bradley Terry model, which tracks the number of wins each algorithm has on different data sets. Unlike frequentist methods such as Demsar tests on mean rank or multiple pairwise Wilcoxon tests, the Bayesian approach provides a more nuanced understanding of the algorithms' performance and allows for the definition of the "region of practical equivalence" (ROPE) for two algorithms. Additionally, the paper introduces the concept of "local ROPE," which assesses the significance of the difference in mean measure between two algorithms using effect sizes, and can be applied in frequentist approaches as well. Both an R package and a Python program implementing the BBT are available for use. [ABSTRACT FROM AUTHOR]

Reinforcement learning algorithms often require finiteness of state and action spaces in Markov decision processes (MDPs) (also called controlled Markov chains) and various efforts have been made in the literature towards the applicability of such algorithms for continuous state and action spaces. In this paper, we show that under very mild regularity conditions (in particular, involving only weak continuity of the transition kernel of an MDP), Q-learning for standard Borel MDPs via quantization of states and actions (called Quantized Q-Learning) converges to a limit, and furthermore this limit satisfies an optimality equation which leads to near optimality with either explicit performance bounds or which are guaranteed to be asymptotically optimal. Our approach builds on (i) viewing quantization as a measurement kernel and thus a quantized MDP as a partially observed Markov decision process (POMDP), (ii) utilizing near optimality and convergence results of Q-learning for POMDPs, and (iii) finally, near-optimality of finite state model approximations for MDPs with weakly continuous kernels which we show to correspond to the fixed point of the constructed POMDP. Thus, our paper presents a very general convergence and approximation result for the applicability of Q-learning for continuous MDPs. [ABSTRACT FROM AUTHOR]

Standard and econometric models are appropriate for causal relationships and interpretations among facets of the economy. But with prediction, they tend to over-fit samples and simplify poorly to new, undetected data. This paper presents a batch gradient algorithm for predicting the rice of land with large datasets. This paper uses a batch gradient descent algorithm to minimize the cost function, J(θ) iteratively with possible combinations of θ0 and θ1 the number of iterations i=1500 and learning rates,α of 0.01, 0.02, 0.03 for the linear regression case and i = 100, α =0.3, 0.2, and 0.1 for the multiple regression case. The paper uses Octave-4.0.3(GUI) for implementing 129 samples of the lease bid price of Mekelle City as training sets and feature inputs of two and three for linear regression and multiple regressions. Using α = 0.01, the best fitting parameters found by training the dataset are θ0 = 6.02 and θ1 = 2.30 with a cost of J=67.82. The model predicts with an accuracy of 92.6% using LR and 91.15% using MLR for a 315 m² land size. As the learning rate increases, the fitting parameters θ0 and θ1 increase and decrease respectively with an equal cost but the model's prediction error increments slowly. With multiple regression, as the learning rate lowers, the model under fits prediction drastically (with an accuracy of 60%) with gradient descent and predicts with an accuracy of 91.5% with ordinary equations. So, prediction with ordinary equations provides the best fit for multiple regressions. [ABSTRACT FROM AUTHOR]

In this paper, aiming at the severe problems of UWB positioning in NLOS-interference circumstances, a complete method is proposed for NLOS/LOS classification, NLOS identification and mitigation, and a final accurate UWB coordinate solution through the integration of two machine learning algorithms and a hybrid localization algorithm, which is called the C-T-CNN-SVM algorithm. This algorithm consists of three basic processes: an LOS/NLOS signal classification method based on SVM, an NLOS signal recognition and error elimination method based on CNN, and an accurate coordinate solution based on the hybrid weighting of the Chan–Taylor method. Finally, the validity and accuracy of the C-T-CNN-SVM algorithm are proved through a comparison with traditional and state-of-the-art methods. (i) Focusing on four main prediction errors (range measurements, maxNoise, stdNoise and rangeError), the standard deviation decreases from 13.65 cm to 4.35 cm, while the mean error decreases from 3.65 cm to 0.27 cm, and the errors are practically distributed normally, demonstrating that after training a SVM for LOS/NLOS signal classification and a CNN for NLOS recognition and mitigation, the accuracy of UWB range measurements may be greatly increased. (ii) After target positioning, the proposed method can realize a one-dimensional X-axis and Y-axis accuracy within 175 mm, and a Z-axis accuracy within 200 mm; a 2D ( X , Y ) accuracy within 200 mm; and a 3D accuracy within 200 mm, most of which fall within (100 mm, 100 mm, 100 mm). (iii) Compared with the traditional algorithms, the proposed C-T-CNN-SVM algorithm performs better in location accuracy, cumulative error probability (CDF), and root-mean-square difference (RMSE): the 1D, 2D, and 3D accuracy of the proposed method is 2.5 times that of the traditional methods. When the location error is less than 10 cm, the CDF of the proposed algorithm only reaches a value of 0.17; when the positioning error reaches 30 cm, only the CDF of the proposed algorithm remains in an acceptable range. The RMSE of the proposed algorithm remains ideal when the distance error is greater than 30 cm. The results of this paper and the idea of a combination of machine learning methods with the classical locating algorithms for improved UWB positioning under NLOS interference could meet the growing need for wireless indoor locating and communication, which indicates the possibility for the practical deployment of such a method in the future. [ABSTRACT FROM AUTHOR]

The popularity of video services such as video call or video on-demand has made it impossible for people to live without them in their daily lives. It can be anticipated that the explosive growth of vehicular communication owing to the widespread use of in-vehicle video infotainment applications in the future will result in increasing fragmentation and congestion of the wireless transmission spectrum. Accordingly, effective bandwidth management algorithms are demanded to achieve efficient communication and stable scalability in next-generation vehicular networks. To the best of our current knowledge, a noticeable gap remains in the existing literature regarding the application of the latest advancements in network communication technologies. Specifically, this gap is evident in the lack of exploration regarding how cutting-edge technologies can be effectively employed to optimize bandwidth allocation, especially in the realm of video service applications within the forthcoming vehicular networks. In light of this void, this paper presents a seamless integration of cutting-edge 6G communication technologies, such as terahertz (THz) and visible light communication (VLC), with the existing 5G millimeter-wave and sub-6 GHz base stations. This integration facilitates the creation of a network environment characterized by high transmission rates and extensive coverage. Our primary aim is to ensure the uninterrupted playback of real-time video applications for vehicle users. These video applications encompass video conferencing, live video, and on-demand video services. The outcomes of our simulations convincingly indicate that the proposed strategy adeptly addresses the challenge of bandwidth competition among vehicle users. Moreover, it notably boosts the efficient utilization of bandwidth from less crowded base stations, optimizes the fulfillment of bandwidth prerequisites for various video applications, and elevates the overall video quality experienced by users. Consequently, our findings serve as a successful validation of the practicality and effectiveness of the proposed methodology. [ABSTRACT FROM AUTHOR]

In this paper, the quantum technology is exploited to empower the OPTICS unsupervised learning algorithm, which is a density-based clustering algorithm with numerous applications in the real world. We design an algorithm called Quantum Ordering Points To Identify the Clustering Structure (QOPTICS) and demonstrate that its computational complexity outperforms that of its classical counterpart. On the other hand, we propose a Deep self-learning approach for modeling the improvement of two Swarm Intelligence Algorithms, namely Artificial Orca Algorithm (AOA) and Elephant Herding Optimization (EHO) in order to improve their effectiveness. The deep self-learning approach is based on two well-known dynamic mutation operators, namely Cauchy mutation operator and Gaussian mutation operator. And in order to improve the efficiency of these algorithms, they are hybridized with QOPTICS and executed on just one cluster it yields. This way, both effectiveness and efficiency are handled. To evaluate the proposed approaches, an intelligent application is developed to manage the dispatching of emergency vehicles in a large geographic region and in the context of Covid-19 crisis in order to avoid an important loss in human lives. A theoretical model is designed to describe the issue mathematically. Extensive experiments are then performed to validate the mathematical model and evaluate the performance of the proposed deep self-learning algorithms. Comparison with a state-of-the-art technique shows a significant positive impact of hybridizing Quantum Machine Learning (QML) with Deep Self Learning (DSL) on solving the Covid-19 EMS transportation. [ABSTRACT FROM AUTHOR]

Background: Food frequency questionnaires (FFQs) are one of the most useful tools for studying and understanding diet-disease relationships. However, because FFQs are self-reported data, they are susceptible to response bias, social desirability bias, and misclassification. Currently, several methods have been created to combat these issues by modelling the measurement error in diet-disease relationships. Method: In this paper, a novel machine learning method is proposed to adjust for measurement error found in misreported data by using a random forest (RF) classifier to label the responses in the FFQ based on the input dataset and creating an algorithm that adjusts the measurement error. We demonstrate this method by addressing underreporting in selected FFQ responses. Result: According to the results, we have high model accuracies ranging from 78% to 92% in participant collected data and 88% in simulated data. Conclusion: This shows that our proposed method of using a RF classifier and an error adjustment algorithm is efficient to correct most of the underreported entries in the FFQ dataset and could be used independent of diet-disease models. This could help nutrition researchers and other experts to use dietary data estimated by FFQs with less measurement error and create models from the data with minimal noise. [ABSTRACT FROM AUTHOR]

Creating algorithms and systems that can process and store large amounts of data represents a great scientific, economic, and practical challenge. The application of machine learning (ML) to these problems is not trivial, and even less so if the processing of these algorithms needs to be distributed to handle the large computational load of data analysis and decision making. This paper presents a distributed and robust architecture to train, deploy, and execute distributed failure detection algorithm pipelines improving their Robustness and Precision. The solution is based on Smart Operational Realtime Bigdata Analytics (SORBA), a patented distributed architecture. The architecture combines the metrics of Robustness and Precision to automatically optimize the selection of industrial failure detection machine learning algorithm pipelines and their hyperparameters. A system of modules is developed for the acquisition, normalization, data conditioning, training, deployment, and online execution of machine learning algorithm pipelines. The solution was validated by comparing the Machine Learning (ML) results of two use cases: an industrial motor and a locomotive battery, with those achieved with Spark. The experiments showed an average improvement on the Precision Score of 28.76% and Robustness Index of 10.9%. The solution streamlines the implementation of successful applications and improves the performance of these indicators with respect to the solutions currently available in the Spark MLlib. [ABSTRACT FROM AUTHOR]

Much recent research effort has been directed to the development of efficient algorithms for solving minimax problems with theoretical convergence guarantees due to the relevance of these problems to a few emergent applications. In this paper, we propose a unified single-loop alternating gradient projection (AGP) algorithm for solving smooth nonconvex-(strongly) concave and (strongly) convex–nonconcave minimax problems. AGP employs simple gradient projection steps for updating the primal and dual variables alternatively at each iteration. We show that it can find an ε -stationary point of the objective function in O ε - 2 (resp. O ε - 4 ) iterations under nonconvex-strongly concave (resp. nonconvex–concave) setting. Moreover, its gradient complexity to obtain an ε -stationary point of the objective function is bounded by O ε - 2 (resp., O ε - 4 ) under the strongly convex–nonconcave (resp., convex–nonconcave) setting. To the best of our knowledge, this is the first time that a simple and unified single-loop algorithm is developed for solving both nonconvex-(strongly) concave and (strongly) convex–nonconcave minimax problems. Moreover, the complexity results for solving the latter (strongly) convex–nonconcave minimax problems have never been obtained before in the literature. Numerical results show the efficiency of the proposed AGP algorithm. Furthermore, we extend the AGP algorithm by presenting a block alternating proximal gradient (BAPG) algorithm for solving more general multi-block nonsmooth nonconvex-(strongly) concave and (strongly) convex–nonconcave minimax problems. We can similarly establish the gradient complexity of the proposed algorithm under these four different settings. [ABSTRACT FROM AUTHOR]

Work in online learning traditionally considered induction-friendly (e.g. stochastic with a fixed distribution) and induction-hostile (adversarial) settings separately. While algorithms like Exp3 that have been developed for the adversarial setting are applicable to the stochastic setting as well, the guarantees that can be obtained are usually worse than those that are available for algorithms that are specifically designed for stochastic settings. Only recently, there is an increasing interest in algorithms that give (near-)optimal guarantees with respect to the underlying setting, even in case its nature is unknown to the learner. In this paper, we review various online learning algorithms that are able to adapt to the hardness of the underlying problem setting. While our focus lies on the application of adaptive algorithms as meta-inductive methods that combine given base methods, concerning theoretical properties we are also interested in guarantees that go beyond a comparison to the best fixed base learner. [ABSTRACT FROM AUTHOR]

Background: In silico testing of novel image reconstruction and quantitative algorithms designed for interventional imaging requires realistic high‐resolution modeling of arterial trees with contrast dynamics. Furthermore, data synthesis for training of deep learning algorithms requires that an arterial tree generation algorithm be computationally efficient and sufficiently random. Purpose: The purpose of this paper is to provide a method for anatomically and physiologically motivated, computationally efficient, random hepatic arterial tree generation. Methods: The vessel generation algorithm uses a constrained constructive optimization approach with a volume minimization‐based cost function. The optimization is constrained by the Couinaud liver classification system to assure a main feeding artery to each Couinaud segment. An intersection check is included to guarantee non‐intersecting vasculature and cubic polynomial fits are used to optimize bifurcation angles and to generate smoothly curved segments. Furthermore, an approach to simulate contrast dynamics and respiratory and cardiac motion is also presented. Results: : The proposed algorithm can generate a synthetic hepatic arterial tree with 40 000 branches in 11 s. The high‐resolution arterial trees have realistic morphological features such as branching angles (MAD with Murray's law =1.2±1.2o$ = \;1.2 \pm {1.2^o}$), radii (median Murray deviation =0.08$ = \;0.08$), and smoothly curved, non‐intersecting vessels. Furthermore, the algorithm assures a main feeding artery to each Couinaud segment and is random (variability = 0.98 ± 0.01). Conclusions: This method facilitates the generation of large datasets of high‐resolution, unique hepatic angiograms for the training of deep learning algorithms and initial testing of novel 3D reconstruction and quantitative algorithms designed for interventional imaging. [ABSTRACT FROM AUTHOR]

In this paper, we have designed an artificial neural network architecture to produce metric field of planar BTZ and quintessence black holes applying a data-driven approach andleveraging holography principle (according to AdS/DL (Anti de Sitter/Deep Learning) correspondence given by [1]). Data has been collected by choosing minimally coupled massive scalar field with quantum fluctuations and we try to process two emergent and ground-truth metrics versus the holographic parameter which plays the role of depth of the neural network. Loss or error function which shows rate of deviation of these two metrics in presence of penalty regularization term reaches to its minimum value when values of the learning rate approach to the observed steepest gradient point. Values of the regularization or penalty term of the quantum scalar field has critical role to matching this two mentioned metric. Also, we design an algorithm which helps us to find optimum value for learning parameter and finally, we understand that loss function convergence heavily depends on the number of epochs and learning rate. [ABSTRACT FROM AUTHOR]

Tremendous efficient optimization methods have been proposed for strongly convex objectives optimization in modern machine learning. For non-strongly convex objectives, a popular approach is to apply a reduction from non-strongly convex to a strongly convex case via regularization techniques. Reduction on objectives with adaptive decrease on regularization tightens the optimal convergence of algorithms to be independent on logarithm factor. However, the initialization of parameter of regularization has a great impact on the performance of the reduction. In this paper, we propose an aggressive reduction to reduce the complexity of optimization for non-strongly convex objectives, and our reduction eliminates the impact of the initialization of parameter on the convergent performances of algorithms. Aggressive reduction not only adaptively decreases the regularization parameter, but also modifies regularization term as the distance between current point and the approximate minimizer. Our aggressive reduction can also shave off the non-optimal logarithm term theoretically, and make the convergent performance of algorithm more compact practically. Experimental results on logistic regression and image deblurring confirm this success in practice. [ABSTRACT FROM AUTHOR]

Simple Summary: This paper presents a cervical cancer detection approach where the KNN Imputer techniques is used to fill the missing values and after that SMOTE upsampled features are utilized to train a multi-model ensemble learning approach. Results demonstrate that use of KNN Imputed SMOTE features yields better results than the original features to classify cancerous and normal patients. Objective: Cervical cancer ranks among the top causes of death among females in developing countries. The most important procedures that should be followed to guarantee the minimizing of cervical cancer's aftereffects are early identification and treatment under the finest medical guidance. One of the best methods to find this sort of malignancy is by looking at a Pap smear image. For automated detection of cervical cancer, the available datasets often have missing values, which can significantly affect the performance of machine learning models. Methods: To address these challenges, this study proposes an automated system for predicting cervical cancer that efficiently handles missing values with SMOTE features to achieve high accuracy. The proposed system employs a stacked ensemble voting classifier model that combines three machine learning models, along with KNN Imputer and SMOTE up-sampled features for handling missing values. Results: The proposed model achieves 99.99% accuracy, 99.99% precision, 99.99% recall, and 99.99% F1 score when using KNN imputed SMOTE features. The study compares the performance of the proposed model with multiple other machine learning algorithms under four scenarios: with missing values removed, with KNN imputation, with SMOTE features, and with KNN imputed SMOTE features. The study validates the efficacy of the proposed model against existing state-of-the-art approaches. Conclusions: This study investigates the issue of missing values and class imbalance in the data collected for cervical cancer detection and might aid medical practitioners in timely detection and providing cervical cancer patients with better care. [ABSTRACT FROM AUTHOR]

Fuzzy rough set theory has been successfully applied to many attribute reduction methods, in which the lower approximation set plays a pivotal role. However, the definition of lower approximation used has ignored the information conveyed by the upper approximation and the boundary region. This oversight has resulted in an unreasonable relation representation of the target set. Despite the fact that scholars have proposed numerous enhancements to rough set models, such as the variable precision model, none have successfully resolved the issues inherent in the classical models. To address this limitation, this paper proposes an unsupervised attribute reduction algorithm for mixed data based on an improved optimal approximation set. Firstly, the theory of an improved optimal approximation set and its associated algorithm are proposed. Subsequently, we extend the classical theory of optimal approximation sets to fuzzy rough set theory, leading to the development of a fuzzy improved approximation set method. Finally, building on the proposed theory, we introduce a novel, fuzzy optimal approximation-set-based unsupervised attribute reduction algorithm (FOUAR). Comparative experiments conducted with all the proposed algorithms indicate the efficacy of FOUAR in selecting fewer attributes while maintaining and improving the performance of the machine learning algorithm. Furthermore, they highlight the advantage of the improved optimal approximation set algorithm, which offers higher similarity to the target set and provides a more concise expression. [ABSTRACT FROM AUTHOR]

Deep Neural Networks (DNNs) are widely regarded as the most effective learning tool for dealing with large datasets, and they have been successfully used in thousands of applications in a variety of fields. Based on these large datasets, they are trained to learn the relationships between various variables. The adaptive moment estimation (Adam) algorithm, a highly efficient adaptive optimization algorithm, is widely used as a learning algorithm in various fields for training DNN models. However, it needs to improve its generalization performance, especially when training with large-scale datasets. Therefore, in this paper, we propose HN Adam, a modified version of the Adam Algorithm, to improve its accuracy and convergence speed. The HN_Adam algorithm is modified by automatically adjusting the step size of the parameter updates over the training epochs. This automatic adjustment is based on the norm value of the parameter update formula according to the gradient values obtained during the training epochs. Furthermore, a hybrid mechanism was created by combining the standard Adam algorithm and the AMSGrad algorithm. As a result of these changes, the HN_Adam algorithm, like the stochastic gradient descent (SGD) algorithm, has good generalization performance and achieves fast convergence like other adaptive algorithms. To test the proposed HN_Adam algorithm performance, it is evaluated to train a deep convolutional neural network (CNN) model that classifies images using two different standard datasets: MNIST and CIFAR-10. The algorithm results are compared to the basic Adam algorithm and the SGD algorithm, in addition to other five recent SGD adaptive algorithms. In most comparisons, the HN Adam algorithm outperforms the compared algorithms in terms of accuracy and convergence speed. AdaBelief is the most competitive of the compared algorithms. In terms of testing accuracy and convergence speed (represented by the consumed training time), the HN-Adam algorithm outperforms the AdaBelief algorithm by an improvement of 1.0% and 0.29% for the MNIST dataset, and 0.93% and 1.68% for the CIFAR-10 dataset, respectively. [ABSTRACT FROM AUTHOR]

The automatic calculation of sediment maps from hydroacoustic data is of great importance for habitat and sediment mapping as well as monitoring tasks. For this reason, numerous papers have been published that are based on a variety of algorithms and different kinds of input data. However, the current literature lacks comparative studies that investigate the performance of different approaches in depth. Therefore, this study aims to provide recommendations for suitable approaches for the automatic classification of side-scan sonar data that can be applied by agencies and researchers. With random forests, support vector machines, and convolutional neural networks, both traditional machine-learning methods and novel deep learning techniques have been implemented to evaluate their performance regarding the classification of backscatter data from two study sites located in the Sylt Outer Reef in the German Bight. Simple statistical values, textural features, and Weyl coefficients were calculated for different patch sizes as well as levels of quantization and then utilized in the machine-learning algorithms. It is found that large image patches of 32 px size and the combined use of different feature groups lead to the best classification performances. Further, the neural network and support vector machines generated visually more appealing sediment maps than random forests, despite scoring lower overall accuracy. Based on these findings, we recommend classifying side-scan sonar data with image patches of 32 px size and 6-bit quantization either directly in neural networks or with the combined use of multiple feature groups in support vector machines. [ABSTRACT FROM AUTHOR]

This paper proposes an e-diagnosis system based on machine learning (ML) algorithms to be implemented on the Internet of Medical Things (IoMT) environment, particularly for diagnosing diabetes mellitus (type 2 diabetes). However, the ML applications tend to be mistrusted because of their inability to show the internal decision-making process, resulting in slow uptake by end-users within certain healthcare sectors. This research delineates the use of three interpretable supervised ML models: Naïve Bayes classifier, random forest classifier, and J48 decision tree models to be trained and tested using the Pima Indians diabetes dataset in R programming language. The performance of each algorithm is analyzed to determine the one with the best accuracy, precision, sensitivity, and specificity. An assessment of the decision process is also made to improve the model. It can be concluded that a Naïve Bayes model works well with a more fine-tuned selection of features for binary classification, while random forest works better with more features. [ABSTRACT FROM AUTHOR]

In popular discussions, the nuances of AI are often abridged as "the algorithm", as the specific arrangements of machine learning (ML), deep learning (DL) and automated decision-making on social media platforms are typically shrouded in proprietary secrecy punctuated by press releases and transparency initiatives. What is clear, however, is that AI embedded on social media functions to recommend content, personalize ads, aggregate news stories, and moderate problematic material. It is also increasingly apparent that individuals are concerned with the uses, implications, and fairness of algorithmic systems. Perhaps in response to concerns about "the algorithm" by individuals and governments, social media platforms utilize transparency initiatives and official statements, in part, to deflect official regulation. In the following paper, I draw from transparency initiatives and statements from representatives of Facebook and TikTok as case studies of how AI is embedded in these platforms, with attention to the promotion of AI content moderation as a solution to the circulation of problematic material and misinformation. This examination considers the complexity of embedded AI as a material-discursive apparatus, predicated on discursive techniques—what is seeable, sayable, knowable in a given time period—as well as the material arrangements—algorithms, datasets, users, platforms, infrastructures, moderators, etc. As such, the use of AI as part of the immensely popular platforms Facebook and TikTok demonstrates that AI does not exist in isolation, instead functioning as human–machine ensemble reliant on strategies of acceptance via discursive techniques and the changing material arrangements of everyday embeddedness. [ABSTRACT FROM AUTHOR]

This paper mainly proposes some improved stochastic gradient descent (SGD) algorithms with a fractional order gradient for the online optimization problem. For three scenarios, including standard learning rate, adaptive gradient learning rate, and momentum learning rate, three new SGD algorithms are designed combining a fractional order gradient and it is shown that the corresponding regret functions are convergent at a sub-linear rate. Then we discuss the impact of the fractional order on the convergence and monotonicity and prove that the better performance can be obtained by adjusting the order of the fractional gradient. Finally, several practical examples are given to verify the superiority and validity of the proposed algorithm. [ABSTRACT FROM AUTHOR]

As a novel neural network learning framework, Twin Extreme Learning Machine (TELM) has received extensive attention and research in the field of machine learning. However, TELM is affected by noise or outliers in practical applications so that its generalization performance is reduced compared to robust learning algorithms. In this paper, we propose two novel distance metric optimization-driven robust twin extreme learning machine learning frameworks for pattern classification, namely, CWTELM and FCWTELM. By introducing the robust Welsch loss function and capped L 2 , p -distance metric, our methods reduce the effect of outliers and improve the generalization performance of the model compared to TELM. In addition, two efficient iterative algorithms are designed to solve the challenges brought by the non-convex optimization problems CWTELM and FCWTELM, and we theoretically guarantee their convergence, local optimality, and computational complexity. Then, the proposed algorithms are compared with five other classical algorithms under different noise and different datasets, and the statistical detection analysis is implemented. Finally, we conclude that our algorithm has excellent robustness and classification performance. [ABSTRACT FROM AUTHOR]

Relevant attribute selection in machine learning is a key aspect aimed at simplifying the problem, reducing its dimensionality, and consequently accelerating computation. This paper proposes new algorithms for selecting relevant features and evaluating and selecting a subset of relevant objects in a dataset. Both algorithms are mainly based on the use of a fuzzy approach. The research presented here yielded preliminary results of a new approach to the problem of selecting relevant attributes and objects and selecting appropriate ranges of their values. Detailed results obtained on the Sonar dataset show the positive effects of this approach. Moreover, the observed results may suggest the effectiveness of the proposed method in terms of identifying a subset of truly relevant attributes from among those identified by traditional feature selection methods. [ABSTRACT FROM AUTHOR]

This paper employs two data-driven methods, Random Forest (RF) and Support Vector Machines (SVM), to develop mineral prospectivity models for an epithermal Au deposit. Four distinct models are presented for comparison: one employing RF and three using SVM with different kernel functions—namely linear, Radial Basis Function (RBF), and polynomial. The analysis leverages a compact training dataset, encompassing just 20 deposits, with deposit and non-deposit locations chosen from known mineral occurrences. Fourteen predictor maps are constructed based on the available data and the exploration model. The findings indicate that RF is more stable and robust than SVM, regardless of the kernel function implemented. While all SVM models outperformed the RF model in terms of classification capability on the training dataset achieving an accuracy exceeding 89% versus 78% for the RF model, the success rate curves suggest superior predictive abilities of RF over SVM models. This implies that the SVM models may be overfitting the training data due to the limited quantity of training deposits. [ABSTRACT FROM AUTHOR]

Statistical machine learning usually achieves high-accuracy models by employing tens of thousands of examples. By contrast, both children and adult humans typically learn new concepts from either one or a small number of instances. The high data efficiency of human learning is not easily explained in terms of standard formal frameworks for machine learning, including Gold's learning-in-the-limit framework and Valiant's probably approximately correct (PAC) model. This paper explores ways in which this apparent disparity between human and machine learning can be reconciled by considering algorithms involving a preference for specificity combined with program minimality. It is shown how this can be efficiently enacted using hierarchical search based on identification of certificates and push-down automata to support hypothesizing compactly expressed maximal efficiency algorithms. Early results of a new system called DeepLog indicate that such approaches can support efficient top-down construction of relatively complex logic programs from a single example. This article is part of a discussion meeting issue 'Cognitive artificial intelligence'. [ABSTRACT FROM AUTHOR]

This paper presents the development of a novel algorithm for unsupervised learning called RUN-ICON (Reduce UNcertainty and Increase CONfidence). The primary objective of the algorithm is to enhance the reliability and confidence of unsupervised clustering. RUN-ICON leverages the K-means++ method to identify the most frequently occurring dominant centres through multiple repetitions. It distinguishes itself from existing K-means variants by introducing novel metrics, such as the Clustering Dominance Index and Uncertainty, instead of relying solely on the Sum of Squared Errors, for identifying the most dominant clusters. The algorithm exhibits notable characteristics such as robustness, high-quality clustering, automation, and flexibility. Extensive testing on diverse data sets with varying characteristics demonstrates its capability to determine the optimal number of clusters under different scenarios. The algorithm will soon be deployed in real-world scenarios, where it will undergo rigorous testing against data sets based on measurements and simulations, further proving its effectiveness. [ABSTRACT FROM AUTHOR]

In sports, advance sensing technologies generate massive amount of unstructured telemedicine data that need to be refined for accurate diagnosis of underlying diseases. For accurate prediction of diseases and classification of athletes' data, deep learning algorithms are frequently used at the cloud. However, the transmission of raw data of athletes to the cloud faces numerous challenges. Among them, security and privacy are a major challenge in view of the sensitive and personal information present within the unstructured data. In this paper, first we present a data block scrambling algorithm (without key management) for secured transmission and storage of ECG (electrocardiogram) data of table tennis players at the cloud. A small piece of original data stored at the cloud is used for scrambling the massive amount of remaining ECG data. The secured telemedicine data is then imported into Hadoop Distributed File System for data management, which is read by Spark framework to form Resilient Distributed Datasets. Finally, a deep learning approach is used that extracts useful features, learns the related information, and weights and sums the feature vectors at different layers for classification. Theoretical analysis proves that our proposed approach is highly robust and resilient to brute force attacks and at the same time has a much better accuracy, sensitivity, and specificity as compared to the existing approaches. [ABSTRACT FROM AUTHOR]

Electricity theft has caused massive losses and damage to electricity utilities. The damage affects the electricity supply's quality and increases the generation load. The losses happen not only for the electricity utilities but also affect the legitimate users who have to pay excessive electricity bills. That is why the method to detect electricity theft is indispensable. Recently, machine learning algorithms have been used to develop a model for detecting electricity theft. However, most algorithms have problems due to imbalanced data, overfitting issues, and lack of data. Therefore, this paper proposes a solution that implements the oversampling technique to address the problems and increase the developed model's accuracy. It is used to perform oversampling on the imbalanced dataset. Our proposed method consists of a pre-processing step to remove empty values and extract several parameters. After that, the oversampling technique is performed on the result of the pre-processing step. The logistic regression model combined with the oversampling techniques shows the best performance results on the developed model of electricity theft detection based on the state electricity company customers. The experiment shows that the proposed method, logistic regression combined with the synthetic minority oversampling technique, shows superior performance in terms of the accuracy of the training data and data testing, precision, recall, and F1-scores of 98.97%, 98.7%, 95%, 99%, and 97%, respectively. Moreover, the experiment also shows that the proposed solution outperforms existing methods. [ABSTRACT FROM AUTHOR]

INTRODUCTION: An improved Yolov7 model. OBJECTIVES: To solve the weed detection and identification in complex field background. METHODS: The dataset was enhanced by online data enhancement, in which the feature extraction, feature fusion and feature point judgment of weed image were carried out by Yolov7 to predict the weed situation corresponding to the prior box. In the enhanced feature extraction part of Yolov7, CBAM, an attention mechanism combining channel and space, is introduced to improve the attention of the algorithm to weeds and strengthen the characteristics of weeds. RESULTS: The mean average precision (mAP) of the improved algorithm reached 91.15%, which was 2.06% higher than that of the original Yolov7 algorithm. Compared with the current mainstream target detection algorithms Yolox, Yolov5l, Fster RCNN, Yolov4-tiny and Yolov3, the mAP value of the improved algorithm increased by 4.35, 4.51, 5.41, 19.77 and 20.65 percentage points. Weed species can be accurately identified when multiple weeds are adjacent. CONCLUSION: This paper provides a detection model based on Yolov7 for weed detection in the field, which has a good detection effect on weed detection, and lays a research foundation for intelligent weeding robot and spraying robot. [ABSTRACT FROM AUTHOR]

Orthogonal time frequency space (OTFS) is a new method technique that supports reliable information transmission in a strong Doppler environment. Aiming at the radar target parameter estimation problem of integration of radar and communication (IRC) based on OTFS, this paper proposes a two‐step radar target parameter estimation algorithm combining maximum likelihood (ML) estimation and gradient descent (GD) principle. Firstly, the echo signal of the OTFS integrated signal is constructed and based on this, the ML estimation model is constructed, and the alternating projection (AP) algorithm is employed to make a rough estimation of the target parameters. Then the rough estimation results of the AP‐ML algorithm are employed as the initial value of the GD algorithm for the fine parameter estimation. Simulation results show that the proposed algorithm has better target parameter estimation performance and resolution while reducing the computational complexity. [ABSTRACT FROM AUTHOR]