198 research outputs found
Presenting a New Strategy to Extract Data Clustering Heartbeat Samples by Using Discrete Wavelet Transform
This paper presents the improvement of detection system that normal and arrhythmia electrocardiogram classification. This classification is done to aid the ANFIS (Adaptive Neuro Fuzzy Inference System). The data used in this paper obtained from MIT-BIH normal sinus ECG database signal and MIT-BIH arrhythmia database signal. The main goal of our approach is to create an interpretable classifier that provides an acceptable accuracy. In this model, the feature extraction using DWT (Discrete Wavelet Transform) is obtained. The last stage of this extraction is introduced as the input of ANFIS model. In this paper, the ANFIS model has been trained with Quantum Behaved Particle Swarm Optimization (QPSO). In this study, for training of proposed model, four sample data have been used which result in acceleration of training data. On the test set, we achieved an outstanding sensitivity and accuracy 100%. Experimental results show that the proposed approach is very fast and accurate in improving classification. Using the proposed methodology and telemedicine technology can manage patient of heart disease
Chaotic Quantum Double Delta Swarm Algorithm using Chebyshev Maps: Theoretical Foundations, Performance Analyses and Convergence Issues
Quantum Double Delta Swarm (QDDS) Algorithm is a new metaheuristic algorithm
inspired by the convergence mechanism to the center of potential generated
within a single well of a spatially co-located double-delta well setup. It
mimics the wave nature of candidate positions in solution spaces and draws upon
quantum mechanical interpretations much like other quantum-inspired
computational intelligence paradigms. In this work, we introduce a Chebyshev
map driven chaotic perturbation in the optimization phase of the algorithm to
diversify weights placed on contemporary and historical, socially-optimal
agents' solutions. We follow this up with a characterization of solution
quality on a suite of 23 single-objective functions and carry out a comparative
analysis with eight other related nature-inspired approaches. By comparing
solution quality and successful runs over dynamic solution ranges, insights
about the nature of convergence are obtained. A two-tailed t-test establishes
the statistical significance of the solution data whereas Cohen's d and Hedge's
g values provide a measure of effect sizes. We trace the trajectory of the
fittest pseudo-agent over all function evaluations to comment on the dynamics
of the system and prove that the proposed algorithm is theoretically globally
convergent under the assumptions adopted for proofs of other closely-related
random search algorithms.Comment: 27 pages, 4 figures, 19 table
Current Studies and Applications of Krill Herd and Gravitational Search Algorithms in Healthcare
Nature-Inspired Computing or NIC for short is a relatively young field that
tries to discover fresh methods of computing by researching how natural
phenomena function to find solutions to complicated issues in many contexts. As
a consequence of this, ground-breaking research has been conducted in a variety
of domains, including synthetic immune functions, neural networks, the
intelligence of swarm, as well as computing of evolutionary. In the domains of
biology, physics, engineering, economics, and management, NIC techniques are
used. In real-world classification, optimization, forecasting, and clustering,
as well as engineering and science issues, meta-heuristics algorithms are
successful, efficient, and resilient. There are two active NIC patterns: the
gravitational search algorithm and the Krill herd algorithm. The study on using
the Krill Herd Algorithm (KH) and the Gravitational Search Algorithm (GSA) in
medicine and healthcare is given a worldwide and historical review in this
publication. Comprehensive surveys have been conducted on some other
nature-inspired algorithms, including KH and GSA. The various versions of the
KH and GSA algorithms and their applications in healthcare are thoroughly
reviewed in the present article. Nonetheless, no survey research on KH and GSA
in the healthcare field has been undertaken. As a result, this work conducts a
thorough review of KH and GSA to assist researchers in using them in diverse
domains or hybridizing them with other popular algorithms. It also provides an
in-depth examination of the KH and GSA in terms of application, modification,
and hybridization. It is important to note that the goal of the study is to
offer a viewpoint on GSA with KH, particularly for academics interested in
investigating the capabilities and performance of the algorithm in the
healthcare and medical domains.Comment: 35 page
Introductory Review of Swarm Intelligence Techniques
With the rapid upliftment of technology, there has emerged a dire need to
fine-tune or optimize certain processes, software, models or structures, with
utmost accuracy and efficiency. Optimization algorithms are preferred over
other methods of optimization through experimentation or simulation, for their
generic problem-solving abilities and promising efficacy with the least human
intervention. In recent times, the inducement of natural phenomena into
algorithm design has immensely triggered the efficiency of optimization process
for even complex multi-dimensional, non-continuous, non-differentiable and
noisy problem search spaces. This chapter deals with the Swarm intelligence
(SI) based algorithms or Swarm Optimization Algorithms, which are a subset of
the greater Nature Inspired Optimization Algorithms (NIOAs). Swarm intelligence
involves the collective study of individuals and their mutual interactions
leading to intelligent behavior of the swarm. The chapter presents various
population-based SI algorithms, their fundamental structures along with their
mathematical models.Comment: Submitted to Springe
Data-Driven Optimization of Public Transit Schedule
Bus transit systems are the backbone of public transportation in the United
States. An important indicator of the quality of service in such
infrastructures is on-time performance at stops, with published transit
schedules playing an integral role governing the level of success of the
service. However there are relatively few optimization architectures leveraging
stochastic search that focus on optimizing bus timetables with the objective of
maximizing probability of bus arrivals at timepoints with delays within desired
on-time ranges. In addition to this, there is a lack of substantial research
considering monthly and seasonal variations of delay patterns integrated with
such optimization strategies. To address these,this paper makes the following
contributions to the corpus of studies on transit on-time performance
optimization: (a) an unsupervised clustering mechanism is presented which
groups months with similar seasonal delay patterns, (b) the problem is
formulated as a single-objective optimization task and a greedy algorithm, a
genetic algorithm (GA) as well as a particle swarm optimization (PSO) algorithm
are employed to solve it, (c) a detailed discussion on empirical results
comparing the algorithms are provided and sensitivity analysis on
hyper-parameters of the heuristics are presented along with execution times,
which will help practitioners looking at similar problems. The analyses
conducted are insightful in the local context of improving public transit
scheduling in the Nashville metro region as well as informative from a global
perspective as an elaborate case study which builds upon the growing corpus of
empirical studies using nature-inspired approaches to transit schedule
optimization.Comment: 20 pages, 6 figures, 2 table
- …