Conflict evidence management in fault diagnosis

A New Reliability Coefficient Using Betting Commitment Evidence Distance in Dempster-Shafer Evidence Theory for Uncertain Information Fusion

Dempster-Shafer evidence theory is widely used to deal with uncertain information by evidence modeling and evidence reasoning. However, if there is a high contradiction between different pieces of evidence, the Dempster combination rule may give a fusion result that violates the intuitive result. Many methods have been proposed to solve conflict evidence fusion, and it is still an open issue. This paper proposes a new reliability coefficient using betting commitment evidence distance in Dempster-Shafer evidence theory for conflict and uncertain information fusion. The single belief function for belief assignment in the initial frame of discernment is defined. After evidence preprocessing with the proposed reliability coefficient and single belief function, the evidence fusion result can be calculated with the Dempster combination rule. To evaluate the effectiveness of the proposed uncertainty measure, a new method of uncertain information fusion based on the new evidence reliability coefficient is proposed. The experimental results on UCI machine learning data sets show the availability and effectiveness of the new reliability coefficient for uncertain information processing.

An Improved K-Means Algorithm Based on Evidence Distance

The main influencing factors of the clustering effect of the k-means algorithm are the selection of the initial clustering center and the distance measurement between the sample points. The traditional k-mean algorithm uses Euclidean distance to measure the distance between sample points, thus it suffers from low differentiation of attributes between sample points and is prone to local optimal solutions. For this feature, this paper proposes an improved k-means algorithm based on evidence distance. Firstly, the attribute values of sample points are modelled as the basic probability assignment (BPA) of sample points. Then, the traditional Euclidean distance is replaced by the evidence distance for measuring the distance between sample points, and finally k-means clustering is carried out using UCI data. Experimental comparisons are made with the traditional k-means algorithm, the k-means algorithm based on the aggregation distance parameter, and the Gaussian mixture model. The experimental results show that the improved k-means algorithm based on evidence distance proposed in this paper has a better clustering effect and the convergence of the algorithm is also better.

An improved measure for belief structure in the evidence theory

Dempster-Shafer evidence theory (D-S theory) is suitable for processing uncertain information under complex circumstances. However, how to measure the uncertainty of basic probability distribution (BPA) in D-S theory is still an open question. In this paper, a method of measuring total uncertainty based on belief interval distance is proposed. This method is directly defined in the D-S theoretical framework, without the need of converting BPA into probability distribution by Pignistic probability transformation. Thus, it avoids the loss of information. This paper analyzes the advantages and disadvantages of the previous total uncertainty of measurement, and the uncertainty measurement examples show the effectiveness of the new uncertainty measure. Finally, an information fusion method based on the new uncertainty measure is proposed. The validity and rationality of the proposed method are verified by two classification experiments from UCI data sets.

Conflict Data Fusion in a Multi-Agent System Premised on the Base Basic Probability Assignment and Evidence Distance

The multi-agent information fusion (MAIF) system can alleviate the limitations of a single expert system in dealing with complex situations, as it allows multiple agents to cooperate in order to solve problems in complex environments. Dempster–Shafer (D-S) evidence theory has important applications in multi-source data fusion, pattern recognition, and other fields. However, the traditional Dempster combination rules may produce counterintuitive results when dealing with highly conflicting data. A conflict data fusion method in a multi-agent system based on the base basic probability assignment (bBPA) and evidence distance is proposed in this paper. Firstly, the new bBPA and reconstructed BPA are used to construct the initial belief degree of each agent. Then, the information volume of each evidence group is obtained by calculating the evidence distance so as to modify the reliability and obtain more reasonable evidence. Lastly, the final evidence is fused with the Dempster combination rule to obtain the result. Numerical examples show the effectiveness and availability of the proposed method, which improves the accuracy of the identification process of the MAIF system.

Enhanced K-Nearest Neighbor for Intelligent Fault Diagnosis of Rotating Machinery

Case-based intelligent fault diagnosis methods of rotating machinery can deal with new faults effectively by adding them into the case library. However, case-based methods scarcely refer to automatic feature extraction, and k-nearest neighbor (KNN) commonly required by case-based methods is unable to determine the nearest neighbors for different testing samples adaptively. To solve these problems, a new intelligent fault diagnosis method of rotating machinery is proposed based on enhanced KNN (EKNN), which can take advantage of both parameter-based and case-based methods. First, EKNN is embedded with a dimension-reduction stage, which extracts the discriminative features of samples via sparse filtering (SF). Second, to locate the nearest neighbors for various testing samples adaptively, a case-based reconstruction algorithm is designed to obtain the correlation vectors between training samples and testing samples. Finally, according to the optimized correlation vector of each testing sample, its nearest neighbors can be adaptively selected to obtain its corresponding health condition label. Extensive experiments on vibration signal datasets of bearings are also conducted to verify the effectiveness of the proposed method.

Improved Base Belief Function-Based Conflict Data Fusion Approach Considering Belief Entropy in the Evidence Theory

Due to the nature of the Dempster combination rule, it may produce results contrary to intuition. Therefore, an improved method for conflict evidence fusion is proposed. In this paper, the belief entropy in D–S theory is used to measure the uncertainty in each evidence. First, the initial belief degree is constructed by using an improved base belief function. Then, the information volume of each evidence group is obtained through calculating the belief entropy which can modify the belief degree to get the final evidence that is more reasonable. Using the Dempster combination rule can get the final result after evidence modification, which is helpful to solve the conflict data fusion problems. The rationality and validity of the proposed method are verified by numerical examples and applications of the proposed method in a classification data set.