DOC PREVIEW
CMU CS 10701 - Semi-Supervised Learning and Text Analysis

This preview shows page 1-2-3-4-24-25-26-50-51-52-53 out of 53 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 53 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Semi-Supervised Learning and Text AnalysisMachine Learning 10-701November 29, 2005Tom M. MitchellCarnegie Mellon UniversityDocument Classification: Bag of Words Approachaardvark 0about 2all 2Africa 1apple 0anxious 0...gas 1...oil 1…Zaire 0For code, seewww.cs.cmu.edu/~tom/mlbook.htmlclick on “Software and Data”Supervised Training for Document Classification• Common algorithms:– Logistic regression, Support Vector Machines, Bayesian classifiers• Quite successful in practice– Email classification (spam, foldering, ...)– Web page classification (product description, publication, ...)– Intranet document organization• Research directions:– More elaborate, domain-specific classification models (e.g., for email)– Using unlabeled data too Æ semi-supervised methodsEM for Semi-supervised document classificationUsing Unlabeled Data to Help Train Naïve Bayes ClassifierYX1X4X3X21010?0110?010000010011001X4X3X2X1YLearn P(Y|X)From [Nigam et al., 2000]E Step:M Step:wtis t-th word in vocabularyElaboration 1: Downweight the influence of unlabeled examples by factor λNew M step:Chosen by cross validationUsing one labeled example per class20 Newsgroups20 NewsgroupsEM for Semi-Supervised Doc Classification• If all data is labeled, corresponds to Naïve Bayes classifier• If all data unlabeled, corresponds to mixture-of-multinomial clustering• If both labeled and unlabeled data, it helps if and only if the mixture-of-multinomial modeling assumption is correct• Of course we could extend this to Bayes net models other than Naïve Bayes (e.g., TAN tree)Bags of Words, orBags of Topics?LDA: Generative model for documents[Blei, Ng, Jordan 2003]Also extended to case where number of topics is not known in advance (hierarchical Dirichlet processes – [Blei et al, 2004])Clustering words into topics withHierarchical Topic Models (unknown number of clusters)[Blei, Ng, Jordan 2003]Probabilistic model for generating document D:1. Pick a distribution P(z|θ) of topics according to P(θ|α)2. For each word w• Pick topic z from P(z | θ)• Pick word w from P(w |z, φ)Training this model defines topics (i.e., φ which defines P(W|Z))STORYSTORIESTELLCHARACTERCHARACTERSAUTHORREADTOLDSETTINGTALESPLOTTELLINGSHORTFICTIONACTIONTRUEEVENTSTELLSTALENOVELMINDWORLDDREAMDREAMSTHOUGHTIMAGINATIONMOMENTTHOUGHTSOWNREALLIFEIMAGINESENSECONSCIOUSNESSSTRANGEFEELINGWHOLEBEINGMIGHTHOPEWATERFISHSEASWIMSWIMMINGPOOLLIKESHELLSHARKTANKSHELLSSHARKSDIVINGDOLPHINSSWAMLONGSEALDIVEDOLPHINUNDERWATERDISEASEBACTERIADISEASESGERMSFEVERCAUSECAUSEDSPREADVIRUSESINFECTIONVIRUSMICROORGANISMSPERSONINFECTIOUSCOMMONCAUSINGSMALLPOXBODYINFECTIONSCERTAINExample topicsinduced from a large collection of textFIELDMAGNETICMAGNETWIRENEEDLECURRENTCOILPOLESIRONCOMPASSLINESCOREELECTRICDIRECTIONFORCEMAGNETSBEMAGNETISMPOLEINDUCEDSCIENCESTUDYSCIENTISTSSCIENTIFICKNOWLEDGEWORKRESEARCHCHEMISTRYTECHNOLOGYMANYMATHEMATICSBIOLOGYFIELDPHYSICSLABORATORYSTUDIESWORLDSCIENTISTSTUDYINGSCIENCESBALLGAMETEAMFOOTBALLBASEBALLPLAYERSPLAYFIELDPLAYERBASKETBALLCOACHPLAYEDPLAYINGHITTENNISTEAMSGAMESSPORTSBATTERRYJOBWORKJOBSCAREEREXPERIENCEEMPLOYMENTOPPORTUNITIESWORKINGTRAININGSKILLSCAREERSPOSITIONSFINDPOSITIONFIELDOCCUPATIONSREQUIREOPPORTUNITYEARNABLE[Tennenbaum et al]STORYSTORIESTELLCHARACTERCHARACTERSAUTHORREADTOLDSETTINGTALESPLOTTELLINGSHORTFICTIONACTIONTRUEEVENTSTELLSTALENOVELMINDWORLDDREAMDREAMSTHOUGHTIMAGINATIONMOMENTTHOUGHTSOWNREALLIFEIMAGINESENSECONSCIOUSNESSSTRANGEFEELINGWHOLEBEINGMIGHTHOPEWATERFISHSEASWIMSWIMMINGPOOLLIKESHELLSHARKTANKSHELLSSHARKSDIVINGDOLPHINSSWAMLONGSEALDIVEDOLPHINUNDERWATERDISEASEBACTERIADISEASESGERMSFEVERCAUSECAUSEDSPREADVIRUSESINFECTIONVIRUSMICROORGANISMSPERSONINFECTIOUSCOMMONCAUSINGSMALLPOXBODYINFECTIONSCERTAINFIELDMAGNETICMAGNETWIRENEEDLECURRENTCOILPOLESIRONCOMPASSLINESCOREELECTRICDIRECTIONFORCEMAGNETSBEMAGNETISMPOLEINDUCEDSCIENCESTUDYSCIENTISTSSCIENTIFICKNOWLEDGEWORKRESEARCHCHEMISTRYTECHNOLOGYMANYMATHEMATICSBIOLOGYFIELDPHYSICSLABORATORYSTUDIESWORLDSCIENTISTSTUDYINGSCIENCESBALLGAMETEAMFOOTBALLBASEBALLPLAYERSPLAYFIELDPLAYERBASKETBALLCOACHPLAYEDPLAYINGHITTENNISTEAMSGAMESSPORTSBATTERRYJOBWORKJOBSCAREEREXPERIENCEEMPLOYMENTOPPORTUNITIESWORKINGTRAININGSKILLSCAREERSPOSITIONSFINDPOSITIONFIELDOCCUPATIONSREQUIREOPPORTUNITYEARNABLEExample topicsinduced from a large collection of text[Tennenbaum et al]Significance:• Learned topics reveal hidden, implicit semantic categories in the corpus• In many cases, we can represent documents with 102topics instead of 105words• Especially important for short documents (e.g., emails). Topics overlap when words don’t !Can we analyze roles and relationships between people by analyzing email word or topic distributions?Author-Recipient-Topic model for EmailLatent Dirichlet Allocation(LDA)[Blei, Ng, Jordan, 2003]Author-Recipient Topic(ART)[McCallum, Corrada, Wang, 2004]Enron Email Corpus• 250k email messages• 23k peopleDate: Wed, 11 Apr 2001 06:56:00 -0700 (PDT)From: [email protected]: [email protected]: Enron/TransAltaContract dated Jan 1, 2001Please see below. Katalin Kiss of TransAlta has requested an electronic copy of our final draft? Are you OK with this? If so, the only version I have is the original draft without revisions.DPDebra PerlingiereEnron North America Corp.Legal Department1400 Smith Street, EB 3885Houston, Texas [email protected], and prominent sender/receiversdiscovered by ARTTop words within topic : Top author-recipients exhibiting this topic[McCallum et al, 2004]Topics, and prominent sender/receiversdiscovered by ARTBeck = “Chief Operations Officer”Dasovich = “Government Relations Executive”Shapiro = “Vice Presidence of Regulatory Affairs”Steffes = “Vice President of Government Affairs”Discovering Role Similarityconnection strength (A,B) = Traditional SNASimilarity inrecipients they sent email toSimilarity in authored topics, conditioned on recipientARTCo-Training for Semi-supervised document classificationIdea: take advantage of *redundancy*Redundantly Sufficient FeaturesProfessor Faloutsosmy advisorRedundantly Sufficient FeaturesProfessor Faloutsosmy advisorRedundantly Sufficient FeaturesRedundantly Sufficient FeaturesProfessor Faloutsosmy advisorCo-TrainingAnswer1Classifier1Answer2Classifier2Key idea: Classifier1and ClassifierJmust:1. Correctly classify labeled examples2. Agree on classification of unlabeledCoTraining Algorithm #1 [Blum&Mitchell, 1998]Given: labeled data L, unlabeled data


