Sciweavers

1062 search results - page 78 / 213
» Sublinear Optimization for Machine Learning
Sort
View
ICML
2001
IEEE
16 years 3 months ago
Some Theoretical Aspects of Boosting in the Presence of Noisy Data
This is a survey of some theoretical results on boosting obtained from an analogous treatment of some regression and classi cation boosting algorithms. Some related papers include...
Wenxin Jiang
102
Voted
ALT
2008
Springer
15 years 11 months ago
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
Ronald Ortner
127
Voted
MLDM
2007
Springer
15 years 8 months ago
Kernel MDL to Determine the Number of Clusters
In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...
Ivan O. Kyrgyzov, Olexiy O. Kyrgyzov, Henri Ma&ici...
95
Voted
ICALT
2007
IEEE
15 years 8 months ago
Embracing Cognitive Aspects in Web Personalization Environments -- The AdaptiveWeb Architecture
This paper1 presents a Web adaptation and personalization architecture that uses cognitive aspects as its core filtering element. The innovation of the proposed architecture focus...
Panagiotis Germanakos, Nikos Tsianos, Zacharias Le...
102
Voted
CEC
2005
IEEE
15 years 7 months ago
Relationships between internal and external metrics in co-evolution
Co-evolutionary algorithms (CEAs) have been applied to optimization and machine learning problems with often mediocre results. One of the causes for the unfulfilled expectations i...
Elena Popovici, Kenneth A. De Jong