ICML有关可解释性的文章

最新推荐文章于 2022-03-21 17:25:05 发布

Kenny_SI

最新推荐文章于 2022-03-21 17:25:05 发布

阅读量303

点赞数

分类专栏：可解释性

本文链接：https://blog.csdn.net/weixin_38072029/article/details/114777018

版权

本文探讨了如何通过决策树提高k-Means和k-Medians聚类的可解释性，以及解释性对神经网络对抗性攻击防御的重要性。研究发现，决策树可能导致高成本聚类，而适当解读有助于提升模型对对抗性攻击的鲁棒性。

摘要由CSDN通过智能技术生成

摘要：Many clustering algorithms lead to cluster assignments that are hard to explain, partially because they depend on all the features of the data in a complicated way. To improve interpretability, we consider using a small decision tree to partition a data set into clusters, so that clusters can be characterized in a straightforward manner. We study this problem from a theoretical viewpoint, measuring cluster quality by the k-means and k-medians objectives.In terms of negative results, we show that popular top-down decision tree algorithms
may lead to clusterings with arbitrarily large cost, and any clustering based on a tree with k leaves must incur an ⌦(logk) approximation factor compared to the optimal clustering. On the positive side, for two means/medians, we show that a single threshold cut can achieve a constant factor approximation, and we give ne

关注

专栏目录