Subject

Knowledge discovery in big graph data

1.Course titleKnowledge discovery in big graph data
2.Codem23_s_025
3.Study programme—
4.Organizer of the study programme (unit, institute, department)Faculty of Computer Science and Engineering
5.Degree level (first, second, third cycle)Second cycle
6.Academic year / semester10 / Summer
7.Number of ECTS credits6
8.Teacher
9.Prerequisites for enrolling in the course—
10.Course objectives (competences)This course aims to introduce students in the field of knowledge detection in large graph organized data. Students will get acquainted with the challenges of processing large amounts of data, state -of -the -art methods and algorithms for graphs analysis, and the application of knowledge detection in large graph data in various application domains. Upon completion of the subject, students are expected to acquire:
- a thorough understanding of the basics of knowledge detection in graph data
- Ability to critical thinking about different methods and algorithms to extract knowledge
- Ability to formulate and solve problems that can be replicated in the domain of graphs
- Ability to analyze large data sets
11.Course contentIntroduction to Detecting Knowledge in Large Graf Data; Static graphs: laws and templates; Dynamic graphs: laws and templates; Link analysis: Random Walks, Pagerank, Hits; Classification of knots; The similarity of knots; Similarity of graphs; Alignment of graphs; Clustering graphs; Detecting non -collecting and overlapping communities; Prediction of relationships; Detection of anomalies; Frequent sub-grafts; Approximation and compression of graphs; Graphs representation; Deep learning in graphs; Areas of application: Detection of knowledge in protein interaction networks, detection of knowledge in brain networks, knowledge detection in social networks, knowledge detection in heterogeneous multimodal data, graph-based recommendation systems.
12.Learning methodsLectures supported by slide presentations, interactive lectures, exercises (using equipment and software packages), team work, case studies, guest lecturers, independent preparation and defense of a project assignment and a seminar paper, learning in an electronic environment (forums, consultations).
13.Total available time6 ECTS x 30 hours = 180 hours
14.Distribution of the available time60 + 0 + 45 + 45 + 30 = 180 hours
15.Forms of teaching activities
15.1.Lectures – theoretical teaching60 hours
15.2.Exercises (laboratory, auditory), seminars, team work0 hours
16.Other forms of activities
16.1.Project assignments45 hours
16.2.Individual assignments45 hours
16.3.Home study30 hours
17.Grading
17.1.Tests15 points
17.2.Seminar paper / project (presentation: written and oral)45 points
17.3.Activity and participation15 points
17.4.Final exam0 points
18.Grading criteria (points / grade)
up to 50 points5 (five) (F)
from 51 to 60 points6 (six) (E)
from 61 to 70 points7 (seven) (D)
from 71 to 80 points8 (eight) (C)
from 81 to 90 points9 (nine) (B)
from 91 to 100 points10 (ten) (A)
19.Requirements for signature and taking the final examNULL
20.Language of instructionMacedonian and English
21.Method of monitoring teaching qualityInternal evaluation and survey mechanism
22.Literature
22.1.Required literature
1. Easley, D. and Kleinberg, J. | Networks, crowds, and markets: Reasoning about a highly connected world | Cambridge University Press | 2010
2. Aggarwal, C.C. and Wang, H. | Managing and mining graph data (Vol. 40) | New York: Springer. | 2010
3. Guido Caldarelli and Alessandro Chessa | Data Science and Complex Networks: Real Case Studies with Python | Oxford University Press | 2016
4. Chakrabarti, D. and Faloutsos, C. | Graph mining: laws, tools, and case studies. Synthesis Lectures on Data Mining and Knowledge Discovery | Morgan & Claypool | 2012
5. William L. Hamilton | Graph Representation Learning | McGill | 2020
22.2.Additional literature
No. Author Title Publisher Year