The Tree Augmented Naive Bayes (TAN) classifier is a type of probabilistic graphical model that constructs a single-parent dependency tree to estimate the distribution of the data. In this work, we propose two novel Hierarchical dependency-based Tree Augmented Naive Bayes algorithms, i.e. Hie-TAN and Hie-TAN-Lite. Both methods exploit the pre-defined parent-child (generalisation-specialisation) relationships between features as a type of constraint to learn the tree representation of dependencies among features, whilst the latter further eliminates the hierarchical redundancy during the classifier learning stage. The experimental results showed that Hie-TAN successfully obtained better predictive performance than several other hierarchical dependency constrained classification algorithms, and its predictive performance was further improved by eliminating the hierarchical redundancy, as suggested by the higher accuracy obtained by Hie-TAN-Lite.
翻译:树木增强型小湾(TAN)分类是一种概率性图形模型,它构建了一棵单亲家庭依赖型树来估计数据分布情况。在这项工作中,我们建议采用两种新型的基于高度依赖型树增强型小湾算法,即Hie-TAN和Hie-TAN-Lite。这两种方法都利用了预先确定的母子关系(一般化专门化)关系,作为学习各特征之间依赖型树代表的一种制约,而后者进一步消除了在分类学阶段的等级冗余。实验结果表明,Hie-TAN成功地取得了比其他几个等级依赖型限制分类算法更好的预测性性表现,其预测性表现由于消除了等级性冗余,正如Hie-TAN-Lite获得的更高精度所表明的那样,通过消除等级性冗余来进一步改进了它的预测性表现。