2020-Fall-CSE291-Advanced Data-Driven Text Mining
Graduate Class, CSE, UCSD, 2020
Class Time: Tuesdays and Thursdays, 9:30AM to 10:50AM. Room: https://ucsd.zoom.us/j/93162206472. Piazza: piazza.com/ucsd/fall2020/cse291a00
Online Lecturing
Due to the COVID-19, this course will be delivered over Zoom. All lectures will be recorded.
Overview
This course mainly focuses on introducing current methods and models that are useful in analyzing and mining real-world text data. It will put emphasis on unsupervised, weakly supervised, and distantly supervised methods for text mining problems, including information retrieval, open-domain information extraction, text summarization (both extractive and generative), and knowledge graph construction. Bootstrapping, comparative analysis, learning from seed words and existing knowledge bases will be the key methodologies.
There is no textbook required, but there are recommended readings for each lecture (at the end of the slides).
- You MUST enroll for 4 units
- We need your time commitment for projects
- Feel free to audit the course with 0 unit
Prerequisites
Knowledge about Machine Learning and Data Mining; Comfortable coding using Python, C/C++, or Java; Math and Stat skills.
TA and Office Hours
- Jingbo Shang
- Office Hour: Wednesdays, 10 to 11 AM
- Zoom link: https://ucsd.zoom.us/my/jshang
- TA: Dheeraj Mekala (dmekala AT eng.ucsd.edu)
- Office Hour: Tuesdays, 5 to 6 PM
- Zoom Link: https://ucsd.zoom.us/j/97330988404
Note: all times are in Pacific Time.
Grading
- Homework: 20%. There will be two homework assignments. 10% each.
- Text Mining Challenge: 30%.
- Project: 50%.
- You should complete all work individually, except for the Project.
- Late submissions are NOT accepted.
Lecture Schedule
Recording Note: Please download the recording video for the full length. Dropbox website will only show you the first one hour.
HW Note: All HWs due before the lecture time 9:30 AM PT in the morning.
Week | Date | Topic & Slides | Events |
1 | 10/01 (Thu) | Intro, Logistics, and Course Project [slides] [recording] | |
2 | 10/06 (Tue) | Basics: Zipf’s Law, Bags-of-words, and TF-IDF [slides] [recording] | HW1 out |
2 | 10/08 (Thu) | Word Embedding: word2vec and GloVe [slides] [recording] | |
3 | 10/13 (Tue) | Language Models: from N-Gram to Neural LMs [slides] [recording] | |
3 | 10/15 (Thu) | Information Retrieval: from BM25 to Learning to Rank [slides] [recording] | Project Proposal Due (End of the Day) |
4 | 10/20 (Tue) | Sentiment Analysis and Document Classification [slides] [recording] | |
4 | 10/22 (Thu) | Topic Modeling: PLSA, LDA, and HMM [slides] [recording] | HW1 Due (before lecture time), DM challenge roll-out |
5 | 10/27 (Tue) | Phrase Mining: from Unigrams to Multi-word Phrases [slides] [recording] | HW2 out |
5 | 10/29 (Thu) | Entity Set Expansion: from Seed Words to Sets [slides] [recording] | |
6 | 11/03 (Tue) | Entity Recognition: from Supervised to Data-Driven [slides] [recording] | |
6 | 11/05 (Thu) | Relation Extraction and Attribute Discovery [slides] [recording] | |
7 | 11/10 (Tue) | Text-Rich Network: a Collaboration between Texts and Networks [slides] [recording] | |
7 | 11/12 (Thu) | Topic Taxonomy Construction [slides] [recording] | |
8 | 11/17 (Tue) | Weakly Supervised Text Classification [slides] [recording] | |
8 | 11/19 (Thu) | Text Summarization: Extractive vs. Generative [slides] [recording] | HW2 due (before lecture time) |
9 | 11/24 (Tue) | Question Answering and Machine Reading Comprehension [slides] [recording] | DM challenge due |
9 | 11/26 (Thu) | (Thanksgiving Break) | |
10 | 12/01 (Tue) | Domain-Specific Applications: Biomedical Text Mining [slides] [recording] | Guest Lecture by Xuan Wang |
10 | 12/03 (Thu) | Project Presentations | |
11 | 12/08 (Tue) | Project Presentations | |
11 | 12/10 (Thu) | Project Presentations |
Homework (20%)
- HW1. Text Classification with Different Techniques. [zip]
- Due: Oct 22, before lecture time
- HW2. Phrase Mining Applications and Future Work. [PDF].
- Due: Nov 19, before lecture time
Data Mining Challenge (30%)
It is a individual-based text mining competition with quantitative evaluation. The challenge runs from Oct 20 2020 0:00:01 AM to Nov 24, 2020 4:59:59 PM PT. Note that the time displayed on Kaggle is in UTC, not PT.
- Challenge Statement, Dataset, and Details: [dataset] [challenge statement]
- Kaggle challenge link: https://www.kaggle.com/c/cse291-data-driven-text-mining
Project (50%)
Overview
- Team-Based Open-Ended Project
- 1 to 4 members per team. More members, higher expectation.
- 3 to 4 members are recommended, given the limited presentation slots.
Final Deliverables
- Project Proposal (5%)
- Define your own research problem and justify its importance
- Be ambitious! We could aim for ACL 2021 conference!
- Research Paper (20%)
- Report due on Dec 13, End of the day, Pacific Time.
- Write a 5 to 9 pages report (research-paper like following ACL template). The pages here do not include references.
- Come up with your hypothesis and find some datasets for verification
- Design your own models or try a large variety of existing models
- Submit your codes and datasets; Github repos are welcome
- Up to 5% bonus for working demos/apps towards the total course grades
- Presentation (20%)
- The orders will be decided randomly after the teams are formed.
- The slides must be ready 2 days before the presentation date. So other students can have the access and think about questions.
- The presentation follows a typical conference style: 20 mins for each team including Q&A
- Question Asking and Handling (5%)
- Asking questions is an important part of research. You are strongly encouraged to ask questions to other teams. It will be a part of your presentation grade.
- Handling questions is also an important skill for researchers.