Examinar Documentos de Trabajo e Informes Técnicos por departamento (eus.) "Konputazio zientziak eta adimen artifiziala"
Now showing items 1-20 of 30
-
A detailed investigation of classification methods for vowel speech imagery recognition
(2013-12-18)Accurate and fast decoding of speech imagery from electroencephalographic (EEG) data could serve as a basis for a new generation of brain computer interfaces (BCIs), more portable and easier to use. However, decoding of ... -
A Preprocessing Procedure for Haplotype Inference by Pure Parsimony
(2010)Haplotype data is especially important in the study of complex diseases since it contains more information than genotype data. However, obtaining haplotype data is technically difficult and expensive. Computational methods ... -
A quantitative analysis of estimation of distribution algorithms based on Bayesian networks
(2009)The successful application of estimation of distribution algorithms (EDAs) to solve different kinds of problems has reinforced their candidature as promising black-box optimization tools. However, their internal behavior is ... -
A review on Estimation of Distribution Algorithms in Permutation-based Combinatorial Optimization Problems
(2011)Estimation of Distribution Algorithms (EDAs) are a set of algorithms that belong to the field of Evolutionary Computation. Characterized by the use of probabilistic models to represent the solutions and the dependencies ... -
A sensitivity study of bias and variance of k-fold cross-validation in prediction error estimation
(2009)In the machine learning field the performance of a classifier is usually measured in terms of prediction error. In most real-world problems, the error cannot be exactly calculated and it must be estimated. Therefore, it’s ... -
An R package for permutations, Mallows and Generalized Mallows models
(2014-01-22)[EN]Probability models on permutations associate a probability value to each of the permutations on n items. This paper considers two popular probability models, the Mallows model and the Generalized Mallows model. We ... -
Analysis of Spanish text-thesaurus as a complex network
(2014-02-06)[EN]Based on the theoretical tools of Complex Networks, this work provides a basic descriptive study of a synonyms dictionary, the Spanish Open Thesaurus represented as a graph. We study the main structural measures of the ... -
Analyzing limits of effectiveness in different implementations of estimation of distribution algorithms
(2011)Conducting research in order to know the range of problems in which a search algorithm is effective constitutes a fundamental issue to understand the algorithm and to continue the development of new techniques. In this ... -
Approaching Sentiment Analysis by Using Semi-supervised Learning of Multidimensional Classifiers
(2011)Sentiment Analysis is defined as the computational study of opinions, sentiments and emotions expressed in text. Within this broad field, most of the work has been focused on either Sentiment Polarity classification, ... -
Bertso transformation with pattern-based sampling
(2015-08-07)This paper presents a method to generate new melodies, based on conserving the semiotic structure of a template piece. A pattern discovery algorithm is applied to a template piece to extract significant segments: those ... -
Communities in complex networks
(2013-01-16)The study of complex networks has attracted the attention of the scientific community for many obvious reasons. A vast number of systems, from the brain to ecosystems, power grid, and the Internet, can be represented as ... -
Efficient learning of decomposable models with a bounded clique size
(2014-05-08)The learning of probability distributions from data is a ubiquitous problem in the fields of Statistics and Artificial Intelligence. During the last decades several learning algorithms have been proposed to learn probability ... -
Extending Distance-based Ranking Models In Estimation of Distribution Algorithms
(2014-05-20)Recently, probability models on rankings have been proposed in the field of estimation of distribution algorithms in order to solve permutation-based combinatorial optimisation problems. Particularly, distance-based ranking ... -
KAF: Kyoto Annotation Framework
(2009)This document presents the current draft of KAF: Kyoto Annotation Framework to be used within the KYOTO project. KAF aims to provide a reference format for the representation of semantic annotations. -
Learning Bayesian network classifiers for multidimensional supervised classification problems by means of a multiobjective approach
(2010)A classical supervised classification task tries to predict a single class variable based on a data set composed of a set of labeled examples. However, in many real domains more than one variable could be considered as a ... -
Learning Probability Distributions over Permutations by Means of Fourier Coefficients
(2011)A large and increasing number of data mining domains consider data that can be represented as permutations. Therefore, it is important to devise new methods to learn predictive models over datasets of permutations. However, ... -
-
MATEDA: A suite of EDA programs in Matlab
(2009)This paper describes MATEDA-2.0, a suite of programs in Matlab for estimation of distribution algorithms. The package allows the optimization of single and multi-objective problems with estimation of distribution algorithms ... -
Music-Theoretic Estimation of Chords and Keys from Audio
(2012)This paper proposes a new method for local key and chord estimation from audio signals. This method relies primarily on principles from music theory, and does not require any training on a corpus of labelled audio files. ... -
New methods for generating populations in Markov network based EDAs: Decimation strategies and model-based template recombination
(2012-12-27)Methods for generating a new population are a fundamental component of estimation of distribution algorithms (EDAs). They serve to transfer the information contained in the probabilistic model to the new generated population. ...