Browsing Data Science (DS) by Title
Now showing items 4665 of 158

Early classification of time series by simultaneously optimizing the accuracy and earliness
(IEEE Transactions on Neural Networks and Learning Systems, 201710)The problem of early classi cation of time series appears naturally in contexts where the data, of temporal nature, is collected over time, and early class predictions are interesting or even required. The objective is to ... 
Early classification of time series using multiobjective optimization techniques
(Information Sciences, 20190423)In early classification of time series the objective is to build models which are able to make classpredictions for time series as accurately and as early as possible, when only a part of the series is available. It is ... 
Effect of trampling and digging from shell shing on Zostera noltei (Zosteraceae) intertidal seagrass beds
(Scientia Marina, 201703)Seagrass beds are among the most valuable ecosystems in the world but they are also among the ones most affected by human activities, and they have decreased significantly in recent decades. In many areas, such as in the ... 
Effect of various dietary regimens on oral challenge with Mycobacterium avium subsp. paratuberculosis in a rabbit model
(Research in Veterinary Science, 20151231)Rabbits are susceptible to infection by Mycobacterium avium subspecies paratuberculosis (MAP) in both wildlife and experimental conditions. Under the hypotheses that nutrient balance might influence the establishment of ... 
Effects of reducing VMs management times on elastic applications
(Journal of Grid Computing, 201805)Cloud infrastructures provide computing resources to applications in the form of Virtual Machines (VMs). Many applications deployed in cloud resources have an elastic behavior, that is, they change the number of servers ... 
Efficiency of simulation in monotone hyperstable queueing networks
(Queueing Systems, 20141231)We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficiency of sampling from their stationary distribution. In the context of exact sampling, the monotonicity structure of JQNs ... 
Efficient approximation of probability distributions with korder decomposable models
(International Journal of Approximate Reasoning, 20160101)During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models. Some of these algorithms can be used to search for a maximum likelihood decomposable ... 
Efficient approximation of probability distributions with korder decomposable models
(International Journal of Approximate Reasoning, 201607)During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models. Some of these algorithms can be used to search for a maximum likelihood decomposable ... 
An efficient approximation to the Kmeans clustering for Massive Data
(KnowledgeBased Systems, 20160628)Due to the progressive growth of the amount of data available in a wide variety of scientific fields, it has become more difficult to manipulate and analyze such information. In spite of its dependency on the initial ... 
An efficient approximation to the Kmeans clustering for Massive Data
(KnowledgeBased Systems, 20170201)Due to the progressive growth of the amount of data available in a wide variety of scientific fields, it has become more difficult to manipulate and analyze such information. In spite of its dependency on the initial ... 
An efficient evolutionary algorithm for the orienteering problem
(Computers and Operations Research, 20170906)This paper deals with the Orienteering Problem, which is a routing problem. In the Orienteering Problem, each node has a profit assigned and the goal is to find the route that maximizes the total collected profit subject ... 
Energyaware capacity scaling in virtualized environments with performance guarantees
(Performance Evaluation, 20111231)We investigate the tradeoff between performance and power consumption in servers hosting virtual machines running IT services. The performance behavior of such servers is modeled through Generalized Processor Sharing (GPS) ... 
Ergodic transition in a simple model of the continuous double auction
(PLoS ONE, 20141231)We study a phenomenological model for the continuous double auction, whose aggregate order process is equivalent to two independent M/M/1 queues. The continuous double auction defines a continuoustime random walk for trade ... 
Estimating attraction basin sizes
(Lecture Notes in Computer Science, 20161001)The performance of local search algorithms is influenced by the properties that the neighborhood imposes on the search space. Among these properties, the number of local optima has been traditionally considered as a ... 
Evolutionary algorithms to optimize lowthrust trajectory design in spacecraft orbital precession mission
(IEEE Congress on Evolutionary Computation, 20170606)In space environment, perturbations make the spacecraft lose its predefined orbit in space. One of these undesirable changes is the inplane rotation of space orbit, denominated as orbital precession. To overcome this ... 
An evolutionary discretized Lambert approach for optimal longrange rendezvous considering impulse limit
(Aerospace Science and Technology, 20190918)In this paper, an approach is presented for finding the optimal longrange space rendezvous in terms of fuel and time, considering limited impulse. In this approach , the Lambert problem is expanded towards a discretized ... 
An exact goodnessoffit test based on the occupancy problems to study zeroinflation and zerodeflation in biological dosimetry data
(Radiation Protection Dosimetry, 20180112)The goal in biological dosimetry is to estimate the dose of radiation that a suspected irradiated individual has received. For that, the analysis of aberrations (most commonly dicentric chromosome aberrations) in scored ... 
An Experimental Study in Adaptive Kernel Selection for Bayesian Optimization
(IEEE Access, 2019)Bayesian Optimization has been widely used along with Gaussian Processes for solving expensivetoevaluate blackbox optimization problems. Overall, this approach has shown good results, and particularly for parameter ... 
Fast algorithm for smoothing parameter selection in multidimensional Psplines
(Statistics and Computing, 20151231)A new computational algorithm for estimating the smoothing parameters of a multidimensional penalized spline generalized model with anisotropic penalty is presented. This new proposal is based on the mixed model representation ... 
Fast estimation of multidimensional adaptive Pspline models
(20161021)A fast and stable algorithm for estimating multidimensional adaptive Pspline models is presented. We call it as Separation of Overlapping Penalties (SOP) as it is an extension of the Separation of Anisotropic Penalties ...