期刊
PATTERN RECOGNITION LETTERS
卷 90, 期 -, 页码 28-35出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.patrec.2017.03.007
关键词
PU learning; Uncertain data; Bayesian belief network
The current state-of-art for tackling the problem of classification of static uncertain data under PU learning (Positive Unlabeled Learning) scenario, is UPNB. It is based on the Bayesian assumption, which does not hold for real-life applications, and hence it may depress the classification performance of UPNB. In this paper, we propose UPTAN (Uncertain Positive Tree Augmented Naive Bayes), a Bayesian network algorithm, so as to utilize the dependence information among uncertain attributes for classification. We propose uncertain conditional mutual information (UCMI) for measuring the mutual information between uncertain attributes, and then use it to learn the tree structure of Bayesian network. Furthermore, we give our approach for estimating the parameters of the Bayesian network for uncertain data without negative training examples. Our experiments on 20 UCI datasets show that UPTAN has excellent classification performance, with average F1 being 0.8257, which outperforms UPNB by 3.73%. (C) 2017 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据