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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01506782
Contributor : Hal Ifip <>
Submitted on : Wednesday, April 12, 2017 - 11:19:12 AM
Last modification on : Thursday, February 8, 2018 - 4:20:02 PM
Long-term archiving on: Thursday, July 13, 2017 - 12:37:39 PM

File

978-3-642-40511-2_25_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

  • HAL Id : hal-01506782, version 1

Citation

Andreas Holzinger, Bernhard Ofner, Christof Stocker, André Calero Valdez, Anne 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⟩

Share

Metrics

Record views

335

Files downloads

409