Sciweavers

417 search results - page 60 / 84
» Reinforcement Learning Estimation of Distribution Algorithm
Sort
View
ATAL
2006
Springer
15 years 6 months ago
Efficient agent-based cluster ensembles
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
Adrian K. Agogino, Kagan Tumer
ICML
2004
IEEE
16 years 3 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
SDM
2007
SIAM
198views Data Mining» more  SDM 2007»
15 years 3 months ago
Learning from Time-Changing Data with Adaptive Windowing
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...
Albert Bifet, Ricard Gavaldà
CVPR
2000
IEEE
16 years 4 months ago
Discriminant-EM Algorithm with Application to Image Retrieval
In Proc. of IEEE Conf. on CVPR'2000, Vol.I, pp.222-227, Hilton Head Island, SC, 2000 In many vision applications, the practice of supervised learning faces several difficulti...
Ying Wu, Qi Tian, Thomas S. Huang
107
Voted
ECML
2007
Springer
15 years 8 months ago
Separating Precision and Mean in Dirichlet-Enhanced High-Order Markov Models
Abstract. Robustly estimating the state-transition probabilities of highorder Markov processes is an essential task in many applications such as natural language modeling or protei...
Rikiya Takahashi