Sciweavers

102 search results - page 18 / 21
» A Faster Algorithm for Generalized Multiple-Instance Learnin...
Sort
View
75
Voted
ATAL
2005
Springer
15 years 3 months ago
Rapid on-line temporal sequence prediction by an adaptive agent
Robust sequence prediction is an essential component of an intelligent agent acting in a dynamic world. We consider the case of near-future event prediction by an online learning ...
Steven Jensen, Daniel Boley, Maria L. Gini, Paul R...
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
14 years 10 months ago
Informative sampling for large unbalanced data sets
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
Zhenyu Lu, Anand I. Rughani, Bruce I. Tranmer, Jos...
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
14 years 11 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
15 years 10 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
DAC
2005
ACM
15 years 10 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu