832 research outputs found
Recommended from our members
Ensemble learning of model hyperparameters and spatiotemporal data for calibration of low-cost PM2.5 sensors.
he PM2.5 air quality index (AQI) measurements from government-built supersites are accurate but cannot provide a dense coverage of monitoring areas. Low-cost PM2.5 sensors can be used to deploy a fine-grained internet-of-things (IoT) as a complement to government facilities. Calibration of low-cost sensors by reference to high-accuracy supersites is thus essential. Moreover, the imputation for missing-value in training data may affect the calibration result, the best performance of calibration model requires hyperparameter optimization, and the affecting factors of PM2.5 concentrations such as climate, geographical landscapes and anthropogenic activities are uncertain in spatial and temporal dimensions. In this paper, an ensemble learning for imputation method selection, calibration model hyperparameterization, and spatiotemporal training data composition is proposed. Three government supersites are chosen in central Taiwan for the deployment of low-cost sensors and hourly PM2.5 measurements are collected for 60 days for conducting experiments. Three optimizers, Sobol sequence, Nelder and Meads, and particle swarm optimization (PSO), are compared for evaluating their performances with various versions of ensembles. The best calibration results are obtained by using PSO, and the improvement ratios with respect to R2, RMSE, and NME, are 4.92%, 52.96%, and 56.85%, respectively
Nature-inspired Cuckoo Search Algorithm for Side Lobe Suppression in a Symmetric Linear Antenna Array
In this paper, we proposed a newly modified cuckoo search (MCS) algorithm integrated with the Roulette wheel selection operator and the inertia weight controlling the search ability towards synthesizing symmetric linear array geometry with minimum side lobe level (SLL) and/or nulls control. The basic cuckoo search (CS) algorithm is primarily based on the natural obligate brood parasitic behavior of some cuckoo species in combination with the Levy flight behavior of some birds and fruit flies. The CS metaheuristic approach is straightforward and capable of solving effectively general N-dimensional, linear and nonlinear optimization problems. The array geometry synthesis is first formulated as an optimization problem with the goal of SLL suppression and/or null prescribed placement in certain directions, and then solved by the newly MCS algorithm for the optimum element or isotropic radiator locations in the azimuth-plane or xy-plane. The study also focuses on the four internal parameters of MCS algorithm specifically on their implicit effects in the array synthesis. The optimal inter-element spacing solutions obtained by the MCS-optimizer are validated through comparisons with the standard CS-optimizer and the conventional array within the uniform and the Dolph-Chebyshev envelope patterns using MATLABTM. Finally, we also compared the fine-tuned MCS algorithm with two popular evolutionary algorithm (EA) techniques include particle swarm optimization (PSO) and genetic algorithms (GA)
Uncovering the social interaction network in swarm intelligence algorithms
This is the final version. Available from the publisher via the DOI in this record.Swarm intelligence is the collective behavior emerging in systems with locally interacting components. Because of their self-organization capabilities, swarm-based systems show essential properties for handling real-world problems, such as robustness, scalability, and flexibility. Yet, we fail to understand why swarm-based algorithms work well, and neither can we compare the various approaches in the literature. The absence of a common framework capable of characterizing these several swarm-based algorithms, transcending their particularities, has led to a stream of publications inspired by different aspects of nature without a systematic comparison over existing approaches. Here we address this gap by introducing a network-based framework—the swarm interaction network—to examine computational swarm-based systems via the optics of the social dynamics. We investigate the structure of social interaction in four swarm-based algorithms, showing that our approach enables researchers to study distinct algorithms from a common viewpoint. We also provide an in-depth case study of the Particle Swarm Optimization, revealing that different communication schemes tune the social interaction in the swarm, controlling the swarm search mode. With the swarm interaction network, researchers can study swarm algorithms as systems, removing the algorithm particularities from the analyses while focusing on the structure of the swarm social interaction
Iterated filtering methods for Markov process epidemic models
Dynamic epidemic models have proven valuable for public health decision
makers as they provide useful insights into the understanding and prevention of
infectious diseases. However, inference for these types of models can be
difficult because the disease spread is typically only partially observed e.g.
in form of reported incidences in given time periods. This chapter discusses
how to perform likelihood-based inference for partially observed Markov
epidemic models when it is relatively easy to generate samples from the Markov
transmission model while the likelihood function is intractable. The first part
of the chapter reviews the theoretical background of inference for partially
observed Markov processes (POMP) via iterated filtering. In the second part of
the chapter the performance of the method and associated practical difficulties
are illustrated on two examples. In the first example a simulated outbreak data
set consisting of the number of newly reported cases aggregated by week is
fitted to a POMP where the underlying disease transmission model is assumed to
be a simple Markovian SIR model. The second example illustrates possible model
extensions such as seasonal forcing and over-dispersion in both, the
transmission and observation model, which can be used, e.g., when analysing
routinely collected rotavirus surveillance data. Both examples are implemented
using the R-package pomp (King et al., 2016) and the code is made available
online.Comment: This manuscript is a preprint of a chapter to appear in the Handbook
of Infectious Disease Data Analysis, Held, L., Hens, N., O'Neill, P.D. and
Wallinga, J. (Eds.). Chapman \& Hall/CRC, 2018. Please use the book for
possible citations. Corrected typo in the references and modified second
exampl
- …