CS 583 - Fall 2018

Data Mining and Text Mining

Course Objective

This course has three objectives. First, to provide students with a sound basis in data mining tasks and techniques. Second, to ensure that students are able to read, and critically evaluate data mining research papers. Third, to ensue that students are able to implement and to use some of the important data mining and text mining algorithms.

Think and Ask!

If you have questions about any topic or assignment, DO ASK me or even your classmates for help, I am here to make the course undersdood. DO NOT delay your questions. There is no such thing as a stupid question. The only obstacle to learning is laziness.

General Information

• Instructor: Bing Liu
  • Email: Bing Liu
  • Tel: (312) 355 1318
  • Office: 3190 C, 3rd floor, Library North (North-end of the 3rd floor)
• Teaching Assistants:
  • Sahisnu Mazumder, sahisnumazumder@gmail.com, office hours: by appointment
  • Shuai Wang, swang207@uic.edu; office hours: by appointment
• Course Call Number: 30286
• Lecture time slots:
  • 3:30-4:45pm Tuesday & Thursday
• Lecture hall: BH 209
• Office hours: 2:00pm-3:15pm, Tuesday & Thursday (or by appointment)

Grading

• Midterms: 30% (multiple midterms)
  • Date and time: TBA
• Final Exam: 40%
  • Date and Time: TBA
• Projects: 30%
  • Project 1 (15%): Implement MS-GSP or MS-PS
    • Due date: Oct 3, 2018
  • Project 2 (15%): TBA
    • Demo date: TBA
    • Report due: TBA

Prerequisites

• Knowledge of probability and algorithms
• Any program language for projects

Teaching materials

• Required Textbook:
  • Web data Mining - Exploring Hyperlinks, Contents and Usage Data, By Bing Liu, Second Edition, Springer, July 2011, ISBN 978-3-642-19459-7
• References
  • Data mining: Concepts and Techniques, by Jiawei Han and Micheline Kamber, Morgan Kaufmann Publishers, ISBN 1-55860-489-8.
  • Principles of Data Mining, by David Hand, Heikki Mannila, Padhraic Smyth, The MIT Press, ISBN 0-262-08290-X.
  • Introduction to Data Mining, by Pang-Ning Tan, Michael Steinbach, and Vipin Kumar, Pearson/Addison Wesley, ISBN 0-321-32136-7.
  • Machine Learning, by Tom M. Mitchell, McGraw-Hill, ISBN 0-07-042807-7
• Data mining resource site: KDnuggets Directory

Topics (subject to change, slides may be changed too)

1. Introduction
2. Data pre-processing
   • Data cleaning
   • Data transformation
   • Data reduction
   • Discretization
3. Association rules and sequential patterns (Sections 2.1 - 2.7)
   • Basic concepts
   • Apriori Algorithm
   • Mining association rules with multiple minimum supports
   • Mining class association rules
   • Sequetial pattern mining
   • Summary
4. Supervised learning (Classification) (Chapter 3)
   • Basic concepts
   • Decision trees
   • Classifier evaluation
   • Rule induction
   • Classification based on association rules
   • Naive-Bayesian learning
   • Naive-Bayesian learning for text classification
   • Support vector machines
   • K-nearest neighbor
   • Ensemble learning
   • Summary
5. Unsupervised learning (Clustering) (Chapter 4)
   • Basic concepts
   • K-means algorithm
   • Representation of clusters
   • Hierarchical clustering
   • Distance functions
   • Data standardization
   • Handling mixed attributes
   • Which clustering algorithm to use?
   • Cluster evaluation
   • Discovering holes and data regions
   • Summary
6. Semi-supervised learning (Sections 5.1.1, 5.1.2, 5.2.1 - 5.2.4)
   • LU learning: Learning from labeled and unlabeled examples
     • Learning from labeled and unlabeled examples using EM
     • Learning from labeled and unlabeled examples using co-training
   • PU learning: Learning from positive and unlabeled examples
7. Information retrieval and Web search (Sections 6.1 - 6.6, and 6.8)
   • Basic text processing and representation
   • Cosine similarity
   • Relevance feedback and Rocchio algorithm
8. Social network analysis (Sections 7.1 - 7.4)
   • Centrality and prestige
   • Citation analysis: co-citation and bibliographic coupling
   • The PageRank algoithm (of Google)
   • The HITS algorithm: authorities and hubs
   • Mining communities on the Web
9. Sentiment analysis and opinion mining (Sections 11.1 - 11.6; check out my two books)
   • Opinion mining problem: the abstraction
   • Document-level Sentiment classification
   • Sentence-level subjectivity and sentiment classification
   • Feature-level (aspect-level) sentiment analysis and summarization
   • Opinion Lexicon generation
   • Feature/aspect extraction
   • Opinion spam or fake review detection
10. Recommender systems and collaborative filtering (Section 12.4)
    • Content-based recommendation
    • Collaborative filtering based recommendation
      • K-nearest neighbor
      • Association rules
      • Matrix factorization
11. Web data extraction (Sections 9.1 and 9.2)
    • Wrapper induction
    • Automated extraction
12. Information integration (Section 10.8)

Projects - graded (you will demo your programs to me)

• Each group consists of 2 students, and will work on two assignments
  1. Algorithm implementation: TBA
  2. Research: TBA

Rules and Policies

• Statute of limitations: No grading questions or complaints, no matter how justified, will be listened to one week after the item in question has been returned.
• Cheating: Cheating will not be tolerated. All work you submitted must be entirely your own. Any suspicious similarities between students' work (this includes, exams and program) will be recorded and brought to the attention of the Dean. The MINIMUM penalty for any student found cheating will be to receive a 0 for the item in question, and dropping your final course grade one letter. The MAXIMUM penalty will be expulsion from the University.
• MOSS: Sharing code with your classmates is not acceptable!!! All programs will be screened using the Moss (Measure of Software Similarity.) system.
• Late assignments: Late assignments will not, in general, be accepted. They will never be accepted if the student has not made special arrangements with me at least one day before the assignment is due. If a late assignment is accepted it is subject to a reduction in score as a late penalty.