Mon-Wed 4:00-5:30 pm
Data mining is the analysis of (often large) observational datasets to find unsuspected relationships and to summarize the data in novel ways that are both understandable and useful to the data analyst (Hand, Mannila and Smyth: Principles of Data Mining)
The goal of this course is to provide an introduction to the main topics in data mining including: frequent-itemset mining, clustering, classification, link-analysis ranking, dimensionality reduction etc. The focus of the course will be on the algorithmic issues as well as applications of data mining to real-world problems. Students will be required to solve small written and programming assignments that will help them better understand the covered material.
Three programming projects
Three problem sets
Two exams; one midterm and one final
Working knowledge of programming and data structures (CS 112, or equivalent). Familiarity with basic algorithmic concepts, probability, statistics and linear algebra. Programming projects will require knowledge of C (or C), java or python.
Many of these slides have been borrowed by lectures, talks and tutorials prepared by: Aris Anagnostopoulos, Petros Drineas, Piotr Indyk, George Kollios, Heikki Mannila, Panayiotis Tsaparas, Jeffrey Ullman.
The lectures on classification are using the slides from the book ‘‘Introduction to Data Mining" by Tan, Steinbach, Kumar, available here.
|Sept 4||What is datamining/ Introductory lecture||.pptx,.pdf|
|Sept 11,13||Mining Association rules||.pptx,.pdf|
|Sept 17,19||Compressing Frequent Itemsets||.pptx, .pdf|
|Sept 19||Homework 1 posted; due Oct 3, 2012||homework|
|Sept 24, 26||Introduction to Clustering||.pptx,.pdf|
|Oct 1||Project 1 posted; due Oct 15, 2012||project|
|Oct 9 (Monday Schedule)||Guest Lecture|
|Oct 10||Clustering Aggregation||.pptx,.pdf|
|Oct 15||Complementary class|
|Oct 16||Homework 2 posted; due Oct 29, 2012||homework|
|Oct 17||Complementary class|
|Oct 22||Project 2 posted; due Nov 5, 2012||project|
|Oct 22||Hierarchical Clustering||.pptx,.pdf|
|Oct 24||Dimensionality Reduction||.pptx,.pdf|
|Oct 29||No class|
|Oct 31||Exam Review|
|Nov 7,12, 14||Nearest-neighbor search||.pptx.pdf|
|Nov 21||Thanksgiving Break|
|Nov 23||Homework 3 posted; due Dec 12, 2012||homework|
|Nov 23||Project 3 posted; due Dec 14, 2012||project|
|Nov 26||Naive Bayes||.pptx.pdf|
|Nov 28||Evaluation of Classification Methods||.pptx.pdf|
|Dec 3||Link Analysis Ranking||.pptx.pdf|
|Dec 5||Voting Theory||.pptx.pdf|
|Dec 10||Graph Clustering||.pptx.pdf|
|Week starting Dec 17||Final Exam|
Rakesh Agrawal and Ramakrishnan Srikant: Fast Algorithms for Mining Association Rules. In International Conference on Very Large Databases, VLDB 1994.
Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, and A. Inkeri Verkamo: Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, 307 - 328. AAAI Press, 1996.
Roberto J. Bayardo Jr.: Efficiently Mining Long Patterns from Databases. In SIGMOD Conference 1998: 85-93
F. Afrati, A. Gionis, H. Mannila: Approximating a Collection of Frequent Sets. In International Conference on Knowledge Discovery and Data Mining (SIGKDD), 2004.
A. Gionis, H. Mannila, P. Tsaparas: Clustering Aggregation. In ACM Transactions on Knowledge Discovery from Data (TKDD), 2006.
Jon Kleinberg: An impossibility theorem for clustering. In NIPS, 2002.
A. Anagnostopoulos, A. Dasgupta, R. Kumar: Approximation algorithms for co-clustering. In PODS, 2008.
Kai Puolamaki, Sami Hanhijarvi, Gemma C. Garriga: An approximation ratio for biclustering. In Information Processing Letters, 2008.
Rakesh Agrawal , Johannes Gehrke , Dimitrios Gunopulos , Prabhakar Raghavan: Automatic subspace clustering for high-dimensional data. In SIGMOD, 1998.
Christos Faloutsos, King-Ip Lin: FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In SIGMOD 1995.
Dimitris Achlioptas: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. In Journal of Comp. & Sys. Sci.,special issue of invited papers from PODS’01.
Ella Bingham, Heikki Mannila: Random projection in dimensionality reduction: Applications to image and text data. In KDD, 2001.
For MDS read: Programming Collective Intelligence: Building Smart Web 2.0 Applications, Chapter 3, pages 49-52.
For Petros Drineas’ tutorials on linear-algebra methods for data mining see here.
Taher H. Haveliwala, Aristides Gionis, Dan Klein, Piotr Indyk: Evaluating strategies for similarity search on the web. In WWW Conference 2002.
Aristides Gionis, Piotr Indyk, Rajeev Motwani:Similarity Search in High Dimensions via Hashing. In VLDB 1999.
J. Kleinberg. Authoritative sources in a hyperlinked environment. Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, 1998.
S. Brin, R. Motwani, L. Page and T. Winograd: The PageRank Citation Ranking: Bringing Order to the Web. Technical Report, Stanford Digital Libraries, 1998.
A. Borodin, J. S. Rosenthal, G. O. Roberts, P. Tsaparas: Link Analysis Ranking: Algorithms, Theory and Experimets. ACM Transactions on Internet Technologies (TOIT), Vol 5, No 1, February 2005.
David Cheng, Ravi Kannan, Santosh Vempala and Grant Wang:A Divide-and- Merge methodology for Clustering In ACM SIGMOD/PODS, 2005.
Ravi Kannan and Santosh Vempala and Andrian Vetta: On Clusterings: Good, Bad and Spectral. In the Journal of the ACM, May 2004.
E. Terzi and P. Tsaparas: Efficient algorithms for sequence segmentation. In Siam Data Mining Conference (SDM), 2006.
There is no required textbook for the course. Suggested textbooks are:
D. Hand, H. Mannila and P. Smyth: Principles of Data Mining. MIT Press, 2001
Jiawer Han and Micheline Kamber: Data Mining: Concepts and Techiques. Second Edition. Morgan Kaufmann Publishers, March 2006.
Toby Segaran: Programming Collective Intelligence: Building Smart Web 2.0 Applications. O’Reilly.
Programming Projects (3) 30%
Problem Sets (3) 20%
Final Exam 30%
Incompletes will not be given
Late Assignment Policy: There will be a penalty of 10% per day, up to three days late. After that no credit will be given.
All course participants must adhere to the CAS Academic Conduct Code. All instances of adacemic dishonesty will be reported to the academic conduct committee.