63 search results - page 6 / 13 » Complexity Bounds for Batch Active Learning in Classificatio... |
KDD
2002
ACM
14 years 8 months ago
2002
ACM
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 ...
IADIS
2003
13 years 9 months ago
2003
The problem of hypertext classification deals with objects possessing more complex information structure than the plain text has. Present hypertext classification systems show the...
NIPS
2001
13 years 9 months ago
2001
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
DELFI
2006
13 years 9 months ago
2006
: Mobile learning has left the status of a new born child. It is time now to implement some structure into the complex and various activities by a framework presented in this paper...