View Full Document

CMU CS 10701 - Semi-Supervised Learning and Text Analysis

Documents in this Course
lecture

lecture

12 pages

lecture

lecture

17 pages

HMMs

HMMs

40 pages

lecture

lecture

15 pages

lecture

lecture

20 pages

Notes

Notes

10 pages

Notes

Notes

15 pages

Lecture

Lecture

22 pages

Lecture

Lecture

13 pages

Lecture

Lecture

24 pages

Lecture9

Lecture9

38 pages

lecture

lecture

26 pages

lecture

lecture

13 pages

Lecture

Lecture

5 pages

lecture

lecture

18 pages

lecture

lecture

22 pages

Boosting

Boosting

11 pages

lecture

lecture

16 pages

lecture

lecture

20 pages

Lecture

Lecture

20 pages

Lecture

Lecture

39 pages

Lecture

Lecture

14 pages

Lecture

Lecture

18 pages

Lecture

Lecture

13 pages

Exam

Exam

10 pages

Lecture

Lecture

27 pages

Lecture

Lecture

15 pages

Lecture

Lecture

24 pages

Lecture

Lecture

16 pages

Lecture

Lecture

23 pages

Lecture6

Lecture6

28 pages

Notes

Notes

34 pages

lecture

lecture

15 pages

Midterm

Midterm

11 pages

lecture

lecture

11 pages

lecture

lecture

23 pages

Boosting

Boosting

35 pages

Lecture

Lecture

49 pages

Lecture

Lecture

22 pages

Lecture

Lecture

16 pages

Lecture

Lecture

18 pages

Lecture

Lecture

35 pages

lecture

lecture

22 pages

lecture

lecture

24 pages

Midterm

Midterm

17 pages

exam

exam

15 pages

Lecture12

Lecture12

32 pages

lecture

lecture

19 pages

Lecture

Lecture

32 pages

boosting

boosting

11 pages

pca-mdps

pca-mdps

56 pages

bns

bns

45 pages

mdps

mdps

42 pages

svms

svms

10 pages

Notes

Notes

12 pages

lecture

lecture

42 pages

lecture

lecture

29 pages

lecture

lecture

15 pages

Lecture

Lecture

12 pages

Lecture

Lecture

24 pages

Lecture

Lecture

22 pages

Midterm

Midterm

5 pages

mdps-rl

mdps-rl

26 pages

Load more
Download Semi-Supervised Learning and Text Analysis
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Semi-Supervised Learning and Text Analysis and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Semi-Supervised Learning and Text Analysis 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?