Sciweavers

219 search results - page 37 / 44
» Optimal dyadic decision trees
Sort
View
ICMCS
2005
IEEE
129views Multimedia» more  ICMCS 2005»
14 years 4 months ago
Feature Selection and Stacking for Robust Discrimination of Speech, Monophonic Singing, and Polyphonic Music
In this work we strive to find an optimal set of acoustic features for the discrimination of speech, monophonic singing, and polyphonic music to robustly segment acoustic media st...
Björn Schuller, Brüning J. B. Schmitt, D...
ECAI
2004
Springer
14 years 3 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano
SSPR
2004
Springer
14 years 3 months ago
Clustering Variable Length Sequences by Eigenvector Decomposition Using HMM
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
Fatih Murat Porikli
VLDB
1995
ACM
194views Database» more  VLDB 1995»
14 years 1 months ago
Eager Aggregation and Lazy Aggregation
Efficient processing of aggregation queries is essential for decision support applications. This paper describes a class of query transformations, called eager aggregation and lat...
Weipeng P. Yan, Per-Åke Larson
FLAIRS
2008
14 years 21 days ago
Using Genetic Programming to Increase Rule Quality
Rule extraction is a technique aimed at transforming highly accurate opaque models like neural networks into comprehensible models without losing accuracy. G-REX is a rule extract...
Rikard König, Ulf Johansson, Lars Niklasson