Sciweavers

801 search results - page 31 / 161
» The Inefficiency of Batch Training for Large Training Sets
Sort
View
PREMI
2005
Springer
14 years 2 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
KDD
1999
ACM
199views Data Mining» more  KDD 1999»
14 years 1 months ago
The Application of AdaBoost for Distributed, Scalable and On-Line Learning
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang
BMCBI
2006
114views more  BMCBI 2006»
13 years 8 months ago
Evaluation and comparison of mammalian subcellular localization prediction methods
Background: Determination of the subcellular location of a protein is essential to understanding its biochemical function. This information can provide insight into the function o...
Josefine Sprenger, J. Lynn Fink, Rohan D. Teasdale
ICML
2005
IEEE
14 years 9 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
AAAI
1998
13 years 10 months ago
Learning to Classify Text from Labeled and Unlabeled Documents
In many important text classification problems, acquiring class labels for training documents is costly, while gathering large quantities of unlabeled data is cheap. This paper sh...
Kamal Nigam, Andrew McCallum, Sebastian Thrun, Tom...