Target Classification Using PAS and Evidence Theory

2013 ◽  
Vol 347-350 ◽  
pp. 3728-3733
Author(s):  
Li Jia ◽  
Hai Yan ◽  
Guo Hui Li ◽  
Hui Zhang
Keyword(s):  
Data Fusion ◽  
Prior Probability ◽  
Evidence Theory ◽  
Real Data ◽  
Fusion System ◽  
Target Classification ◽  
Additional Information ◽  
Argumentation System ◽  
Probabilistic Argumentation

This paper presents a novel Dempster-Shafer evidence construction approach for aircraft aim recognition. The prior-probability of the properties of aircraft was used for establishing a probabilistic argumentation system. Dempster-Shafer evidence was constructed by assumption-based reasoning. Therefore, additional information could be provided to the classification of the data fusion system. Experiments on artificial and real data demonstrated that the proposed method could improve the classification results.

Method of determination of the text direction on the image with the use of convolutional neural network

2020 ◽  
pp. 96-99
Author(s):  
P.L. Nikolaev
Keyword(s):  
Neural Network ◽  
Convolutional Neural Network ◽  
Deep Neural Network ◽  
Binary Classification ◽  
Synthetic Data ◽  
Real Data ◽  
Method Of Determination ◽  
Classification Of Images

This article deals with method of binary classification of images with small text on them Classification is based on the fact that the text can have 2 directions – it can be positioned horizontally and read from left to right or it can be turned 180 degrees so the image must be rotated to read the sign. This type of text can be found on the covers of a variety of books, so in case of recognizing the covers, it is necessary first to determine the direction of the text before we will directly recognize it. The article suggests the development of a deep neural network for determination of the text position in the context of book covers recognizing. The results of training and testing of a convolutional neural network on synthetic data as well as the examples of the network functioning on the real data are presented.

Index of suicide risk in Mexico using Twitter

2019 ◽  
pp. 1-13
Author(s):  
Luz Judith Rodríguez-Esparza ◽  
Diana Barraza-Barraza ◽  
Jesús Salazar-Ibarra ◽  
Rafael Gerardo Vargas-Pasaye
Keyword(s):  
Social Networks ◽  
Analytic Hierarchy Process ◽  
Suicide Risk ◽  
Opinion Mining ◽  
Real Data ◽  
Analytic Hierarchy ◽  
Specialized Care ◽  
The Analytic Hierarchy Process ◽  
Hierarchy Process

Objectives: To identify early suicide risk signs on depressive subjects, so that specialized care can be provided. Various studies have focused on studying expressions on social networks, where users pour their emotions, to determine if they show signs of depression or not. However, they have neglected the quantification of the risk of committing suicide. Therefore, this article proposes a new index for identifying suicide risk in Mexico. Methodology: The proposal index is constructed through opinion mining using Twitter and the Analytic Hierarchy Process. Contribution: Using R statistical package, a study is presented considering real data, making a classification of people according to the obtained index and using information from psychologists. The proposed methodology represents an innovative prevention alternative for suicide.

Fault Classification of Hydroelectric Generating Unit Based on Improved Evidence Theory

2014 ◽  
Vol 7 (1) ◽  
pp. 78-83 ◽  
Author(s):  
Jiatang Cheng ◽  
Li Ai ◽  
Zhimei Duan ◽  
Yan Xiong
Keyword(s):  
Fault Diagnosis ◽  
Information Fusion ◽  
Evidence Theory ◽  
Fault Classification ◽  
Fusion Method ◽  
Inconsistent Result ◽  
High Conflict

Aiming at the problem of the conventional vibration fault diagnosis technology with inconsistent result of a hydroelectric generating unit, an information fusion method was proposed based on the improved evidence theory. In this algorithm, the original evidence was amended by the credibility factor, and then the synthesis rule of standard evidence theory was utilized to carry out information fusion. The results show that the proposed method can obtain any definitive conclusion even if there is high conflict evidence in the synthesis evidence process, and may avoid the divergent phenomenon when the consistent evidence is fused, and is suitable for the fault classification of hydroelectric generating unit.

scholarly journals ALPINE: Active Link Prediction Using Network Embedding

2021 ◽  
Vol 11 (11) ◽  
pp. 5043
Author(s):  
Xi Chen ◽  
Bo Kang ◽  
Jefrey Lijffijt ◽  
Tijl De Bie
Keyword(s):  
Active Learning ◽  
Protein Interactions ◽  
Link Prediction ◽  
Prediction Accuracy ◽  
Real Data ◽  
Network Embedding ◽  
Protein Protein Interactions ◽  
Additional Information ◽  
The Cost ◽  
Active Link

Many real-world problems can be formalized as predicting links in a partially observed network. Examples include Facebook friendship suggestions, the prediction of protein–protein interactions, and the identification of hidden relationships in a crime network. Several link prediction algorithms, notably those recently introduced using network embedding, are capable of doing this by just relying on the observed part of the network. Often, whether two nodes are linked can be queried, albeit at a substantial cost (e.g., by questionnaires, wet lab experiments, or undercover work). Such additional information can improve the link prediction accuracy, but owing to the cost, the queries must be made with due consideration. Thus, we argue that an active learning approach is of great potential interest and developed ALPINE (Active Link Prediction usIng Network Embedding), a framework that identifies the most useful link status by estimating the improvement in link prediction accuracy to be gained by querying it. We proposed several query strategies for use in combination with ALPINE, inspired by the optimal experimental design and active learning literature. Experimental results on real data not only showed that ALPINE was scalable and boosted link prediction accuracy with far fewer queries, but also shed light on the relative merits of the strategies, providing actionable guidance for practitioners.

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

Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 820
Author(s):  
Jingyu Liu ◽  
Yongchuan Tang
Keyword(s):  
Data Fusion ◽  
Evidence Theory ◽  
Multi Agent System ◽  
Agent System ◽  
Combination Rules ◽  
Probability Assignment ◽  
Basic Probability Assignment ◽  
Reasonable Evidence ◽  
Basic Probability ◽  
Multi Agent

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.

Sign in / Sign up

Export Citation Format

Share Document