Sciweavers

3963 search results - page 447 / 793
» Designing for learning
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 7 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
ICPR
2000
IEEE
16 years 7 months ago
Visual Extraction of Motion-Based Information from Image Sequences
We describe a system which is designed to assist in extracting high-level information from sets or sequences of images. We show that the method of principal components analysis fo...
David P. Gibson, Neill W. Campbell, Colin J. Dalto...
ICML
2006
IEEE
16 years 7 months ago
The relationship between Precision-Recall and ROC curves
Receiver Operator Characteristic (ROC) curves are commonly used to present results for binary decision problems in machine learning. However, when dealing with highly skewed datas...
Jesse Davis, Mark Goadrich
ICML
2005
IEEE
16 years 7 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
ICML
2004
IEEE
16 years 7 months ago
Decision trees with minimal costs
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
Charles X. Ling, Qiang Yang, Jianning Wang, Shicha...