Sciweavers

286 search results - page 15 / 58
» Learning to Classify Texts Using Positive and Unlabeled Data
Sort
View
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 9 months ago
Spectral domain-transfer learning
Traditional spectral classification has been proved to be effective in dealing with both labeled and unlabeled data when these data are from the same domain. In many real world ap...
Xiao Ling, Wenyuan Dai, Gui-Rong Xue, Qiang Yang, ...
ICML
2005
IEEE
14 years 9 months ago
A model for handling approximate, noisy or incomplete labeling in text classification
We introduce a Bayesian model, BayesANIL, that is capable of estimating uncertainties associated with the labeling process. Given a labeled or partially labeled training corpus of...
Ganesh Ramakrishnan, Krishna Prasad Chitrapura, Ra...
AAAI
2006
13 years 10 months ago
Kernel Methods for Word Sense Disambiguation and Acronym Expansion
The scarcity of manually labeled data for supervised machine learning methods presents a significant limitation on their ability to acquire knowledge. The use of kernels in Suppor...
Mahesh Joshi, Ted Pedersen, Richard Maclin, Sergue...
ADC
2010
Springer
214views Database» more  ADC 2010»
13 years 3 months ago
Building a dynamic classifier for large text data collections
Due to the lack of in-built tools to navigate the web, people have to use external solutions to find information. The most popular of these are search engines and web directories....
Pavel Kalinov, Bela Stantic, Abdul Sattar
FLAIRS
2007
13 years 11 months ago
Enhancing the Performance of Semi-Supervised Classification Algorithms with Bridging
Traditional supervised classification algorithms require a large number of labelled examples to perform accurately. Semi-supervised classification algorithms attempt to overcome t...
Jason Chan, Josiah Poon, Irena Koprinska