|Type||Advanced Lecture (6 ECTS)|
|Lecturer||Dr. Jilles Vreeken|
|tada-staff (at) mpi-inf.mpg.de|
Thursdays, 10–12 o'clock in Room E1.7 0.01.
|Summary||In this advanced course we'll be investigating hot topics in data mining that the lecturer thinks are cool. This course is for those of you who are interested in Big Data Analytics, Data Science, Data Mining, Machine Learning – or, as the lecturer prefers to call it – Algorithmic Data Analysis. We'll be looking into how to discover significant and useful patterns from data, efficiently measure non-linear correlations and determine causal directions, as well as how to analyse large graphs and multi-linear structures.|
|April||20||Introduction, Practicalities||1st assignment out|
|27||Jilles travelling – no class|
|May||4||Interesting Patterns||deadline 1st, 2nd out|| 4–4.2||[8,9,10,11,12,13]|
|11||Mining Useful Patterns||||[14,15,16]|
|18||Jilles travelling – no class|
|24* (Wed)||Entropy and Information|| 2-2.4||[17,18]|
|June||1 (in E1.3 0.15)||Discovering Correlation||deadline 2nd, 3rd out||||[19,20,21]|
|8 (in E1.3 0.15)||Discovering Causation||||[22,23]|
|15||yay holiday – no class|
|22||Determining Significance|| 4.4||[24,25,26]|
|29||Subjective Interestingness||deadline 3rd, 4th out|| 5||[27,28,29]|
|13||Rumours in Graphs||||[33,34,35]|
|20||Wrap-Up with Ask me Anything|
|26||oral exams||deadline 4th|
* Wednesday May 24th at 12:00 till 14:00 in E1.7 Room 0.01
All required and optional reading will be made available. You will need a username and password to access the papers outside the MMCI/MPI network. Contact the lecturer if you don't know the username or password.
In case you do not have a strong enough background in data mining, machine learning, or statistics, these books may help to get you on your way [36,37,38] The university library kindly keeps hard copies of these books available in a so-called Semesteraparat.
|||Interesting Patterns. In Frequent Pattern Mining, Aggarwal, C. & Han, J., pages 105-134, Springer, 2014.|
|||Mining and Using Sets of Patterns through Compression. In Frequent Pattern Mining, Aggarwal, C. & Han, J., pages 165-198, Springer, 2014.|
|||Entropy, Relative Entropy, and Mutual Information. In Elements of Information Theory, Wiley-Interscience New York, 2006.|
|||New Evidence for the Theory of the Stork. Paediatric and Perinatal Epidemiology, 18(1):88-92, 2004.|
|||Causal Inference by Compression. In Proceedings of the IEEE International Conference on Data Mining (ICDM'16), IEEE, 2016.|
|||VoG: Summarizing Graphs using Rich Vocabularies. In Proceedings of the SIAM International Conference on Data Mining (SDM), Philadelphia, PA, pages 91-99, SIAM, 2014.|
|||Spotting Culprits in Epidemics: How many and Which ones?. In Proceedings of the 12th IEEE International Conference on Data Mining (ICDM), Brussels, Belgium, IEEE, 2012.|
|||Fast Discovery of Association Rules. In Advances in Knowledge Discovery and Data Mining, pages 307-328, AAAI/MIT Press, 1996.|
|||Efficiently mining long patterns from databases. In Proceedings of the ACM International Conference on Management of Data (SIGMOD), Seattle, WA, pages 85-93, 1998.|
|||Discovering Frequent Closed Itemsets for Association Rules. In Proceedings of the 7th International Conference on Database Theory (ICDT), Jerusalem, Israel, pages 398-416, ACM, 1999.|
|||Self-sufficient itemsets: An approach to screening potentially interesting associations between items. ACM Transactions on Knowledge Discovery from Data, 4(1):1-20, 2010.|
|||Tiling Databases. In Proceedings of Discovery Science, pages 278-289, 2004.|
|||Comparing Apples and Oranges: Measuring Differences between Data Mining Results. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Athens, Greece, pages 398-413, Springer, 2011.|
|||Krimp: Mining Itemsets that Compress. Data Mining and Knowledge Discovery, 23(1):169-214, Springer, 2011.|
|||Identifying the Components. Data Mining and Knowledge Discovery, 19(2):173-292, 2009.|
|||The Odd One Out: Identifying and Characterising Anomalies. In Proceedings of the 11th SIAM International Conference on Data Mining (SDM), Mesa, AZ, pages 804-815, Society for Industrial and Applied Mathematics (SIAM), 2011.|
|||A Mathematical Theory of Communication. The Bell System Technical Journal, 27:379-423, 623-656, 1948.|
|||Finding low-entropy sets and trees from binary data. In Proceedings of the 13th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Jose, CA, pages 350-359, 2007.|
|||Detecting Novel Associations in Large Data Sets. Science, 334(6062):1518-1524, 2011.|
|||On cumulative entropies. Journal of Statistical Planning and Inference, 139(2009):4072-4087, 2009.|
|||Multivariate Maximal Correlation Analysis. In Proceedings of the 31st International Conference on Machine Learning (ICML), Beijing, China, pages 775-783, JMLR, 2014.|
|||Causal Inference Using the Algorithmic Markov Condition. IEEE Transactions on Information Technology, 56(10):5168-5194, 2010.|
|||Information-geometric Approach to Inferring Causal Directions. , 182-183:1-31, 2012.|
|||Assessing data mining results via swap randomization. ACM Transactions on Knowledge Discovery from Data, 1(3), ACM, 2007.|
|||Tell me something I don't know: randomization strategies for iterative data mining. In Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Paris, France, pages 379-388, ACM, 2009.|
|||Randomization methods for assessing data analysis results on real-valued matrices. Statistical Analysis and Data Mining, 2(4):209-230, 2009.|
|||On the rationale of maximum-entropy methods. Proceedings of the IEEE, 70(9):939-952, IEEE, 1982.|
|||Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Mining and Knowledge Discovery, 23(3):407-446, Springer, 2011.|
|||Maximum Entropy Models for Iteratively Identifying Subjectively Interesting Structure in Real-Valued Data. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Prague, Czech Republic, pages 256-271, Springer, 2013.|
|||Fully automatic cross-associations. In Proceedings of the 10th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Seattle, WA, pages 79-88, 2004.|
|||Beyond Caveman Communities: Hubs and Spokes for Graph Compression and Mining. In Proceedings of the 11th IEEE International Conference on Data Mining (ICDM), Vancouver, Canada, pages 300-309, IEEE, 2011.|
|||Doulion: Counting Triangles in Massive Graphs with a Coin. In Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Paris, France, ACM, 2009.|
|||Finding effectors in social networks. In Proceedings of the 16th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Washington, DC, pages 1059-1068, ACM, 2010.|
|||Rumors in a Network: Who's the Culprit?. IEEE Transactions on Information Technology, 57(8):5163-5181, 2011.|
|||Hidden Hazards: Finding Missing Nodes in Large Graph Epidemics. In Proceedings of the SIAM International Conference on Data Mining (SDM'15), SIAM, 2015.|
|||Data Mining - The Textbook. Springer, 2015.|
|||Elements of Information Theory. Wiley-Interscience New York, 2006.|
|||All of Statistics. Springer, 2005.|
The course has two hours of lectures per week. There are no weekly tutorial group meetings. Instead, you will have to write four essays based on the material covered on the lectures and scientific articles assigned by the lecturer.
In general terms, the course will consist of
Students will individually do one assignment per topic – four in total. For every assignment, you will have to read one or more research papers and hand in a report that critically discusses this material and answers the assignment questions. Reports should summarise the key aspects, but more importantly, should include original and critical thought that show you have acquired a meta level understanding of the topic – plain summaries will not suffice. All sources you've drawn from should be referenced. The expected length of a report is 3 pages, but there is no limit.
The deadlines for the reports are at 10:00 Saarbrücken standard-time. You are free to hand in earlier.
The assignments will be graded in scale of Fail, Pass, Good, and Excellent. Any assignment not handed in by the deadline is automatically considered failed, and cannot be re-done. You are allowed to re-do one Failed assignment: you have to hand in the improved assignment within two weeks. Two failures mean you are not eligible for the exam, and hence failed the course.
You can earn up to three bonus points by obtaining Excellent or Good grades for the assignments. An Excellent grade gives you one bonus point, as do every two Good grades, up to a maximum of three bonus points. Each bonus point improves your final grade by 1/3 assuming you pass the final exam. For example, if you have two bonus points and you receive 2.0 from the final exam, your final grade will be 1.3. You fail the course if you fail the final exam, irrespective of your possible bonus points. Failed assignments do not reduce your final grade, provided you are eligible to sit the final exam.
The final exams will be oral. The final exam will cover all the material discussed in the lectures and the topics on which you did your assignments. The main exam will be on July 26th and 27th. The re-exam will be on a yet to be determined date. The exact time slot per student will be announced later. Inform the lecturer of any potential clashes as soon as you know them.
Students should have basic working knowledge of data analysis and statistics, e.g. by successfully having taken courses related to data mining, machine learning, and/or statistics, such as Information Retrieval and Data Mining, Machine Learning, Probabilistic Graphical Models, Statistical Learning, etc.