Search results for "algorithm"
showing 10 items of 4887 documents
On the use of a metric-space search algorithm (AESA) for fast DTW-based recognition of isolated words
1988
The approximating and eliminating search algorithm (AESA) presented was recently introduced for finding nearest neighbors in metric spaces. Although the AESA was originally developed for reducing the time complexity of dynamic time-warping isolated word recognition (DTW-IWR), only rather limited experiments had been previously carried out to check its performance in this task. A set of experiments aimed at filling this gap is reported. The main results show that the important features reflected in previous simulation experiments are also true for real speech samples. With single-speaker dictionaries of up to 200 words, and for most of the different speech parameterizations, local metrics, a…
On the classification of dynamical data streams using novel “Anti-Bayesian” techniques
2018
Abstract The classification of dynamical data streams is among the most complex problems encountered in classification. This is, firstly, because the distribution of the data streams is non-stationary, and it changes without any prior “warning”. Secondly, the manner in which it changes is also unknown. Thirdly, and more interestingly, the model operates with the assumption that the correct classes of previously-classified patterns become available at a juncture after their appearance. This paper pioneers the use of unreported novel schemes that can classify such dynamical data streams by invoking the recently-introduced “Anti-Bayesian” (AB) techniques. Contrary to the Bayesian paradigm, tha…
Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
2012
Time series are proficiently converted into graphs via the horizontal visibility (HV) algorithm, which prompts interest in its capability for capturing the nature of different classes of series in a network context. We have recently shown [1] that dynamical systems can be studied from a novel perspective via the use of this method. Specifically, the period-doubling and band-splitting attractor cascades that characterize unimodal maps transform into families of graphs that turn out to be independent of map nonlinearity or other particulars. Here we provide an in depth description of the HV treatment of the Feigenbaum scenario, together with analytical derivations that relate to the degree di…
Feigenbaum graphs: a complex network perspective of chaos
2011
The recently formulated theory of horizontal visibility graphs transforms time series into graphs and allows the possibility of studying dynamical systems through the characterization of their associated networks. This method leads to a natural graph-theoretical description of nonlinear systems with qualities in the spirit of symbolic dynamics. We support our claim via the case study of the period-doubling and band-splitting attractor cascades that characterize unimodal maps. We provide a universal analytical description of this classic scenario in terms of the horizontal visibility graphs associated with the dynamics within the attractors, that we call Feigenbaum graphs, independent of map…
Feature selection for distance-based regression: An umbrella review and a one-shot wrapper
2023
Feature selection (FS) may improve the performance, cost-efficiency, and understandability of supervised machine learning models. In this paper, FS for the recently introduced distance-based supervised machine learning model is considered for regression problems. The study is contextualized by first providing an umbrella review (review of reviews) of recent development in the research field. We then propose a saliency-based one-shot wrapper algorithm for FS, which is called MAS-FS. The algorithm is compared with a set of other popular FS algorithms, using a versatile set of simulated and benchmark datasets. Finally, experimental results underline the usefulness of FS for regression, confirm…
Deadline-based QoS Algorithms for High-performance Networks
2007
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because it could allow a more efficient use of resources. Deadline-based algorithms can provide powerful QoS provision. However, the cost associated with keeping ordered lists of packets makes them impractical for high-performance networks. In this paper, we explore how to adapt efficiently the earliest deadline first family of algorithms to the high-speed networks environments. The results show excellent performance using just two virtual channels, FIFO queues, and a cost feasible with today's technology.
Latent force models for earth observation time series prediction
2016
We introduce latent force models for Earth observation time series analysis. The model uses Gaussian processes and differential equations to combine data driven modelling with a physical model of the system. The LFM presented here performs multi-output structured regression, adapts to the signal characteristics, it can cope with missing data in the time series, and provides explicit latent functions that allow system analysis and evaluation. We successfully illustrate the performance in challenging scenarios of crop monitoring from space, providing time-resolved time series predictions.
Nonlinear PCA for Spatio-Temporal Analysis of Earth Observation Data
2020
Remote sensing observations, products, and simulations are fundamental sources of information to monitor our planet and its climate variability. Uncovering the main modes of spatial and temporal variability in Earth data is essential to analyze and understand the underlying physical dynamics and processes driving the Earth System. Dimensionality reduction methods can work with spatio-temporal data sets and decompose the information efficiently. Principal component analysis (PCA), also known as empirical orthogonal functions (EOFs) in geophysics, has been traditionally used to analyze climatic data. However, when nonlinear feature relations are present, PCA/EOF fails. In this article, we pro…
Gradient-Based Automatic Lookup Table Generator for Radiative Transfer Models
2022
Physically based radiative transfer models (RTMs) are widely used in Earth observation to understand the radiation processes occurring on the Earth’s surface and their interactions with water, vegetation, and atmosphere. Through continuous improvements, RTMs have increased in accuracy and representativity of complex scenes at expenses of an increase in complexity and computation time, making them impractical in various remote sensing applications. To overcome this limitation, the common practice is to precompute large lookup tables (LUTs) for their later interpolation. To further reduce the RTM computation burden and the error in LUT interpolation, we have developed a method to automaticall…
Niche filling slows the diversification of Himalayan songbirds.
2013
In Himalayan songbirds, the speciation rate is ultimately set by ecological competition, rather than by the rate of acquisition of reproductive isolation. The beginnings of adaptive radiation and speciation have been widely studied — in Darwin's finches, sticklebacks and cichlid fish, for example — but relatively little is known about what happens next. Specifically, what is the rate-limiting step for the establishment of new species? This seven-year study of the 358 songbird species found on the Himalayan slopes suggests that it is the rates at which new niches are created and occupied that limits diversification, not the rate at which new species form through reproductive isolation. Speci…