Data Mining and Text Mining

• Programming assignments: TBA
• A small text mining research project: TBA

• Grading: live demo + code submission
• MOSS: Sharing code with your classmates is not acceptable!!! All programs will be screened using the Moss (Measure of Software Similarity.) system.

Prerequisites

• Knowledge of probability and algorithms
• Knowledge of any programming language for projects

Teaching materials

• Required Textbooks:
  • Web data Mining - Exploring Hyperlinks, Contents and Usage Data, By Bing Liu, Second Edition, Springer, July 2011, ISBN 978-3-642-19459-7
  • Lifelong machine learning, by Zhiyuan Chen and Bing Liu, Morgan & Claypool Publishers, 2018 (second edition).
  • Sentiment Analysis: Mining Opinions, Sentiments, and Emotions, by Bing Liu, Cambridge University Press, 2020 (second edition).
• References
  • Data mining: Concepts and Techniques, by Jiawei Han and Micheline Kamber, Morgan Kaufmann Publishers, ISBN 1-55860-489-8.
  • Introduction to Data Mining, by Pang-Ning Tan, Michael Steinbach, and Vipin Kumar, Pearson/Addison Wesley, ISBN 0-321-32136-7.
  • Data Miining. by Charu Aggarwal, Springer, 2015. ISBN 978-3-319-14142-8
  • Machine Learning, by Tom M. Mitchell, McGraw-Hill, ISBN 0-07-042807-7
  • Principles of Data Mining, by David Hand, Heikki Mannila, Padhraic Smyth, The MIT Press, ISBN 0-262-08290-X.
• Data mining resource site: KDnuggets Directory

Topics (subject to change; the reading list follows each chapter title)

1. Introduction
2. Data pre-processing
   • Data cleaning
   • Data transformation
   • Data reduction
   • Discretization
3. Association rules and sequential patterns (Sections 2.1 - 2.7)
   • Apriori Algorithm
   • Mining association rules with multiple minimum supports
   • Mining class association rules
   • Sequetial pattern mining
   • Summary
4. Supervised learning and Linear regression, gradient descent and neural networks (Chapter 3)
   • Decision tree induction
   • Classifier evaluation
   • Naive-Bayesian learning
   • Naive-Bayesian learning for text classification
   • Support vector machines
   • Linear regression and gradient descent
   • Neural Networks
   • K-nearest neighbor
   • Bagging and boosting
   • Summary
5. Unsupervised learning (Clustering) (Chapter 4)
   • K-means algorithm
   • Representation of clusters
   • Hierarchical clustering
   • Distance functions and data standardization
   • 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
   • PU learning: Learning from positive and unlabeled examples
   • Novelty (or out-of-distribution) detection
7. Introduction to Information retrieval and Web search (Sections 6.1 - 6.6, and 6.8)
   • Information retrievel models
   • 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
9. Sentiment analysis and opinion mining (Sections 11.1 - 11.6; check out my two books)
   • Sentiment analysis and emotion analysis problems
   • Document-level Sentiment classification
   • Sentence-level subjectivity and sentiment classification
   • Aspect-level sentiment analysis
   • Mining comparative opinions
   • Sentiment lexicon generation
10. Recommender systems
    • Content-based recommendation
    • Collaborative filtering based recommendation
      • K-nearest neighbor
      • Association rules
      • Matrix factorization
11. Lifelong and continual learning (the Lifelong Machine Learning book and research papers)
    • Introduction to lifelong/continual learning
    • Class and task continual learning
    • Out-of-Distribution Detection and Open-world learning
    • Learning after model deployment (on-the-job learning)

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.
• Late submission: Late submission of assignment or quiz will not be accepted unless it is due to some extraordinary circumstances.

UIC Conunseling Center

We value your mental health and emotional wellness as part of the UIC student experience. The UIC Counseling Center offers an array of services to provide additional support throughout your time at UIC, including workshops, peer support groups, counseling, self-help tools, and initial consultations to speak to a mental health counselor about your concerns. Please visit the Counseling Center website for more information (https://counseling.uic.edu/). Further, if you think emotional concerns may be impacting your academic success, please contact your faculty and academic advisers to create a plan to stay on track.

My Home Page