buildTree: Build a tree of...

In RAPLER/dst-1: Using the Theory of Belief Functions

Build a tree of...

Description

Build a tree of...

Usage

buildTree(tt, qq, indices = NULL)

Arguments

tt	A (0,1)-matrix or a boolean matrix. The number of columns must match the number of elements (values) of the Frame of Discernment (FoD).
q	Commonality values of the tt matrix.

Details

A tree structure of commonalities is built from the binary matrix tt. This tree structure can then be used with large frames of discernment to optimize the combination of support functions.

Value

tree The tree structure.

Author(s)

Peiyuan Zhu

References

Chaveroche, Franck Davoine, Véronique Cherfaoui. Efficient Möbius Transformations and their applications to Dempster-Shafer Theory: Clarification and implementation. ArXiv preprint arXiv:2107.07359.

Examples

# Example from figure 12 of the cited reference.
 x <- matrix(c(1,0,0,
 0,0,1,
 0,1,1,
 1,1,1), nrow = 4, byrow = TRUE, dimnames = list(NULL,c("a","b","c")))
 rownames(x) <- nameRows(x)
 m <- c(0.1,0.2,0.3,0.4)
 q <- commonality(x,m,"ezt-m")
 q_tree <- buildTree(x,q)

RAPLER/dst-1 documentation built on June 2, 2025, 9:22 a.m.