Sciweavers

421 search results - page 8 / 85
» Reducing Label Complexity by Learning From Bags
Sort
View
NLE
2008
140views more  NLE 2008»
14 years 9 months ago
Active learning and logarithmic opinion pools for HPSG parse selection
For complex tasks such as parse selection, the creation of labelled training sets can be extremely costly. Resource-efficient schemes for creating informative labelled material mu...
Jason Baldridge, Miles Osborne
87
Voted
KDD
2009
ACM
205views Data Mining» more  KDD 2009»
15 years 4 months ago
From active towards InterActive learning: using consideration information to improve labeling correctness
Data mining techniques have become central to many applications. Most of those applications rely on so called supervised learning algorithms, which learn from given examples in th...
Abraham Bernstein, Jiwen Li
BMCBI
2010
224views more  BMCBI 2010»
14 years 9 months ago
An adaptive optimal ensemble classifier via bagging and rank aggregation with applications to high dimensional data
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
Susmita Datta, Vasyl Pihur, Somnath Datta
KDD
2003
ACM
129views Data Mining» more  KDD 2003»
15 years 10 months ago
Empirical comparisons of various voting methods in bagging
Finding effective methods for developing an ensemble of models has been an active research area of large-scale data mining in recent years. Models learned from data are often subj...
Kelvin T. Leung, Douglas Stott Parker Jr.
ICANN
2010
Springer
14 years 9 months ago
Tumble Tree - Reducing Complexity of the Growing Cells Approach
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
Hendrik Annuth, Christian-A. Bohn