Search

The current work proposes the incorporation of an artificial neural network to solve the Gross–Pitaevskii equation (GPE) efficiently, using a few realistic external potentials. With the assistance of neural networks, a model is formed that is capable of solving this equation. The adaptation of the parameters for the constructed model is performed using some evolutionary techniques, such as genetic algorithms and particle swarm optimization. The proposed model is used to solve the GPE for the linear case ( γ = 0 ) and the nonlinear case ( γ ≠ 0 ), where γ is the nonlinearity parameter in GPE. The results are close to the reported results regarding the behavior and the amplitudes of the wavefunctions. [ABSTRACT FROM AUTHOR]

The presented work outlines a new genetic crossover operator, which can be used to solve problems by the Grammatical Evolution technique. This new operator intensively applies the one-point crossover procedure to randomly selected chromosomes with the aim of drastically reducing their fitness value. The new operator is applied to chromosomes selected randomly from the genetic population. This new operator was applied to two techniques from the recent literature that exploit Grammatical Evolution: artificial neural network construction and rule construction. In both case studies, an extensive set of classification problems and data-fitting problems were incorporated to estimate the effectiveness of the proposed genetic operator. The proposed operator significantly reduced both the classification error on the classification datasets and the feature learning error on the fitting datasets compared to other machine learning techniques and also to the original models before applying the new operator. [ABSTRACT FROM AUTHOR]

Constructed neural networks with the assistance of grammatical evolution have been widely used in a series of classification and data-fitting problems recently. Application areas of this innovative machine learning technique include solving differential equations, autism screening, and measuring motor function in Parkinson's disease. Although this technique has given excellent results, in many cases, it is trapped in local minimum and cannot perform satisfactorily in many problems. For this purpose, it is considered necessary to find techniques to avoid local minima, and one technique is the periodic application of local minimization techniques that will adjust the parameters of the constructed artificial neural network while maintaining the already existing architecture created by grammatical evolution. The periodic application of local minimization techniques has shown a significant reduction in both classification and data-fitting problems found in the relevant literature. [ABSTRACT FROM AUTHOR]

Global optimization is used in many practical and scientific problems. For this reason, various computational techniques have been developed. Particularly important are the evolutionary techniques, which simulate natural phenomena with the aim of detecting the global minimum in complex problems. A new evolutionary method is the Eel and Grouper Optimization (EGO) algorithm, inspired by the symbiotic relationship and foraging strategy of eels and groupers in marine ecosystems. In the present work, a series of improvements are proposed that aim both at the efficiency of the algorithm to discover the total minimum of multidimensional functions and at the reduction in the required execution time through the effective reduction in the number of functional evaluations. These modifications include the incorporation of a stochastic termination technique as well as an improvement sampling technique. The proposed modifications are tested on multidimensional functions available from the relevant literature and compared with other evolutionary methods. [ABSTRACT FROM AUTHOR]

Parallel optimization enables faster and more efficient problem-solving by reducing computational resource consumption and time. By simultaneously combining multiple methods, such as evolutionary algorithms and swarm-based optimization, effective exploration of the search space and achievement of optimal solutions in shorter time frames are realized. In this study, a combination of termination criteria is proposed, utilizing three different criteria to end the algorithmic process. These criteria include measuring the difference between optimal values in successive iterations, calculating the mean value of the cost function in each iteration, and the so-called "DoubleBox" criterion, which is based on the relative variance of the best value of the objective cost function over a specific number of iterations. The problem is addressed through the parallel execution of three different optimization methods (PSO, Differential Evolution, and Multistart). Each method operates independently on separate computational units with the goal of faster discovery of the optimal solution and more efficient use of computational resources. The optimal solution identified in each iteration is transferred to the other computational units. The proposed enhancements were tested on a series of well-known optimization problems from the relevant literature, demonstrating significant improvements in convergence speed and solution quality compared to traditional approaches. [ABSTRACT FROM AUTHOR]

In this paper, an innovative hybrid technique is proposed for the efficient training of artificial neural networks, which are used both in class learning problems and in data fitting problems. This hybrid technique combines the well-tested technique of Genetic Algorithms with an innovative variant of Simulated Annealing, in order to achieve high learning rates for the neural networks. This variant was applied periodically to randomly selected chromosomes from the population of the Genetic Algorithm in order to reduce the training error associated with these chromosomes. The proposed method was tested on a wide series of classification and data fitting problems from the relevant literature and the results were compared against other methods. The comparison with other neural network training techniques as well as the statistical comparison revealed that the proposed method is significantly superior, as it managed to significantly reduce the neural network training error in the majority of the used datasets. [ABSTRACT FROM AUTHOR]

