|
- Web Information Systems (CS 246), by Prof. Junghoo Cho
- Advanced Algorithms (CS 280A) by Prof. Adam Meyerson
- Graphs and Networks (CS 280G), by Prof. Sheila Greibach
- Advanced Topics in Automata Theory (CS 284A), by Prof. Rupak Majumdar
- Databases and Knowledge Bases (CS 240A), by Prof. Carlo Zaniolo
- Principles of Data Mining (CS 249), by Prof. D. Stat Parker
- Advanced Knowledge Base Systems (CS 240B), by Prof. Carlo Zaniolo
- Computer-Aided Verification (CS 234), by Prof. Rupak Majumdar
- Parallel Programming Languages (CS 239), by Prof. Jens Palsberg
- Reasoning with Partial Beliefs (CS 262A), by Prof. Adnan Darwiche
- Complexity Theory (CS 289CO), by Prof. Amit Sahai
SWIM (Sliding Window Incremental Miner). Swim is a verification-based approach to the popular frequent pattern mining problem, where by verification we mean conditional counting. You can find the main paper introducing SWIM and its fast verifiers here. In addition to the stream mining scenario, as shown in the aforementioned paper, we have found other potential applications for our verifiers, including stream monitoring, privacy preserving association rule mining, enhancing traditional static frequent pattern mining. You may find other benefits of having a fast conditional counter (=verifier) in your own application. Therefore, we have made our implementations available online. You can obtain the latest implementation of SWIM (and its underlying verifiers), as long as it is solely used for academic purposes (e.g. comparing against your own algorithm, benchmark, boosting your own approach, etc), and you mention the original source.