180 search results - page 7 / 36 » Active Learning for Class Probability Estimation and Ranking |
ECML
2001
Springer
13 years 12 months ago
2001
Springer
Labeled data for classification could often be obtained by sampling that restricts or favors choice of certain classes. A classifier trained using such data will be biased, resulti...
ECML
2005
Springer
14 years 27 days ago
2005
Springer
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
DATAMINE
2006
13 years 7 months ago
2006
Data visualization plays a crucial role in identifying interesting patterns in exploratory data analysis. Its use is, however, made difficult by the large number of possible data p...
TNN
1998
13 years 7 months ago
1998
— In this paper, we study a qualitative property of a class of competitive learning (CL) models, which is called the multiplicatively biased competitive learning (MBCL) model, na...