.png){kind=icon}
返回
Binary Naive Possibilistic Classifiers: Handling Uncertain Inputs
.png){kind=icon}
PRE
AI
DOI：10.1002/int.20381.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Possibilistic networks are graphical models particularly suitable for representing and reasoning with uncertain and incomplete information. According to the underlying interpretation of possibilistic scales, possibilistic networks are either quantitative (using product-based conditioning) or qualitative (using min-based conditioning). Among the multiple tasks, possibilitic models can be used for, classification is a very important one. In this paper, we address the problem of handling uncertain inputs in binary possibilistic-based classification. More precisely, we propose an efficient algorithm for revising possibility distributions encoded by a naive possibilistic network. This algorithm is suitable for binary classification with uncertain inputs since it allows classification in polynomial time using several efficient transformations of initial naive possibilistic networks. (C) 2009 Wiley Periodicals, Inc.
Keyword:
CLASSIFICATION
INDEPENDENCE
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
3.1K
被引数:
8.1K
机构
引用论文
.png){kind=icon}
分享收藏Potassium Metal Batteries: Stable Potassium Metal Anodes with an All‐Aluminum Current Collector through Improved Electrolyte Wetting (Adv. Mater. 49/2020)钾金属电池: 稳定的钾金属阳极，通过改进的电解质润湿全铝集电器 (Adv. Mater. 49/2020)
OAAI
OAAI分享收藏分享收藏
查看更多内容