As an extension of probability theory, evidence theory is able to better handle unknown and imprecise information. Owing toits advantages, evidence theory has more flexibility and effectiveness for modeling and processing uncertain information.Uncertainty measure plays an essential role both in evidence theory and probability theory.In probability theory, Shannon entropy provides a novel perspective for measuring uncertainty. Various entropies exist for measuring the uncertainty of basic probability assignment (BPA) in evidence theory. However, from the standpoint of the requirements of uncertainty measurement and physics, these entropies are controversial. Therefore, the process for measuring BPA uncertainty currently remains an open issue in the literature.Firstly, this paper reviews the measures of uncertainty in evidence theory followed by an analysis of some related controversies. Secondly, we discuss the development of Deng entropy as an effective way to measure uncertainty, including introducing its definition, analyzing its properties, and comparing it to other measures. We also examine the concept of maximum Deng entropy, the pseudo-Pascal triangle of maximum Deng entropy, generalized belief entropy, and measures of divergence.In addition, we conduct an analysis of the application of Deng entropy and further examine the challenges for future studies on uncertainty measurement in evidence theory. Finally, a conclusion is provided to summarize this study.

Uncertainty measure in evidence theory

PPascal triangle (known as Yang Hui Triangle in Chinese) is an important model in mathematics while the entropy has been heavily studied in physics or as uncertainty measure in information science. How to construct the the connection between Pascal triangle and uncertainty measure is an interesting topic. One of the most used entropy, Tasllis entropy, has been modelled with Pascal triangle. But the relationship of the other entropy functions with Pascal triangle is still an open issue. Dempster-Shafer evidence theory takes the advantage to deal with uncertainty than probability theory since the probability distribution is generalized as basic probability assignment, which is more efficient to model and handle uncertain information. Given a basic probability assignment, its corresponding uncertainty measure can be determined by Deng entropy, which is the generalization of Shannon entropy. In this paper, a Pseudo-Pascal triangle based the maximum Deng entropy is constructed. Similar to the Pascal triangle modelling of Tasllis entropy, this work provides the a possible way of Deng entropy in physics and information theory.

http://univagora.ro/jour/index.php/ijccc/article/download/1006/1371

The Pseudo-Pascal Triangle of Maximum Deng Entropy

In this paper, uncertainty has been measured in the form of fuzziness which arises due to imprecise boundaries of fuzzy sets. Uncertainty caused due to human's cognition can be decreased by the use of fuzzy soft sets. There are different approaches to deal with the measurement of uncertainty. The method we proposed uses fuzzified evidence theory to calculate total degree of fuzziness of the parameters. It consists of mainly four parts. The first part is to measure uncertainties of parameters using fuzzy soft sets and then to modulate the uncertainties calculated. Afterward, the appropriate basic probability assignments with respect to each parameter are produced. In the last, we use Dempster's rule of combination to fuse independent parameters into integrated one. To validate the proposed method, we perform an experiment and compare our outputs with grey relational analysis method. Also, a medical diagnosis application in reference to COVID-19 has been given to show the effectiveness of advanced method by comparing with other method.

/pdf/an-advanced-uncertainty-measure-using-fuzzy-soft-sets-2gfb7pfuuu.pdf

An advanced uncertainty measure using fuzzy soft sets: Application to decision-making problems

Information volume fractal dimension

The extropy has recently been introduced as the dual concept of entropy. Moreover, in the context of the Dempster–Shafer evidence theory, Deng studied a new measure of discrimination, named the Deng entropy. In this paper, we define the Deng extropy and study its relation with Deng entropy, and examples are proposed in order to compare them. The behaviour of Deng extropy is studied under changes of focal elements. A characterization result is given for the maximum Deng extropy and, finally, a numerical example in pattern recognition is discussed in order to highlight the relevance of the new measure.

https://www.mdpi.com/1099-4300/22/5/582/pdf

A Dual Measure of Uncertainty: The Deng Extropy.

