Computational Aspects of the Mobius Transform

03/27/2013
by   Robert Kennes, et al.
0

In this paper we associate with every (directed) graph G a transformation called the Mobius transformation of the graph G. The Mobius transformation of the graph (O) is of major significance for Dempster-Shafer theory of evidence. However, because it is computationally very heavy, the Mobius transformation together with Dempster's rule of combination is a major obstacle to the use of Dempster-Shafer theory for handling uncertainty in expert systems. The major contribution of this paper is the discovery of the 'fast Mobius transformations' of (O). These 'fast Mobius transformations' are the fastest algorithms for computing the Mobius transformation of (O). As an easy but useful application, we provide, via the commonality function, an algorithm for computing Dempster's rule of combination which is much faster than the usual one.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8

04/22/2022

A Multigraph Approach for Performing the Quantum Schur Transform

We take inspiration from the Okounkov-Vershik approach to the representa...
03/17/2021

Accretive Computation of Global Transformations of Graphs

The framework of global transformations aims at describing synchronous r...
03/03/2010

Automatically Discovering Hidden Transformation Chaining Constraints

Model transformations operate on models conforming to precisely defined ...
11/13/2018

Task Graph Transformations for Latency Tolerance

The Integrative Model for Parallelism (IMP) derives a task graph from a ...
10/07/2021

Belief Evolution Network: Probability Transformation of Basic Belief Assignment and Fusion Conflict Probability

We give a new interpretation of basic belief assignment transformation i...
12/03/2020

Reversibility and Composition of Rewriting in Hierarchies

In this paper, we study how graph transformations based on sesqui-pushou...
07/15/2021

Efficient Möbius Transformations and their applications to Dempster-Shafer Theory: Clarification and implementation

Dempster-Shafer Theory (DST) generalizes Bayesian probability theory, of...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.