Threshold Functions and Operations in the Theory of Evidence

A. Lepskiy

doi:10.1007/978-3-031-67977-3_23

Publications

?

Threshold Functions and Operations in the Theory of Evidence

Ch. 23. P. 216–224.

Lepskiy A.

The article introduces and discusses threshold belief and plausibility functions. When forming such functions, only focal elements that are “significant” for a given set are taken into account. The significance of focal elements is determined using a similarity measure and a threshold. Threshold functionals of uncertainty, external and internal conflicts, threshold rules of combination are introduced and considered on the basis of threshold functions of the theory of evidence. A number of examples are given to illustrate the use of threshold tools.

Keywords: theory of evidence similarity measures

Publication based on the results of:

Models of data analysis and decision making in the socio-economic sphere (2024)

In book

Belief Functions: Theory and Applications: 8th International Conference, BELIEF 2024, Belfast, UK, September 2–4, 2024, Proceedings

Vol. 14909: Lecture Notes in Computer Science. , Cham: Springer, 2024.

Aggregation and Ranking on an Ordinal Scale Using Threshold Evidential Combination Rules

Lepskiy A., Procedia Computer Science 2024 Vol. 242 P. 444–451

A new method of aggregation and ranking on an ordinal scale is proposed based on the method of evidential ranking previously developed by the author, but using the tools of threshold aggregation of bodies of evidence. This method has better robustness and stability compared to the threshold-free method. The method allows you to take into ...

Added: September 14, 2024

Company name matching using job market data enrichment

Andrei A. Ternikov, IT Professional 2024 Vol. 26 No. 2 P. 76–82

This article contributes to the field of matching techniques by introducing a new algorithm based on labor market data enrichment. This approach is able to collect and balance the training and test samples for data integration purposes. By setting thresholds for textual matching and geographic proximity, it simplifies the process of finding suitable company matches. ...

Added: October 26, 2023

Quantum Logic and Natural Language Processing

Makarov I., Anastasia Frolenkova, Ivan Belov, , in: CLLS 2016. Computational Linguistics and Language Science. Proceedings of the Workshop on Computational Linguistics and Language Science. Moscow, Russia, April 26, 2016Vol. 1886.: Aachen: CEUR Workshop Proceedings, 2017. P. 135–140.

The paper presents a short summary on the applications of the quantum logic categorical constructions to the natural language processing. We give a brief overview on the topic of quantum logic in general, and in natural language processing, in particular. As a result, we discuss comparison of sentences and their representation in quantum logic formalism. ...

Added: June 25, 2017

Clustering techniques versus binary thresholding for detection of signal tracks in ionograms

Grachev A., Shiriy A., , in: SCAKD 2016 – The Second International Workshop on Soft Computing Applications and Knowledge Discovery. Proceedings of the Second International Workshop on Soft Computing Applications and Knowledge Discovery. July 18, 2016Vol. 1687.: CEUR Workshop Proceedings, 2016. P. 87–92.

An ionogram is a display of the data produced by an ionosonde. It is a graph of the virtual height of the ionosphere plotted against frequency. In addition to "useful signal", an ionogram almost always contains noise of different nature, a so called background noise. That is why the signal filtering task becomes so important. ...

Added: December 21, 2016

Annotated suffix trees for text clustering

Artemova E., Ilvovsky D., , in: The 3d International Workshop on Concept Discovery in Unstructured Data (CDUD 2016). Proceedings of the Third Workshop on Concept Discovery in Unstructured Data co-located with the 13th International Conference on Concept Lattices and Their Applications (CLA 2016), Moscow, Russia, July 18, 2016. CEUR Workshop ProceedingsVol. 1625.: Aachen: CEUR Workshop Proceedings, 2016. P. 25–31.

In this paper an extension of tf-idf weighting on annotated suffix tree (AST) structure is described. The new weighting scheme can be used for computing similarity between texts, which can further serve as in input to clustering algorithm. We present preliminary tests of us-ing AST for computing similarity of Russian texts and show slight im-provement ...

Added: October 26, 2016

Multiple Access Communications

Halmstad: Springer, 2014.

This book constitutes the refereed proceedings of the 7th International Workshop on Multiple Access Communications, MACOM 2014, held in Halmstad, Sweden, in August 2014. The 12 full papers presented were carefully reviewed and selected from 22 submissions. They describe the latest advancements in the field of multiple access communications with an emphasis on reliability issues, ...

Added: October 29, 2014

About Relation between the Measure of Conflict and Decreasing of Ignorance in Theory of Evidence

Lepskiy A., , in: Proceedings of the 8th conference of the European Society for Fuzzy Logic and Technology (EUSFLAT-13).: P., Beijing, Amsterdam: Atlantis Press, 2013. P. 355–362.

The conflict measure and index of decreasing of igno-rance in frame of Dempster-Shafer theory are intro-duced. Those functionals are analyzed on the bodies of evidences of special type. It is shown that the great correlation between the bodies of evidence is a sufficient condition of decreasing of ignorance after the applying of combining rule. The ...

Added: September 22, 2013