|
![]() |
![]() |
![]() |
![]() |
![]() |
|
![]() |
MetaCostOverviewResearch in machine learning, statistics and related fields has produced a wide variety of algorithms for classification. However, most of these algorithms assume that all errors have the same cost, which is seldom the case in data mining problems. Individually making each classification learner cost-sensitive is laborious, and often non-trivial. In this project we develop principled methods for making an arbitrary classifier cost-sensitive by wrapping a cost-minimizing procedure around it. Project membersPublications
|
![]() |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to Pedro Domingos] |