The classification of Software-Defined Networking (SDN) traffic is an essential tool for network management, network monitoring, traffic engineering, dynamic resource allocation planning, and applying Quality of Service (QoS) policies. The programmability nature of SDN, the holistic view of the network through SDN controllers, and the capability for dynamic adjustable and reconfigurable controllersare fertile ground for the development of new techniques for traffic classification. Although there are enough research works that have studied traffic classification methods in SDN environments, they have several shortcomings and gaps that need to be further investigated. In this study, we investigated traffic classification methods in SDN using publicly available SDN traffic trace datasets. We apply a series of classifiers, such as MLP (BFGS), FC2 (RBF), FC2 (MLP), Decision Tree, SVM, and GENCLASS, and evaluate their performance in terms of accuracy, detection rate, and precision. Of the methods used, GenClass appears to be more accurate in separating the categories of the problem than the rest, and this is reflected in both precision and recall. The key element of the GenClass method is that it can generate classification rules programmatically and detect the hidden associations that exist between the problem features and the desired classes. However, Genetic Programming-based techniques require significantly higher execution time compared to other machine learning techniques. This is most evident in the feature construction method where at each generation of the genetic algorithm, a set of learning models is required to be trained to evaluate the generated artificial features. [ABSTRACT FROM AUTHOR]

The problem of finding the global minimum of a function is applicable to a multitude of real-world problems and, hence, a variety of computational techniques have been developed to efficiently locate it. Among these techniques, evolutionary techniques, which seek, through the imitation of natural processes, to efficiently obtain the global minimum of multidimensional functions, play a central role. An evolutionary technique that has recently been introduced is the Optimal Foraging Algorithm, which is a swarm-based algorithm, and it is notable for its reliability in locating the global minimum. In this work, a series of modifications are proposed that aim to improve the reliability and speed of the above technique, such as a termination technique based on stochastic observations, an innovative sampling method and a technique to improve the generation of offspring. The new method was tested on a series of problems from the relevant literature and a comparative study was conducted against other global optimization techniques with promising results. [ABSTRACT FROM AUTHOR]

The topic of efficiently finding the global minimum of multidimensional functions is widely applicable to numerous problems in the modern world. Many algorithms have been proposed to address these problems, among which genetic algorithms and their variants are particularly notable. Their popularity is due to their exceptional performance in solving optimization problems and their adaptability to various types of problems. However, genetic algorithms require significant computational resources and time, prompting the need for parallel techniques. Moving in this research direction, a new global optimization method is presented here that exploits the use of parallel computing techniques in genetic algorithms. This innovative method employs autonomous parallel computing units that periodically share the optimal solutions they discover. Increasing the number of computational threads, coupled with solution exchange techniques, can significantly reduce the number of calls to the objective function, thus saving computational power. Also, a stopping rule is proposed that takes advantage of the parallel computational environment. The proposed method was tested on a broad array of benchmark functions from the relevant literature and compared with other global optimization techniques regarding its efficiency. [ABSTRACT FROM AUTHOR]

The Grammatical Evolution technique has been successfully applied to a wide range of problems in various scientific fields. However, in many cases, techniques that make use of Grammatical Evolution become trapped in local minima of the objective problem and fail to reach the optimal solution. One simple method to tackle such situations is the usage of hybrid techniques, where local minimization algorithms are used in conjunction with the main algorithm. However, Grammatical Evolution is an integer optimization problem and, as a consequence, techniques should be formulated that are applicable to it as well. In the current work, a modified version of the Simulated Annealing algorithm is used as a local optimization procedure in Grammatical Evolution. This approach was tested on the Constructed Neural Networks and a remarkable improvement of the experimental results was shown, both in classification data and in data fitting cases. [ABSTRACT FROM AUTHOR]

