Negation of the Quantum Mass Function for Multisource Quantum Information Fusion With its Application to Pattern Classification

Random walk in random permutation set theory

Random walk is an explainable approach for modeling natural processes at the molecular level. The random permutation set theory (RPST) serves as a framework for uncertainty reasoning, extending the applicability of Dempster-Shafer theory. Recent explorations indicate a promising link between RPST and random walk. In this study, we conduct an analysis and construct a random walk model based on the properties of RPST, with Monte Carlo simulations of such random walk. Our findings reveal that the random walk generated through RPST exhibits characteristics similar to those of a Gaussian random walk and can be transformed into a Wiener process through a specific limiting scaling procedure. This investigation establishes a novel connection between RPST and random walk theory, thereby not only expanding the applicability of RPST but also demonstrating the potential for combining the strengths of both approaches to improve problem-solving abilities.

Research on dependent evidence combination based on principal component analysis

Dempster-Shafer evidence theory, as a generalization of probability theory, is a powerful tool for dealing with a variety of uncertainties, such as incompleteness, ambiguity, and conflict. Because of its advantages in information fusion compared with traditional probability theory, it is widely used in various fields. However, the classic Dempster's combination rule assumes that evidences are independent of each other, which is difficult to satisfy in real life. Ignoring the dependence among the evidences will lead to unreasonable fusion results, and even wrong conclusions. Considering the limitations of D-S evidence theory, this paper proposed a new evidence fusion model based on principal component analysis (PCA) to deal with the dependence among evidences. First, the approximate independent principal components of each information source were obtained based on principal component analysis. Second, the principal component data set was used as a new information source for evidence theory. Third, the basic belief assignments (BBAs) were constructed. As the fundamental construct of evidence theory, a BBA is a probabilistic function corresponding to each hypothesis, quantifying the belief assigned based on the evidence at hand. This function facilitates the synthesis of disparate evidence sources into a mathematically coherent and unified belief structure. After constructing the BBAs, the BBAs were fused and a conclusion was drawn. The case study verified that the proposed method is more robust than several traditional methods and can deal with redundant information effectively to obtain more stable results.

Higher Order Fractal Belief Rényi Divergence With Its Applications in Pattern Classification

Information can be quantified and expressed by uncertainty, and improving the decision level of uncertain information is vital in modeling and processing uncertain information. Dempster-Shafer evidence theory can model and process uncertain information effectively. However, the Dempster combination rule may provide counter-intuitive results when dealing with highly conflicting information, leading to a decline in decision level. Thus, measuring conflict is significant in the improvement of decision level. Motivated by this issue, this paper proposes a novel method to measure the discrepancy between bodies of evidence. First, the model of dynamic fractal probability transformation is proposed to effectively obtain more information about the non-specificity of basic belief assignments (BBAs). Then, we propose the higher-order fractal belief Rényi divergence (HOFBReD). HOFBReD can effectively measure the discrepancy between BBAs. Moreover, it is the first belief Rényi divergence that can measure the discrepancy between BBAs with dynamic fractal probability transformation. HoFBReD has several properties in terms of probability transformation as well as measurement. When the dynamic fractal probability transformation ends, HoFBReD is equivalent to measuring the Rényi divergence between the pignistic probability transformations of BBAs. When the BBAs degenerate to the probability distributions, HoFBReD will also degenerate to or be related to several well-known divergences. In addition, based on HoFBReD, a novel multisource information fusion algorithm is proposed. A pattern classification experiment with real-world datasets is presented to compare the proposed algorithm with other methods. The experiment results indicate that the proposed algorithm has a higher average pattern recognition accuracy with all datasets than other methods. The proposed discrepancy measurement method and multisource information algorithm contribute to the improvement of decision level.

Conversion and fusion method of multi-source and different populations maintainability prior data

Maintainability is an important universal quality characteristic that reflects the convenience, speed and economy of weapon and equipment maintenance. Making full use of multi-source data to accurately verify the degree to which the developed equipment meets the maintainability requirements is an important basis for equipment identification and acceptance. To solve the low reliability of equipment maintainability verification results caused by inaccurate comprehensive prior distribution obtained by fusing multi-source and different populations' prior data, a method of data conversion and fusion is proposed. A data conversion model based on the mean value ratio of failure mode maintenance data is constructed. The conversion factor is defined according to objective data to convert the different populations' prior data to the same populations. Next, a comparison of the prior distribution fitting performance of Bayes bootstrap, bootstrap, and two improved sample-resampling methods to are used obtain the closest fitting distribution to the true distribution. By constructing a multi-source data fusion model based on improved KL divergence, a symmetrical KL divergence is constructed to describe the similarity between each prior distribution and the field distribution for the weighted fusion of multi-source prior distribution in addition to determining and testing the normal comprehensive prior distribution. The results show that the conversion and fusion method effectively converts the multi-source and different populations' maintainability prior data and obtains an accurate, comprehensive prior distribution by fusion, laying the foundation for applying the Bayes test method to verify the quantitative index of equipment maintainability.

A New Correlation Measure for Belief Functions and Their Application in Data Fusion

