15 search results - page 2 / 3 » Learning Reliable Classifiers From Small or Incomplete Data ... |
ADMA
2005
Springer
13 years 10 months ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
MICCAI
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. In this paper, we propose a new dynamic learning framework that requires a small amount of labeled data in the beginning, then incrementally discovers informative unlabel...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
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...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...
ML
2000
ACM
13 years 4 months ago
2000
ACM
This paper shows that the accuracy of learned text classifiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. ...