Sciweavers

8 search results - page 1 / 2
» Obtaining calibrated probability estimates from decision tre...
Sort
View
ICML
2001
IEEE
14 years 5 months ago
Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers
Accurate, well-calibrated estimates of class membership probabilities are needed in many supervised learning applications, in particular when a cost-sensitive decision must be mad...
Bianca Zadrozny, Charles Elkan
KDD
2002
ACM
187views Data Mining» more  KDD 2002»
14 years 5 months ago
Transforming classifier scores into accurate multiclass probability estimates
Class membership probability estimates are important for many applications of data mining in which classification outputs are combined with other sources of information for decisi...
Bianca Zadrozny, Charles Elkan
ML
2000
ACM
154views Machine Learning» more  ML 2000»
13 years 4 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
SAC
2005
ACM
13 years 10 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
IGARSS
2010
12 years 11 months ago
Calibrating probabilities for hyperspectral classification of rock types
This paper investigates the performance of machine learning methods for classifying rock types from hyperspectral data. The main objective is to test the impact on classification ...
Sildomar T. Monteiro, Richard J. Murphy