Measuring the correlation between belief functions is an important issue in Dempster-Shafer theory. From the perspective of uncertainty, analyzing the correlation may provide a more comprehensive reference for uncertain information processing. However, existing studies about correlation have not combined it with uncertainty. In order to address the problem, this paper proposes a new correlation measure based on belief entropy and relative entropy, named a belief correlation measure. This measure takes into account the influence of information uncertainty on their relevance, which can provide a more comprehensive measure for quantifying the correlation between belief functions. Meanwhile, the belief correlation measure has the mathematical properties of probabilistic consistency, non-negativity, non-degeneracy, boundedness, orthogonality, and symmetry. Furthermore, based on the belief correlation measure, an information fusion method is proposed. It introduces the objective weight and subjective weight to assess the credibility and usability of belief functions, thus providing a more comprehensive measurement for each piece of evidence. Numerical examples and application cases in multi-source data fusion demonstrate that the proposed method is effective.

Multifractal analysis of mass function

In order to explore the fractal characteristic in Dempster-Shafer evidence theory, a fractal dimension of mass function is proposed recently, to reveal the invariance of scale of belief entropy. When mass function degenerates to probability, the fractal dimension is equivalent to classical Renyi information dimension only with α = 1 , which can measure the change rate of Shannon entropy with the size of framework. For Renyi dimension, different parameters α represent the relationship between different entropies and framework size. However, this compatibility is not shown in existing fractal dimension. Thus, in this paper, we introduce parameter α to generalize the existing dimension. Due to the diversity of the value of α , we name the new dimension: multifractal dimension of mass function. In addition, inspired by multifractal spectrum of Cantor set, we explore the relation between the belief degree of focal element and the number of focal element with same belief degree for some special assignments. Relevant results are also presented by spectrum. We provide a static discounting coefficient generating method to modify mass function to improve the accuracy of classify result. The experiment is conducted in three datasets, and the result shows the effectiveness of our method.

Parameterized Hamiltonian Learning With Quantum Circuit

Hamiltonian learning, as an important quantum machine learning technique, provides a significant approach for determining an accurate quantum system. This paper establishes parameterized Hamiltonian learning (PHL) and explores its application and implementation on quantum computers. A parameterized quantum circuit for Hamiltonian learning is first created by decomposing unitary operators to excite the system evolution. Then, a PHL algorithm is developed to prepare a specific Hamiltonian system by iteratively updating the gradient of the loss function about circuit parameters. Finally, the experiments are conducted on Origin Pilot, and it demonstrates that the PHL algorithm can deal with the image segmentation problem and provide a segmentation solution accurately. Compared with the classical Grabcut algorithm, the PHL algorithm eliminates the requirement of early manual intervention. It provides a new possibility for solving practical application problems with quantum devices, which also assists in solving increasingly complicated problems and supports a much wider range of application possibilities in the future.

KNN Data Filling Algorithm for Incomplete Interval-Valued Fuzzy Soft Sets

As a generalization of the fuzzy soft set, interval-valued fuzzy soft set is viewed as a more resilient and powerful tool for dealing with uncertain information. However, the lower or upper membership degree, or both of them, may be missed during the data collection and transmission procedure, which could present challenges for data processing. The existing data filling algorithm for the incomplete interval-valued fuzzy soft sets has low accuracy and the high error rate which leads to wrong filling results and involves subjectivity due to setting the threshold. Therefore, to solve these problems, we propose a KNN data filling algorithm for the incomplete interval-valued fuzzy soft sets. An attribute-based combining rule is first designed to determine whether the data involving incomplete membership degree should be ignored or filled which avoids subjectivity. The incomplete data will be filled according to their K complete nearest neighbors. To verify the validity and feasibility of the method, we conduct the randomized experiments on the real dataset as Shanghai Five-Four Hotel Data set and simulated datasets. The experimental results illustrate that our proposed method outperform the existing method on the average accuracy rate and error rate.

A mechanics model based on information entropy for identifying influencers in complex networks

The network, with some or all characteristics of scale-free, self-similarity, self-organization, attractor and small world, is defined as a complex network. The identification of significant spreaders is an indispensable research direction in complex networks, which aims to discover nodes that play a crucial role in the structure and function of the network. Since influencers are essential for studying the security of the network and controlling the propagation process of the network, their assessment methods are of great significance and practical value to solve many problems. However, how to effectively combine global information with local information is still an open problem. To solve this problem, the generalized mechanics model is further improved in this paper. A generalized mechanics model based on information entropy is proposed to discover crucial spreaders in complex networks. The influence of each neighbor node on local information is quantified by information entropy, and the interaction between each node on global information is considered by calculating the shortest distance. Extensive tests on eleven real networks indicate the proposed approach is much faster and more precise than traditional ways and state-of-the-art benchmarks. At the same time, it is effective to use our approach to identify influencers in complex networks.

A Decision Probability Transformation Method Based on the Neural Network

When the Dempster-Shafer evidence theory is applied to the field of information fusion, how to reasonably transform the basic probability assignment (BPA) into probability to improve decision-making efficiency has been a key challenge. To address this challenge, this paper proposes an efficient probability transformation method based on neural network to achieve the transformation from the BPA to the probabilistic decision. First, a neural network is constructed based on the BPA of propositions in the mass function. Next, the average information content and the interval information content are used to quantify the information contained in each proposition subset and combined to construct the weighting function with parameter r. Then, the BPA of the input layer and the bias units are allocated to the proposition subset in each hidden layer according to the weight factors until the probability of each single-element proposition with the variable is output. Finally, the parameter r and the optimal transform results are obtained under the premise of maximizing the probabilistic information content. The proposed method satisfies the consistency of the upper and lower boundaries of each proposition. Extensive examples and a practical application show that, compared with the other methods, the proposed method not only has higher applicability, but also has lower uncertainty regarding the transformation result information.