Sciweavers

194 search results - page 29 / 39
» Sequence Labeling with Reinforcement Learning and Ranking Al...
Sort
View
COLT
2010
Springer
14 years 7 months ago
Regret Minimization With Concept Drift
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
Koby Crammer, Yishay Mansour, Eyal Even-Dar, Jenni...
ECML
2004
Springer
15 years 1 months ago
Population Diversity in Permutation-Based Genetic Algorithm
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...
Kenny Qili Zhu, Ziwei Liu
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
12 years 12 months ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich
ICRA
2008
IEEE
229views Robotics» more  ICRA 2008»
15 years 3 months ago
Learning of moving cast shadows for dynamic environments
Abstract— We propose a novel online framework for detecting moving shadows in video sequences using statistical learning techniques. In this framework, Support Vector Machines ar...
Ajay J. Joshi, Nikolaos Papanikolopoulos
75
Voted
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
15 years 6 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri