The reducibility of matrix sweeping operations: a computational issue in linear belief functions

DOI10.1016/J.IJAR.2019.08.014zbMath1468.68226OpenAlexW2971693603MaRDI QIDQ2302800

Liping Liu

Publication date: 26 February 2020

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2019.08.014

zbMATH Keywords

reducibilitylinear modelsbelief functionslinear belief functionssweeping operations

Mathematics Subject Classification ID

Knowledge representation (68T30)

Uses Software

• AS 178
• AS 37
• AS 141

Cites Work

• Allocations of probability
• A new matrix addition rule for combining linear belief functions
• A theory of Gaussian belief functions
• Manifestations of the Schur complement
• Imaginary numbers for combining linear equation models via Dempster's rule
• Classic works on the Dempster-Shafer theory of belief functions
• Determination of the inertia of a partitioned Hermitian matrix
• Belief functions on real numbers
• A Tutorial on the SWEEP Operator
• Analyzing linear regression models with hints and the dempster-shafer theory
• Risk, Return and International Portfolio Analysis: Entropy and Linear Belief Functions
• Upper and Lower Probabilities Induced by a Multivalued Mapping
• Algorithm AS 141: Inversion of a Symmetric Matrix in Regression Models
• Linear Belief Functions for Data Analytics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The reducibility of matrix sweeping operations: a computational issue in linear belief functions