Sciweavers

577 search results - page 52 / 116
» Mixing independent classifiers
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 11 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
GECCO
2004
Springer
14 years 4 months ago
Real-Coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the Continuous World
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
Chang Wook Ahn, Rudrapatna S. Ramakrishna, David E...
ICML
2010
IEEE
13 years 11 months ago
Clustering processes
The problem of clustering is considered, for the case when each data point is a sample generated by a stationary ergodic process. We propose a very natural asymptotic notion of co...
Daniil Ryabko
CSDA
2008
115views more  CSDA 2008»
13 years 10 months ago
Complex-valued ICA based on a pair of generalized covariance matrices
It is shown that any pair of scatter and spatial scatter matrices yields an estimator of the separating matrix for complex-valued independent component analysis (ICA). Scatter (re...
Esa Ollila, Hannu Oja, Visa Koivunen
IJON
2007
119views more  IJON 2007»
13 years 10 months ago
Finite sample effects of the fast ICA algorithm
Many algorithms for independent component analysis (ICA) and blind source separation (BSS) can be considered particular instances of a criterion based on the sum of two terms: C(Y...
Sergio Bermejo