Autism Spectrum Disorder is known to cause difficulties in social interaction and communication, as well as repetitive patterns of behavior, interests, or hobbies. These challenges can significantly affect the individual's daily life. Therefore, it is crucial to identify and assess children with Autism Spectrum Disorder early to significantly benefit the long-term health of children. Unfortunately, many children are not diagnosed or are misdiagnosed, which means they miss out on the necessary interventions. Clinicians and other experts face various challenges during the diagnostic process. Digital tools can facilitate early diagnosis effectively. This study aimed to explore the use of machine learning techniques on a dataset collected from a serious game designed for children with autism to investigate how these techniques can assist in classification and make the clinical process more efficient. The responses were gathered from children who participated in interactive games deployed on mobile devices, and the data were analyzed using various types of neural networks, such as multilayer perceptrons and constructed neural networks. The performance metrics of these models, including error rate, precision, and recall, were reported, and the comparative experiments revealed that the constructed neural network using the integer rule-based neural networks approach was superior. Based on the evaluation metrics, this method showed the lowest error rate of 11.77%, a high accuracy of 0.75, and a good recall of 0.66. Thus, it can be an effective way to classify both typically developed children and children with Autism Spectrum Disorder. Additionally, it can be used for automatic screening procedures in an intelligent system. The results indicate that clinicians could use these techniques to enhance conventional screening methods and contribute to providing better care for individuals with autism. [ABSTRACT FROM AUTHOR]

Featured Application: This study is part of an ongoing research project titled "Smart Computing Models, Sensors, and Early diagnostic speech and language deficiencies indicators in Child Communication", with the acronym "SmartSpeech". The SmartSpeech project aims to assist clinicians in decision making regarding early diagnosis for children with neurodevelopmental disorders. SmartSpeech employs a serious game designed explicitly by the interdisciplinary team for this project, with activities aiming to evaluate the child's developmental profile. The game is implemented in a tablet application and utilizes voice, and biomarkers of heart rate and gaze, for additional physiological measurements. A back-end system supports user registration, data collection, data analysis, and decision making. The potential application of this work is to allow the SmartSpeech machine learning model to better capture underlying patterns in the data, determine the most effective feature construction techniques for the given problem, and employ the results of this study to enhance the screening automated prediction results of the machine learning model in neurodevelopmental disorders. Developmental domains refer to different areas of a child's growth and maturation, including physical, language, cognitive, and social–emotional skills. Understanding these domains helps parents, caregivers, and professionals track a child's progress and identify potential areas of concern. Nevertheless, due to the high level of heterogeneity and overlap, neurodevelopmental disorders may go undiagnosed in children for a crucial period. Detecting neurodevelopmental disorders at an early stage is fundamental. Digital tools like artificial intelligence can help clinicians with the early detection process. To achieve this, a new method has been proposed that creates artificial features from the original ones derived from the SmartSpeech project, using a feature construction procedure guided by the Grammatical Evolution technique. The new features from a machine learning model are used to predict neurodevelopmental disorders. Comparative experiments demonstrated that using the feature creation method outperformed other machine learning methods for predicting neurodevelopmental disorders. In many cases, the reduction in the test error reaches up to 65% to the next better one. [ABSTRACT FROM AUTHOR]

This document is a special issue of the journal "Algorithms" focused on algorithms in data classification. It provides an overview of different subcategories of data classification, such as binary classification, multi-class classification, and text classification. The issue includes twelve papers that cover a wide range of applications, including class imbalance in Gaussian mixture models, blood cell classification using deep learning techniques, student dropout prediction in online education, and energy consumption in industrial plants. Other topics covered include the use of artificial intelligence models for rehabilitation guidance, hyperparameter optimization of artificial neural networks, feature selection in big data classification, and the classification of acute psychological stress and physical activity using wristband devices. The issue also includes specialized software for data classification and the use of artificial intelligence models for intelligent wear monitoring. [Extracted from the article]

The problem of data classification or data fitting is widely applicable in a multitude of scientific areas, and for this reason, a number of machine learning models have been developed. However, in many cases, these models present problems of overfitting and cannot generalize satisfactorily to unknown data. Furthermore, in many cases, many of the features of the input data do not contribute to learning, or there may even be hidden correlations between the features of the dataset. The purpose of the proposed method is to significantly reduce data classification or regression errors through the usage of a technique that utilizes the particle swarm optimization method and grammatical evolution. This method is divided into two phases. In the first phase, artificial features are constructed using grammatical evolution, and the progress of the creation of these features is controlled by the particle swarm optimization method. In addition, this new technique utilizes penalty factors to limit the generated features to a range of values to make training machine learning models more efficient. In the second phase of the proposed technique, these features are exploited to transform the original dataset, and then any machine learning method can be applied to this dataset. The performance of the proposed method was measured on some benchmark datasets from the relevant literature. Also, the method was tested against a series of widely used machine learning models. The experiments performed showed a significant improvement of 30% on average in the classification datasets and an even greater improvement of 60% in the data fitting datasets. [ABSTRACT FROM AUTHOR]