Real-world complex networks describe connections between objects; in reality, those objects are typically endowed with features. How does the presence or absence of such features interplay with the network link structure? The idea is to be able to represent a wide range of scenarios — not only homophily and heterophily. In this work, as a first thing we will present an ad-hoc statistical model, showing it displays the same global topological properties of a real-world social network. Then, we will use this model to design and analyze learning algorithms for graph mining problems – such as predicting links, anomaly detection, discovering missing features, and so on. Finally, we will present some results on real complex networks of different kinds (citation networks and semantic networks).

MODELING AND MINING COMPLEX NETWORKS WITH FEATURE-RICH NODES

MONTI, CORRADO
2017

Abstract

Real-world complex networks describe connections between objects; in reality, those objects are typically endowed with features. How does the presence or absence of such features interplay with the network link structure? The idea is to be able to represent a wide range of scenarios — not only homophily and heterophily. In this work, as a first thing we will present an ad-hoc statistical model, showing it displays the same global topological properties of a real-world social network. Then, we will use this model to design and analyze learning algorithms for graph mining problems – such as predicting links, anomaly detection, discovering missing features, and so on. Finally, we will present some results on real complex networks of different kinds (citation networks and semantic networks).
28-feb-2017
Inglese
complex networks; machine learning; social networks; graphs; data mining; graph mining; label prediction; link prediction
BOLDI, PAOLO
BOLDI, PAOLO
Università degli Studi di Milano
File in questo prodotto:
File Dimensione Formato  
phd_unimi_R10516.pdf

accesso aperto

Dimensione 6.24 MB
Formato Adobe PDF
6.24 MB Adobe PDF Visualizza/Apri

I documenti in UNITESI sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14242/80486
Il codice NBN di questa tesi è URN:NBN:IT:UNIMI-80486