首页> 外文期刊>SIGKDD explorations >Accurate Intelligible Models with Pairwise Interactions
【24h】

Accurate Intelligible Models with Pairwise Interactions

机译:具有成对交互的精确可理解模型

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Standard generalized additive models (GAMs) usually model the dependent variable as a sum of univariate models. Although previous studies have shown that standard GAMs can be interpreted by users, their accuracy is significantly less than more complex models that permit interactions. In this paper, we suggest adding selected terms of interacting pairs of features to standard GAMs. The resulting models, which we call GA~2M-models, for Generalized Additive Models plus Interactions, consist of univariate terms and a small number of pairwise interaction terms. Since these models only include one- and two-dimensional components, the components of GA~2M-models can be visualized and interpreted by users. To explore the huge (quadratic) number of pairs of features, we develop a novel, computationally efficient method called FAST for ranking all possible pairs of features as candidates for inclusion into the model. In a large-scale empirical study, we show the effectiveness of FAST in ranking candidate pairs of features. In addition, we show the surprising result that GA~2M-models have almost the same performance as the best full-complexity models on a number of real datasets. Thus this paper postulates that for many problems, GA~2M-models can yield models that are both intelligible and accurate.
机译:标准的通用加性模型(GAM)通常将因变量建模为单变量模型的总和。尽管以前的研究表明,标准GAM可以由用户解释,但其准确性大大低于允许交互的更复杂模型。在本文中,我们建议在标准GAM中添加交互功能对的选定术语。产生的模型,我们称为GA〜2M模型,用于广义加法模型加交互,由单变量项和少量成对交互项组成。由于这些模型仅包含一维和二维组件,因此GA〜2M模型的组件可以由用户可视化和解释。为了探索大量(二次)特征对,我们开发了一种新颖的,计算效率高的方法,称为FAST,用于对所有可能的特征对进行排名,以将其纳入模型。在大规模的实证研究中,我们显示了FAST在对候选特征对进行排名中的有效性。此外,我们展示了令人惊讶的结果,即GA〜2M模型在许多实际数据集上具有与最佳全复杂度模型几乎相同的性能。因此,本文假设对于许多问题,GA〜2M模型可以产生可理解且准确的模型。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号