Sciweavers

1216 search results - page 20 / 244
» Predicting relative performance of classifiers from samples
Sort
View
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 8 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
CVPR
2008
IEEE
14 years 9 months ago
Semantic-based indexing of fetal anatomies from 3-D ultrasound data using global/semi-local context and sequential sampling
The use of 3-D ultrasound data has several advantages over 2-D ultrasound for fetal biometric measurements, such as considerable decrease in the examination time, possibility of p...
Gustavo Carneiro, Fernando Amat, Bogdan Georgescu,...
AAAI
2010
13 years 9 months ago
Predicting the Importance of Newsfeed Posts and Social Network Friends
As users of social networking websites expand their network of friends, they are often flooded with newsfeed posts and status updates, most of which they consider to be understand...
Tim Paek, Michael Gamon, Scott Counts, David Maxwe...
ICPR
2002
IEEE
14 years 16 days ago
Motion Prediction Using VC-Generalization Bounds
This paper describes a novel application of Statistical Learning Theory (SLT) for motion prediction. SLT provides analytical VC-generalization bounds for model selection; these bo...
Harry Wechsler, Zoran Duric, Fayin Li, Vladimir Ch...
ESEM
2007
ACM
13 years 11 months ago
The Effects of Over and Under Sampling on Fault-prone Module Detection
The goal of this paper is to improve the prediction performance of fault-prone module prediction models (fault-proneness models) by employing over/under sampling methods, which ar...
Yasutaka Kamei, Akito Monden, Shinsuke Matsumoto, ...