Active cost-sensitive learning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 1622-1623

  Margineantu, Dragos D ^a  

^a BOEING COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION DECISION; CLASSIFICATION TASKS; COST-SENSITIVE LEARNING; INPUT SPACE; LOSS FUNCTIONS; NETWORK INTRUSION DETECTION; NON-UNIFORM;

ARTIFICIAL INTELLIGENCE; INTRUSION DETECTION;

COSTS;

EID: 84880757496     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. C. L. Blake and C. J. Merz. UCI Repository of ML databases, 1998. [www.ics.uci.edu/~mlearn/MLRepository.html].
2. L. Breiman. Random forests. Technical report, Dept. of Statistics, University of California, Berkeley, 2001.
3. D. A. Cohn, L. Atlas, and R. Ladner. Improved generalization with active learning. Machine Learning, 15:201-221, 1994.
4. C. Elkan. The foundations of cost-sensitive learning. In Proc. of the Seventeenth Intrnl. Joint Conference on Artificial Intelligence. Morgan Kaufmann, 2001.
5. R. Greiner, A. J. Grove, and D. Roth. Learning cost-sensitive active classifiers. Artificial Intelligence. 139:2, pages 137-174, 2002. (Pubitemid 34802160)
6. S. Hettich and S. D. Bay. The UCI KDD archive, 1999. [http://kdd.ics.uci. edu/].
7. D. Lewis and J. Catlett. Heterogeneous uncertainty sampling. In Proc. Eleventh Intrnl. Conference on Machine Learning, pages 148-156. Morgan Kaufmann, 1994.
8. D. D. Margineantu and T. G. Dietterich. Bootstrap methods for the cost-sensitive evaluation of classifiers. In Proc. of the Seventeenth Intrnl. Conference on Machine Learning, pages 583-590. Morgan Kaufmann, 2000.
9. D. D. Margineantu. Class probability estimation and cost-sensitive classification decisions. In Proc. ECML- 2002, 13th European Conference on Machine Learning, Proceedings, pages 270-281. LNAI 2430, Springer Verlag, 2002.
10. F. Provost and P. Domingos. Tree induction for probability-based rankings. Machine Learning, 52:3, 2003.
11. M. Saar-Tsechansky and F. Provost. Active learning for class probability estimation and ranking. In Proc. Seventeenth Intrnl. Joint Conf. on Artificial Intelligence, pages 911-917. AAAI Press/MIT Press, 2001.
12. B. Zadrozny and C. Elkan. Obtaining calibrated probability estimates from decision trees and naive bayesian classifiers. In Proc. of the Eighteenth Intrnl. Conference on Machine Learning, pages 609-616. Morgan Kaufmann, 2001.