GRAPH MINING AND APPLICATIONS Canale unico

Docente coordinatore e verbalizzante: ARISTIDIS ANAGNOSTOPOULOS

Obiettivi formativi

Il corso presenterà modelli e algoritmi per l'analisi di grafi con applicazioni in vari ambiti. L'obiettivo alla fine del corso è che gli studenti conoscano algoritmi e framework che possano consentire loro di analizzare dati grafici di grandi dimensioni.

Risultati di apprendimento attesi

Graphs have applications in multiple areas, including social networks, bioinformatics, network medicine, computational chemistry, and they can be used to provide tools in these areas.

The course will present models and algorithms for the analysis of graphs as with applications on various areas. The goal at the end of the course, is for student to know algorithms and frameworks that can allow them to analyze large graph data, as well as be exposed to current topics of research in graph mining

Prerequisiti

- Knowledge of basic algorithms
- Programming
- Linear algebra
- Probability
- Neural networks

Programma dell’insegnamento

The course will include some of the following topics:

• Theoretical algorithms for graph modeling and analysis:
◦ Real graph properties and models (Gnp, preferential attachment, Kleinberg’s reachability)
◦ Models for propagation (linear threshold, cascade) and for opinion formation
◦ Homophily and influence and algorithms for identifying and distinguishing
◦ Influence maximization
◦ Algorithms for graph alignment
◦ Dense subgraphs, community detection, graph minors
◦ Graph summarization and sampling
• Machine-learning approaches:
◦ Label propagation
◦ Graph transformers
◦ Knowledge-graph emdeddings
◦ Models for analysis of temporal graphs
◦ Explainability
• Architectures for handling large graph data:
◦ Spark GraphsX
◦ AWS Neptune
◦ AWS GraphStorm
◦ Neo4J

Testi di riferimento

We will use some book chapters and current research publications.

Modalità di svolgimento

Regular Classes

Frequenza

Whereas class participation is strongly recommended, it is not obbligatory. However, student active participation in class (e.g., by making questions and responding to questions) will be rewarded.

Modalità di esame

The evaluation will include one or more of the following:
- homework problems
- presentations
- project

Esempi di domande

Questions related to the course program

Obiettivi per lo sviluppo sostenibile - Agenda ONU 2030

  • Goal2
  • Goal3
  • Anno accademico2026/2027
  • Corso di studio a cui afferisce l’insegnamentoEngineering in Computer Science and Artificial Intelligence - Ingegneria Informatica e Intelligenza Artificiale
  • Codice insegnamento10616533
  • Anno e semestre2º anno - 2º semestre
  • TipologiaAttività formative caratterizzanti
  • AmbitoIngegneria informatica
  • SSDING-INF/05
  • Presenza obbligatoriaNo
  • LinguaENG
  • CFU6 CFU
  • Durata complessiva60 ore
  • Distribuzione delle ore36 classroom hours, 24 training hours