Área de Lenguajes y Sistemas Informáticos
Browse by
Recent Submissions
-
Exploring the use of blockchain in resource-constrained fog computing environments
(Wiley online, 2022-11)Fog computing has become a complementary technology to cloud computing and addresses some of the cloud computing threats such as the response time and network bandwidth demand. Fog computing successes processing data and ... -
Design of aI-based resource forecasting methods for network slicing
(IEEE, 2022)With the forthcoming of 5G networks, the underlying infrastructure needs to support a higher number of heterogeneous services with different QoS needs than ever. For that reason, 5G inherently provides a way to allocate ... -
Models@Runtime: The Development and Re-Configuration Management of Python Applications Using Formal Methods
(MDPI, 2021)Models@runtime (models at runtime) are based on computation reflection. Runtime models can be regarded as a reflexive layer causally connected with the underlying system. Hence, every change in the runtime model involves ... -
Effectiveness of Virtual Reality-Based Interventions for Children and Adolescents with ADHD
(MDPI, 2021-01)Abstract: This review aims to evaluate the effectiveness of virtual reality-based interventions (VRbased interventions) on cognitive deficits in children with attention deficit hyperactivity disorder (ADHD). A systematic ... -
Mixture-based probabilistic graphical models for the partial label ranking problem
(2021-11)The Label Ranking problem consists in learning preference models from training datasets labeled with a ranking of class labels, and the goal is to predict a ranking for a given unlabeled instance. In this work, we focus ... -
Face recognition by counter-propagation networks
(SIARP, 2000)The functionality of counter-propagation nets applied to face recognition is presented inthis paper. The chosen procedure basically transforms the image into a vector of numbers andpasses them to the net’s input layer. The ... -
Learning decision trees for the partial label ranking problem
(Wiley, 2020-10-16)The Label Ranking (LR) problem is a well‐known nonstandard supervised classification problem, the goal of which is to learn preference classifiers from data, mapping instances to rankings of the labels of the class variable. ... -
Mixture-Based Probabilistic Graphical Models for the Label Ranking Problem
(MDPI, 2021-03)The goal of the Label Ranking (LR) problem is to learn preference models that predict the preferred ranking of class labels for a given unlabeled instance. Different well-known machine learning algorithms have been adapted ... -
SLA-Driven modeling and verifying cloud systems: A Bigraphical reactive systems-based approach
(Elsevier, 2021-02)We propose a formal approach based on Bigraphical Reactive Systems (BRSs) and model checking techniques for modeling and verifying the interaction behaviours of SLA-based cloud computing systems. In the first phase of this ... -
A Compositional Approach for Complex Event Pattern Modeling and Transformation to Colored Petri Nets with Black Sequencing Transitions
(Institute of Electrical and Electronics Engineers, 2021-03)Prioritized Colored Petri Nets (PCPNs) are a well-known extension of plain Petri nets in which transitions can have priorities and the tokens on the places carry data information. In this paper, we propose an extension of ... -
Approaching rank aggregation problems by using evolution strategies: The case of the optimal bucket order problem
(Elsevier, 2018-11)The optimal bucket order problem consists in obtaining a complete consensus ranking (ties are allowed) from a matrix of preferences (possibly obtained from a database of rankings). In this paper, we tackle this problem by ... -
Tackling the supervised label ranking problem by bagging weak learners
(Elsevier, 2017)Preference learning is the branch of machine learning in charge of inducing preference models from data. In this paper we focus on the task known as label ranking problem, whose goal is to predict a ranking among the ... -
Approaching the Rank Aggregation Problem by Local Search-based Metaheuristics
(Elsevier, 2019-07)Encouraged by the success of applying metaheuristics algorithms to other ranking-based problems (Kemeny ranking problem and pa rameter estimation for Mallows distributions), in this paper we deal with the rank aggregation ... -
A Metahierarchical Rule Decision System to Design Robust Fuzzy Classifiers Based on Data Complexity
(Institute of Electrical and Electronics Engineers, 2019-04)There is a wide variety of studies that propose different classifiers to solve a large amount of problems in distinct classification scenarios. The no free lunch theorem states that if we use a big enough set of varied ... -
Adapting the CMIM algorithm for multi-label feature selection. A comparison with existing methods
(Wiley, 2018-02-18)The multi-label paradigm has recently attracted the attention of the machine learning community, multi-label problems being those which do not have only one class but several binomial classes instead. Although intensive ... -
Assessment of flood risk in Mediterranean catchments: An approach based on Bayesian Networks
(Springer, 2019-11)National and international technical reports have demonstrated the increase of extreme event occurrences which becomes more dangerous in coastal areas due to their higher population density. In Spain, flood and storm ... -
On the use of local search heuristics to improve GES-based Bayesian network learning
(Elsevier, 2018)Bayesian networks learning is computationally expensive even in the case of sacrificing the optimality of the result. Many methods aim at obtaining quality solutions in affordable times. Most of them are based on local ... -
Machine learning from crowds a systematic review of its applications
(John Wiley & Sons, 2018-10)Crowdsourcing opens the door to solving a wide variety of problems that previ-ously were unfeasible in the field of machine learning, allowing us to obtain rela-tively low cost labeled data in a small amount of time. ... -
Scaling up the learning-from-crowds GLAD algorithm using instance-difficulty clustering
(Springer, 2019-05)The main goal of this article is to improve the results obtained by the GLAD algorithm in cases with large data. This algorithm is able to learn from instances labeled by multiple annotators taking into account both the ... -
Integration of Contextual Information into the Scene Classification Problem
(Elsevier, 2017-11)The task of identifying the semantic localization of a robot has commonly been treated as a classification problem, where images are taken as input and a set of predefined labels is the output. While traditional approaches ...
RSS 1.0