
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Many, if not most network analysis algorithms have been designed specifically for singlerelational 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 multirelational network is a network with a heterogeneous set of edge labels which can represent relationships of various types in a single data structure. While multirelational 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 singlerelational network analysis algorithms to the multirelational domain. It is not sufficient to execute a singlerelational network analysis algorithm on a multirelational network by simply ignoring edge labels. This article presents an algebra for mapping multirelational networks to singlerelational networks, thereby exposing them to singlerelational network analysis algorithms.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment