论文标题
纠正单标签布尔分类器
Rectifying Mono-Label Boolean Classifiers
论文作者
论文摘要
我们详细阐述了布尔分类器$σ$的纠正概念。给定$σ$和某些背景知识$ t $，可以表征必须将$σ$更改为已符合$ t $的新分类器$σ\ star t $的方式。我们在这里关注单标签布尔分类器的特定情况，即有一个单个目标概念，任何实例都被归类为正（概念的元素）或负面（互补概念的元素）。 In this specific case, our main contribution is twofold: (1) we show that there is a unique rectification operator $\star$ satisfying the postulates, and (2) when $Σ$ and $T$ are Boolean circuits, we show how a classification circuit equivalent to $Σ\star T$ can be computed in time linear in the size of $Σ$ and $T$;当$σ$和$ t $是决策树时，可以按$σ$和$ t $的大小计算出相当于$σ\ star t $的决策树。
We elaborate on the notion of rectification of a Boolean classifier $Σ$. Given $Σ$ and some background knowledge $T$, postulates characterizing the way $Σ$ must be changed into a new classifier $Σ\star T$ that complies with $T$ have already been presented. We focus here on the specific case of mono-label Boolean classifiers, i.e., there is a single target concept and any instance is classified either as positive (an element of the concept), or as negative (an element of the complementary concept). In this specific case, our main contribution is twofold: (1) we show that there is a unique rectification operator $\star$ satisfying the postulates, and (2) when $Σ$ and $T$ are Boolean circuits, we show how a classification circuit equivalent to $Σ\star T$ can be computed in time linear in the size of $Σ$ and $T$; when $Σ$ and $T$ are decision trees, a decision tree equivalent to $Σ\star T$ can be computed in time polynomial in the size of $Σ$ and $T$.
