Back to Results
First PageMeta Content
Naive Bayes classifier / Support vector machine / Supervised learning / Document classification / Expectation–maximization algorithm / Probabilistic latent semantic analysis / Kalman filter / Object categorization from image search / Semi-supervised learning / Statistics / Machine learning / Statistical classification


A Model for Handling Approximate, Noisy or Incomplete Labeling in Text Classification Ganesh Ramakrishnan Krishna Prasad Chitrapura Raghu Krishnapuram IBM India Research Lab, IIT, New Delhi, India
Add to Reading List

Document Date: 2008-12-01 11:14:51

Open Document

File Size: 326,34 KB

Share Result on Facebook

City

Washington DC / Bayes Network / New Delhi / New York / Laird / MATLAB / Heidelberg / Portland / Bonn / Chemnitz / Mumbai / /

Company

Newsgroup / IBM / Dataset WebKB Newsgroup / BayesANIL / /

Country

Germany / United States / /

Currency

pence / /

/

IndustryTerm

text learning algorithm / knowledge management applications / mac crypt politics xwindows electronics religion forsale / neural networks / data mining / http /

OperatingSystem

XP / /

Organization

India Pushpak Bhattacharyya Department of C.S.E / Royal Statistical Society / Text Classification Ganesh Ramakrishnan Krishna Prasad Chitrapura Raghu Krishnapuram IBM India Research Lab / /

Person

Sreeram Balakrishnan / /

Position

author / /

Product

P r / /

ProgrammingLanguage

Java / /

ProvinceOrState

Oregon / New Mexico / Delaware / /

PublishedMedium

Machine Learning / /

Technology

text learning algorithm / classifier learning algorithm / Expectation Maximization algorithm / Machine Learning / EM algorithm / em algorithms / learning algorithm / knowledge management / existing classification algorithms / artificial intelligence / Java / classification algorithms / data mining / /

URL

http /

SocialTag