activity
20172019
collaborators

7 papers

cs.AI2019

Query Optimization Properties of Modified VBS

Mieczysław A. Kłopotek, Sławomir T. Wierzchoń

Valuation-Based~System can represent knowledge in different domains including probability theory, Dempster-Shafer theory and possibility theory. More recent studies show that the f…

cs.AI2018

Reasoning and Facts Explanation in Valuation Based Systems

S. T. Wierzchoń, M. A. Kłopotek, M. Michalewicz

In the literature, the optimization problem to identify a set of composite hypotheses H, which will yield the largest where a composite hypothesis is an instantiatio…

cs.AI2018

On Marginally Correct Approximations of Dempster-Shafer Belief Functions from Data

Mieczysław A. Kłopotek, Sławomir T. Wierzchoń

Mathematical Theory of Evidence (MTE), a foundation for reasoning under partial ignorance, is blamed to leave frequencies outside (or aside of) its framework. The seriousness of th…

cs.SI2017

Network Capacity Bound for Personalized PageRank in Multimodal Networks

M. A. Kłopotek, S. T. Wierzchoń, R. A. Kłopotek

In a former paper the concept of Bipartite PageRank was introduced and a theorem on the limit of authority flowing between nodes for personalized PageRank has been generalized. In…

cs.AI2017

Knowledge Acquisition, Representation \& Manipulation in Decision Support Systems

M. Michalewicz, S. T. Wierzchoń, M. A. Kłopotek

In this paper we present a methodology and discuss some implementation issues for a project on statistical/expert approach to data analysis and knowledge acquisition. We discuss so…

cs.AI2017

Basic Formal Properties of A Relational Model of The Mathematical Theory of Evidence

Mieczysław A. Kłopotek, Sławomir T. Wierzchoń

The paper presents a novel view of the Dempster-Shafer belief function as a measure of diversity in relational data bases. It is demonstrated that under the interpretation The Demp…

cs.SI2017

Traditional PageRank versus Network Capacity Bound

Mieczysław A. Kłopotek, Sławomir T. Wierzchom, Robert A. Kłopotek +1

In a former paper we simplified the proof of a theorem on personalized random walk that is fundamental to graph nodes clustering and generalized it to bipartite graphs for a specif…