On Graph Entropy Measures for Knowledge Discovery from Publication Network Data - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

On Graph Entropy Measures for Knowledge Discovery from Publication Network Data

Abstract

Many research problems are extremely complex, making interdisciplinary knowledge a necessity; consequently cooperative work in mixed teams is a common and increasing research procedure. In this paper, we evaluated information-theoretic network measures on publication networks. For the experiments described in this paper we used the network of excellence from the RWTH Aachen University, described in [1]. Those measures can be understood as graph complexity measures, which evaluate the structural complexity based on the corresponding concept. We see that it is challenging to generalize such results towards different measures as every measure captures structural information differently and, hence, leads to a different entropy value. This calls for exploring the structural interpretation of a graph measure [2] which has been a challenging problem.
Fichier principal
Vignette du fichier
978-3-642-40511-2_25_Chapter.pdf (380.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01506782 , version 1 (12-04-2017)

Licence

Attribution

Identifiers

  • HAL Id : hal-01506782 , version 1

Cite

Andreas Holzinger, Bernhard Ofner, Christof Stocker, André Calero Valdez, Anne Kathrin Schaar, et al.. On Graph Entropy Measures for Knowledge Discovery from Publication Network Data. 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES), Sep 2013, Regensburg, Germany. pp.354-362. ⟨hal-01506782⟩
323 View
516 Download

Share

Gmail Facebook X LinkedIn More