481 search results - page 20 / 97 » Detecting Fractures in Classifier Performance |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Recently, mining data streams with concept drifts for actionable insights has become an important and challenging task for a wide range of applications including credit card fraud...
127
click to vote
NIPS
2001
14 years 11 months ago
2001
This paper develops a new approach for extremely fast detection in domains where the distribution of positive and negative examples is highly skewed (e.g. face detection or databa...
BMVC
2010
14 years 4 months ago
2010
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
KDD
2005
ACM
15 years 10 months ago
2005
ACM
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...