Sciweavers

24 search results - page 5 / 5
» Online convex optimization in the bandit setting: gradient d...
Sort
View
ICML
2009
IEEE
14 years 5 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 8 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
ICDCS
2007
IEEE
13 years 8 months ago
Efficient Execution of Continuous Incoherency Bounded Queries over Multi-Source Streaming Data
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...
Manish Bhide, Krithi Ramamritham, Mukund Agrawal
ESANN
2006
13 years 6 months ago
Magnification control for batch neural gas
Neural gas (NG) constitutes a very robust clustering algorithm which can be derived as stochastic gradient descent from a cost function closely connected to the quantization error...
Barbara Hammer, Alexander Hasenfuss, Thomas Villma...