Sciweavers

410 search results - page 45 / 82
» MILIS: Multiple Instance Learning with Instance Selection
Sort
View
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 1 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
ICPR
2004
IEEE
15 years 10 months ago
Selective Sampling Based on the Variation in Label Assignments
In this paper, a new selective sampling method for the active learning framework is presented. Initially, a small training set ? and a large unlabeled set ? are given. The goal is...
Piotr Juszczak, Robert P. W. Duin
JMLR
2006
99views more  JMLR 2006»
14 years 9 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
GECCO
2006
Springer
214views Optimization» more  GECCO 2006»
15 years 1 months ago
A new discrete particle swarm algorithm applied to attribute selection in a bioinformatics data set
Many data mining applications involve the task of building a model for predictive classification. The goal of such a model is to classify examples (records or data instances) into...
Elon S. Correa, Alex Alves Freitas, Colin G. Johns...
INFOCOM
2012
IEEE
13 years 4 days ago
Di-Sec: A distributed security framework for heterogeneous Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are no longer a nascent technology and today, they are actively deployed as a viable technology in many diverse application domains such as health ...
Marco Valero, Sang Shin Jung, A. Selcuk Uluagac, Y...