Logo del repository
  1. Home
 
Opzioni

Graph embedding via dissimilarity mapping for network comparison

DE STEFANO, DOMENICO
2012
  • conference object

Abstract
A key issue in social network analysis is related to the comparison between K observed networks. To this end, a special graph embedding procedure within the so-called dissimilarity representation framework is proposed. The procedure is mainly based on the use of an appropriate metric among the observed networks, that is the graph edit distance. Particular attention is devoted also to the dimensionality reduction of the embedding. The purpose is to provide a measure of the distances among the K observed networks, embedding them as points in a multivariate space.We will show applications in both exploratory social network analysis and network statistical modeling.
Archivio
http://hdl.handle.net/11368/2634828
Diritti
metadata only access
Soggetti
  • Networks comparison

  • graph embedding

  • graph edit distance

  • social network analy...

google-scholar
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your nstitution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Realizzato con Software DSpace-CRIS - Estensione mantenuta e ottimizzata da 4Science

  • Impostazioni dei cookie
  • Informativa sulla privacy
  • Accordo con l'utente finale
  • Invia il tuo Feedback