## 주별 개요

• ### Mining Massive Data Sets 2024

#### USEFUL LINKS / KORISTNE POVEZAVE

Course website / Spletna stran predmeta: http://web.stanford.edu/class/cs246/

Important info / Pomembne informacije:

Classes / Predavanja

Reference text / Knjiga: http://www.mmds.org/

Weekly Colab notebooks:

• you will find them directly on the http://web.stanford.edu/class/cs246/ website,
• they are posted every Thursday,
• due one week later on Thursday 23:59 Pacific Time (PT), but rather submit earlier!
• submit via this website (below).

• 4 homework assignments requiring coding and theory (40%)
• Final exam (30%)
• Weekly Colab notebooks (30%)

• ### Prosojnice in dodatna gradiva / Slides and supplementary materials

• Potrebe po izboljšanju odkrivanja skupin vedno bolj zahtevajo možnost interakcije z domenskimi eksperti, kar je vodilo do razvoja algoritmov odkrivanja skupin z omejitvami (angl. constrained clustering). Ti algoritmi uporabljajo domensko znanje v obliki pozitivnih (angl. must-link) in negativnih omejitev (angl. cannot-link) na pare učnih primerov, kar omogoča izboljšanje procesa odkrivanja skupin...

• A template for the hubs-and-authorities algorithm - HITS (hyperlink-induced topic search).

• V magistrskem delu, ki je rezultiralo v objavi spodnjega članka v ugledni znanstveni reviji Mathematics, uporabimo moderne pristope strojnega učenja na grafih za pohitritev dinamičnega algoritma za iskanje maksimalne klike.

Kristjan Reba, Matej Guid, Kati Rozman, Dušanka Janežič, and Janez Konc.
Exact maximum clique algorithm for different graph types using machine learning.
Mathematics 10, no. 1 (2022): 97.
• ### Colab notebooks

Submit Colab notebooks here; every week no later than Friday 9 am.

Your submission should contain a ZIP file:

• Jupyter notebook in HTML format (download the jupyter notebook file and then use the command "jupyter nbconvert --to html <file_name.ipynb>" in the command prompt).
• A text file with answers to the questions (the submission page will always contain a document with questions).

Each file should use the following naming convention: colab<number>_<name>_<surname>.html (or .txt).

• ### Homework Submissions

Your submission (every second Friday 9:00 CET) should be a ZIP file containing three files:

• file <name>_<surname>.pdf: written report.
• file <name>_<surname>.zip: all the requested code. Use subfolders ("q1", "q2", ...) for partiqular questions. Include at least .ipynb and .html files, .py files are welcome too.
• Cover sheet (make sure you state your collaborators and the date of submission).

Note that you submit the homeworks only here on Ucilnica. You do not submit anything to GradeScope or SNAP website!

Late days: you are allowed to use the “late days” twice with your homework (but only once per particular homework!). Do not submit your homework later than Tuesday 9:00 CET, the first Tuesday after the regular deadline.

• ### Exam

The exam will be held on Monday, March 11, at 17:00 in P19. It will start exactly at 17:15, right after you receive the printed exams.

• The exam is worth 30% of your course grade.
• It is a 3-hour exam, meaning it will last 180 minutes.

This exam is open-book and open-notes. You may use notes (digitally created notes are allowed) and/or lecture slides and/or any reference material. However, answers should be written in your own words.

Acceptable uses of computer:

• You may access the Internet, but you may not communicate with any other person. Similarly, AI-driven code completion tools including ChatGPT and GitHub Copilot are not allowed.
• You may use your computer to write code or do any scientific computation, though writing code is not required to solve any of the problems in this exam.
• You can use your computer as a calculator or an e-reader.

• See the "Final Exam Review Session" lecture in the Winter Course 2022.