For Dempster–Shafer evidence theory, how to measure the uncertainty of basic probability assignment (BPA) is still an open question. Deng entropy is one of the methods for measuring the uncertainty of Dempster–Shafer evidence. Recently, some limitations of Deng entropy theory are found. For overcoming these limitations, some modified theories are given based on Deng entropy. However, only one special situation is considered in each theory method. In this paper, a unified form of the belief entropy is proposed on the basis of Deng entropy. In the new proposed method, the scale of the frame of discernment (FOD) and the relative scale of a focal element with reference to FOD are considered. Meanwhile, for an example, some properties of the belief entropy are obtained based on a special situation of a unified form. Some numerical examples are illustrated to show the efficiency and accuracy of the proposed belief entropy.

https://www.mdpi.com/1099-4300/21/10/987/pdf

A New Belief Entropy Based on Deng Entropy

A new centrality ranking method for multilayer networks

The interactions between layers of a multiplex network would generate new structural features, the most prominent feature being the existence of link overlaps between layers. How to capture the associations with the network behavior through the structural interaction between the combined layers of the multiplex network is a critical issue. In this paper, a new structure entropy is proposed by combining the overlapping links between the combined layers of a multiplex network. The correlation between layers is evaluated by structure entropy, and the results are consistent with the behaviors exhibited by the network. In addition, the validity and applicability of the proposed method were verified by conducting trials on four sets of real multiplex network data, which included the multiplex social network of a research department at Aarhus, tailor shop multiplex network, C. elegans multiplex network, and the network collected by Vickers from 29 seventh grade students in a school in Victoria.

/pdf/correlation-analysis-of-combined-layers-in-multiplex-1qre1hcp.pdf

Correlation analysis of combined layers in multiplex networks based on entropy

For multi-attribute decision-making (MADM), how to aggregate data and determine attribute weight is still an open issue. Ordered visibility graph aggregation (OVGA) operator can objectively and effectively determine the weight of each attribute value in the network and solve the problem of data fusion. OVGA not only considers the attribute values of nodes in the network, but also synthesizes the influence of the distance between nodes on the weight distribution. However, when there are multiple identical attribute values in the network, the weights assigned by this method are unreasonable. This paper proposes an improved OVGA operator method based on OVGA, which redefines the distance between visual nodes. When there are multiple identical attribute values in the network, the distance formula is redefined in the form of a piecewise function, so that equivalent nodes are given the same weight. The improved method proposed in this paper not only considers the correlation between the visible nodes, but also fully considers the rationality of the weight distribution of the equivalent node support after the fusion of the entire network data. Meanwhile, through several practical application examples which including an application in produced water management, Dongping reservoir tourism resources and the academic ranking of world universities to illustrate the effectiveness and practicability of this method for MADM in complex networks.

An improved ordered visibility graph aggregation operator for MADM

A complex network has been widely used to reveal the rule of a complex system. How to convert the stock data into a network is an open issue since the stock data are so large and their random volatility is strong. In this paper, a seasonal trend decomposition procedure based on the loess ( S T L) method is applied to convert the stock time series into a directed and weighted symbolic network. Three empirical stock datasets, including the closing price of Shanghai Securities Composite Index, S&P 500 Index, and Nikkei 225 Index, are considered. The properties of these stock time series are revealed from the topological characteristics of corresponding symbolic networks. The results show that: (1) both the weighted indegree and outdegree distributions obey the power-law distribution well; (2) fluctuations of stock closing price are revealed by related network topological properties, such as weighting degree, betweenness, pageranks, and clustering coefficient; and (3) stock closing price, in particular, periods such as financial crises, can be identified by modularity class of the symbolic networks. Moreover, the comparison between the S T L method and the visibility graph further highlights the advantages of the S T L method in terms of the time complexity of the algorithm. Our method offers a new idea to study the network conversion of stock time series.

An empirical study on network conversion of stock time series based on STL method.

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Dan Wang

Author Tools

Chat about Author