Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
19,119
result(s) for
"Computer algorithms Evaluation."
Sort by:
Evaluating learning algorithms : a classification perspective
This text offers a solid basis for conducting performance evaluations of learning algorithms in practical settings with an emphasis on classification algorithms.
Book
Nature inspired optimization algorithms or simply variations of metaheuristics?
In the last decade, we observe an increasing number of nature-inspired optimization algorithms, with authors often claiming their novelty and their capabilities of acting as powerful optimization techniques. However, a considerable number of these algorithms do not seem to draw inspiration from nature or to incorporate successful tactics, laws, or practices existing in natural systems, while also some of them have never been applied in any optimization field, since their first appearance in literature. This paper presents some interesting findings that have emerged after the extensive study of most of the existing nature-inspired algorithms. The need for irrationally introducing new nature inspired intelligent (NII) algorithms in literature is also questioned and possible drawbacks of NII algorithms met in literature are discussed. In addition, guidelines for the development of new nature-inspired algorithms are proposed, in an attempt to limit the misleading appearance of variation of metaheuristics as nature inspired optimization algorithms.
Journal Article
Veracity of big data : machine learning and other approaches to verifying truthfulness
Examine the problem of maintaining the quality of big data and discover novel solutions. You will learn the four V's of big data, including veracity, and study the problem from various angles. The solutions discussed are drawn from diverse areas of engineering and math, including machine learning, statistics, formal methods, and the Blockchain technology. Veracity of Big Data serves as an introduction to machine learning algorithms and diverse techniques such as the Kalman filter, SPRT, CUSUM, fuzzy logic, and Blockchain, showing how they can be used to solve problems in the veracity domain. Using examples, the math behind the techniques is explained in easy-to-understand language. Determining the truth of big data in real-world applications involves using various tools to analyze the available information. This book delves into some of the techniques that can be used. Microblogging websites such as Twitter have played a major role in public life, including during presidential elections. The book uses examples of microblogs posted on a particular topic to demonstrate how veracity can be examined and established. Some of the techniques are described in the context of detecting veiled attacks on microblogging websites to influence public opinion. -- Back cover.
Book
A self-adaptive artificial bee colony algorithm based on global best for global optimization
Intelligent optimization algorithms based on evolutionary and swarm principles have been widely researched in recent years. The artificial bee colony (ABC) algorithm is an intelligent swarm algorithm for global optimization problems. Previous studies have shown that the ABC algorithm is an efficient, effective, and robust optimization method. However, the solution search equation used in ABC is insufficient, and the strategy for generating candidate solutions results in good exploration ability but poor exploitation performance. Although some complex strategies for generating candidate solutions have recently been developed, the universality and robustness of these new algorithms are still insufficient. This is mainly because only one strategy is adopted in the modified ABC algorithm. In this paper, we propose a self-adaptive ABC algorithm based on the global best candidate (SABC-GB) for global optimization. Experiments are conducted on a set of 25 benchmark functions. To ensure a fair comparison with other algorithms, we employ the same initial population for all algorithms on each benchmark function. Besides, to validate the feasibility of SABC-GB in real-world application, we demonstrate its application to a real clustering problem based on the
K
-means technique. The results demonstrate that SABC-GB is superior to the other algorithms for solving complex optimization problems. It means that it is a new technique to improve the ABC by introducing self-adaptive mechanism.
Journal Article
Catch fish optimization algorithm: a new human behavior algorithm for solving clustering problems
This paper is inspired by traditional rural fishing methods and proposes a new metaheuristic optimization algorithm based on human behavior: Catch Fish Optimization Algorithm (CFOA). This algorithm simulates the process of rural fishermen fishing in ponds, which is mainly divided into two phases: the exploration phase and the exploitation phase. In the exploration phase, there are two stages to search: first, the individual capture stage based on personal experience and intuition, and second, the group capture stage based on human proficiency in using tools and collaboration. Transition from independent search to group capture during the exploration phase. Exploitation phase: All fishermen will surround the shoal of fish and work together to salvage the remaining fish, a collective capture strategy. CFOA model is based on these two phases. This paper tested the optimization performance of CFOA using IEEE CEC 2014 and IEEE CEC 2020 test functions, and compared it with 11 other optimization algorithms. We employed the IEEE CEC2017 function to evaluate the overall performance of CFOA. The experimental results indicate that CFOA exhibits excellent and stable optimization capabilities overall. Additionally, we applied CFOA to data clustering problems, and the final results demonstrate that CFOA’s overall error rate in processing clustering problems is less than 20%, resulting in a better clustering effect. The comprehensive experimental results show that CFOA exhibits excellent optimization effects when facing different optimization problems. CFOA code is open at
https://github.com/Meky-1210/CFOA.git
.
Journal Article
MOTChallenge: A Benchmark for Single-Camera Multiple Target Tracking
Standardized benchmarks have been crucial in pushing the performance of computer vision algorithms, especially since the advent of deep learning. Although leaderboards should not be over-claimed, they often provide the most objective measure of performance and are therefore important guides for research. We present MOTChallenge, a benchmark for single-camera Multiple Object Tracking (MOT) launched in late 2014, to collect existing and new data and create a framework for the standardized evaluation of multiple object tracking methods. The benchmark is focused on multiple people tracking, since pedestrians are by far the most studied object in the tracking community, with applications ranging from robot navigation to self-driving cars. This paper collects the first three releases of the benchmark: (i) MOT15, along with numerous state-of-the-art results that were submitted in the last years, (ii) MOT16, which contains new challenging videos, and (iii) MOT17, that extends MOT16 sequences with more precise labels and evaluates tracking performance on three different object detectors. The second and third release not only offers a significant increase in the number of labeled boxes, but also provide labels for multiple object classes beside pedestrians, as well as the level of visibility for every single object of interest. We finally provide a categorization of state-of-the-art trackers and a broad error analysis. This will help newcomers understand the related work and research trends in the MOT community, and hopefully shed some light into potential future research directions.
Journal Article
LaSOT: A High-quality Large-scale Single Object Tracking Benchmark
Despite great recent advances in visual tracking, its further development, including both algorithm design and evaluation, is limited due to lack of dedicated large-scale benchmarks. To address this problem, we present LaSOT, a high-quality Large-scale Single Object Tracking benchmark. LaSOT contains a diverse selection of 85 object classes, and offers 1550 totaling more than 3.87 million frames. Each video frame is carefully and manually annotated with a bounding box. This makes LaSOT, to our knowledge, the largest densely annotated tracking benchmark. Our goal in releasing LaSOT is to provide a dedicated high quality platform for both training and evaluation of trackers. The average video length of LaSOT is around 2500 frames, where each video contains various challenge factors that exist in real world video footage,such as the targets disappearing and re-appearing. These longer video lengths allow for the assessment of long-term trackers. To take advantage of the close connection between visual appearance and natural language, we provide language specification for each video in LaSOT. We believe such additions will allow for future research to use linguistic features to improve tracking. Two protocols, full-overlap and one-shot, are designated for flexible assessment of trackers. We extensively evaluate 48 baseline trackers on LaSOT with in-depth analysis, and results reveal that there still exists significant room for improvement. The complete benchmark, tracking results as well as analysis are available at http://vision.cs.stonybrook.edu/~lasot/.
Journal Article
Pied kingfisher optimizer: a new bio-inspired algorithm for solving numerical optimization and industrial engineering problems
In this study, we introduce the pied kingfisher optimizer (PKO), a novel swarm-based meta-heuristic algorithm that draws inspiration from the distinctive hunting behavior and symbiotic relationships observed in pied kingfishers in the natural world. The PKO algorithm is structured around three distinct phases: perching/hovering for prey (exploration/diversification), diving for prey (exploitation/intensification), and fostering symbiotic relations. These behavioral aspects are translated into mathematical models capable of effectively addressing a wide array of optimization challenges across diverse search spaces. The algorithm’s performance is rigorously evaluated across thirty-nine test functions, which encompass various unimodal, multimodal, composite, and hybrid ones. Additionally, eight real-world engineering optimization problems, including both constrained and unconstrained scenarios, are considered in the assessment. To gauge PKO’s efficacy, it is subjected to a comparative analysis against 3 categories of rival optimizers. The 1st category comprises well-established and widely-cited optimizers such as particle swarm optimization and genetic algorithm. The 2nd category encompasses recently published algorithms, including Harris Hawks optimization, Whale optimization algorithm, sine cosine algorithm, Grey Wolf optimizer, gravitational search algorithm, and moth-flame optimization. The 3rd category includes advanced algorithms, such as covariance matrix adaptation evolution strategy and Ensemble Sinusoidal Differential Covariance Matrix Adaptation with Euclidean Neighborhood (LSHADE-cnEpSin). The comparative analysis employs various performance metrics, including the Friedman mean rank and the Wilcoxon rank-sum test, to reveal PKO’s effectiveness and efficiency. The overall results highlight PKO’s exceptional ability to tackle intricate optimization problems characterized by challenging search spaces. PKO demonstrates superior exploration and exploitation tendencies while effectively avoiding local optima. The source code for the PKO algorithm is publicly accessible at
https://www.mathworks.com/matlabcentral/fileexchange/160043-pied-kingfisher-optimizer-pko
.
Journal Article
Particle swarm optimization algorithm: an overview
Particle swarm optimization (PSO) is a population-based stochastic optimization algorithm motivated by intelligent collective behavior of some animals such as flocks of birds or schools of fish. Since presented in 1995, it has experienced a multitude of enhancements. As researchers have learned about the technique, they derived new versions aiming to different demands, developed new applications in a host of areas, published theoretical studies of the effects of the various parameters and proposed many variants of the algorithm. This paper introduces its origin and background and carries out the theory analysis of the PSO. Then, we analyze its present situation of research and application in algorithm structure, parameter selection, topology structure, discrete PSO algorithm and parallel PSO algorithm, multi-objective optimization PSO and its engineering applications. Finally, the existing problems are analyzed and future research directions are presented.
Journal Article
Artificial neural networks training algorithm integrating invasive weed optimization with differential evolutionary model
Artificial intelligence techniques are excessively used in computing for training, forecasting and evaluation purposes. Among these techniques, artificial neural network (ANN) is widely used for developing prediction models. ANNs use various Meta-heuristic algorithms including approximation methods for training the neural networks. ANN plays a significant role in this area and can be helpful in determining the neural network input coefficient. The main goal of presented study is to train the neural network using meta-heuristic approaches and to enhance the perceptron neural network precision. In this article, we used an integrated algorithm to determine the neural network input coefficients. Later, the proposed algorithm was compared with other algorithms such as ant colony and invasive weed optimization for performance evaluation. The results reveal that the proposed algorithm results in more convergence with neural network coefficient as compared to existing algorithms. However the proposed method resulted in reduction of prediction error in the neural network.
Journal Article