Computer Science – Discrete Mathematics
Scientific paper
2008-06-13
Journal of Informetrics, volume 4, number 1, pages 29-41, 2009
Computer Science
Discrete Mathematics
ISSN:1751-1577
Scientific paper
10.1016/j.joi.2009.06.004
Many, if not most network analysis algorithms have been designed specifically for single-relational networks; that is, networks in which all edges are of the same type. For example, edges may either represent "friendship," "kinship," or "collaboration," but not all of them together. In contrast, a multi-relational network is a network with a heterogeneous set of edge labels which can represent relationships of various types in a single data structure. While multi-relational networks are more expressive in terms of the variety of relationships they can capture, there is a need for a general framework for transferring the many single-relational network analysis algorithms to the multi-relational domain. It is not sufficient to execute a single-relational network analysis algorithm on a multi-relational network by simply ignoring edge labels. This article presents an algebra for mapping multi-relational networks to single-relational networks, thereby exposing them to single-relational network analysis algorithms.
Rodriguez Marko A.
Shinavier Joshua
No associations
LandOfFree
Exposing Multi-Relational Networks to Single-Relational Network Analysis Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Exposing Multi-Relational Networks to Single-Relational Network Analysis Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exposing Multi-Relational Networks to Single-Relational Network Analysis Algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-123547