%0 Conference Proceedings
%T On Graph Entropy Measures for Knowledge Discovery from Publication Network Data
%+ Research Unit Human-Computer Interaction for Medicine & Health Care (HCI4MED)
%+ Human-Computer Interaction Center at RWTH Aachen University
%+ Institute for Bioinformatics and Translational Research [Tyrol]
%A Holzinger, Andreas
%A Ofner, Bernhard
%A Stocker, Christof
%A Calero Valdez, André
%A Schaar, Anne, Kathrin
%A Ziefle, Martina
%A Dehmer, Matthias
%Z Part 1: Cross-Domain Conference and Workshop on Multidisciplinary Research and Practice for Information Systems (CD-ARES 2013)
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES)
%C Regensburg, Germany
%Y Alfredo Cuzzocrea
%Y Christian Kittl
%Y Dimitris E. Simos
%Y Edgar Weippl
%Y Lida Xu
%I Springer
%3 Availability, Reliability, and Security in Information Systems and HCI
%V LNCS-8127
%P 354-362
%8 2013-09-02
%D 2013
%K Network Measures
%K Graph Entropy
%K structural information
%K graph complexity measures
%K structural complexity
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01506782/document
%2 https://inria.hal.science/hal-01506782/file/978-3-642-40511-2_25_Chapter.pdf
%L hal-01506782
%U https://inria.hal.science/hal-01506782
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-WG
%~ IFIP-TC9
%~ IFIP-TC8
%~ IFIP-CD-ARES
%~ IFIP-WG8-4
%~ IFIP-WG8-9
%~ IFIP-LNCS-8127