572 search results - page 25 / 115 » Estimating the Accuracy of Learned Concepts |
ECSQARU
2009
Springer
15 years 4 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
PKDD
2005
Springer
15 years 3 months ago
2005
Springer
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
104
Voted
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
In active learning, where a learning algorithm has to purchase the labels of its training examples, it is often assumed that there is only one labeler available to label examples, ...
83
Voted
IJCAI
2003
14 years 11 months ago
2003
Multi-view learners reduce the need for labeled data by exploiting disjoint sub-sets of features (views), each of which is sufficient for learning. Such algorithms assume that eac...
98
Voted
NLPRS
2001
Springer
15 years 2 months ago
2001
Springer
We describe a new tagging model where the states of a hidden Markov model (HMM) estimated by unsupervised learning are incorporated as the features in a maximum entropy model. Our...