Course Information
- Location: Orenstein 103
- Time: Sundays, 17:00 - 20:00
Course Instructor:
Course Goals and Short Syllabus:
Today we cannot imagine our life without social networks. The interest in analyzing social networks, their structure, predicting expected behavior of the users in social networks increased in the past years.
This course will focus on social networks and especially online social networks, bringing together both algorithms (from "classic" to recent state-of-the-art) and applications for these networks.
The course will involve both theoretical parts (such as formal definition of social network, measurements in social networks, network formation, community detection algorithms and more) and practical parts (including hands-on programming using Python and libraries such as NetworkX).
In addition to covering fundamental issues in social networks, we will focus on practical real world tasks, including the trends from the last years.
For practice, we will use publicly available datasets of social networks and demonstrate solution of real life challenges.
Course Format:
Each class will be a 3 hours lecture which will include both theoretical and practical parts.
Homework - 3 HW assignments during the semester (submission in pairs) - 15% of the final grade
Final exam - 85% of the final grade
Exam - Moed A: 21.01.2027
Exam - Moed B: 17.02.2027
Requirements:
Homework
Course Schedule
Previous exams
| Year |
Exams |
| 2024/25, Semester A |
Moed A, Moed B |
| 2023/24, Semester A |
Moed A, Moed B |
| 2022/23, Semester A |
Moed A, Moed B |
| 2021/22, Semester A |
Moed A, Moed B |
| 2020/21, Semester A |
Moed A, Moed B |
| 2019/20, Semester B |
Moed A, Moed B |
| 2018/19, Semester B |
Moed A, Moed B, Moed C |
| 2017/18, Semester B |
Sample, Moed A, Moed B |
