Sciweavers

73 search results - page 2 / 15
» Learning to Classify Documents with Only a Small Positive Tr...
Sort
View
CVPR
2007
IEEE
13 years 11 months ago
Matrix-Structural Learning (MSL) of Cascaded Classifier from Enormous Training Set
Aiming at the problem when both positive and negative training set are enormous, this paper proposes a novel Matrix-Structural Learning (MSL) method, as an extension to Viola and ...
Shengye Yan, Shiguang Shan, Xilin Chen, Wen Gao, J...
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
13 years 6 months ago
Semantic Smoothing for Bayesian Text Classification with Small Training Data
Bayesian text classifiers face a common issue which is referred to as data sparsity problem, especially when the size of training data is very small. The frequently used Laplacian...
Xiaohua Zhou, Xiaodan Zhang, Xiaohua Hu
AAAI
1998
13 years 6 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...
ADCS
2004
13 years 6 months ago
Co-Training on Textual Documents with a Single Natural Feature Set
Co-training is a semi-supervised technique that allows classifiers to learn with fewer labelled documents by taking advantage of the more abundant unclassified documents. However, ...
Jason Chan, Irena Koprinska, Josiah Poon
AUSAI
2008
Springer
13 years 6 months ago
Learning to Find Relevant Biological Articles without Negative Training Examples
Classifiers are traditionally learned using sets of positive and negative training examples. However, often a classifier is required, but for training only an incomplete set of pos...
Keith Noto, Milton H. Saier Jr., Charles Elkan