skip to main content
10.1145/2487575.2487579acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
poster

Accurate intelligible models with pairwise interactions

Published:11 August 2013Publication History

ABSTRACT

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 GA2{M}$-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 GA2M-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 GA2M-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, GA2M-models can yield models that are both intelligible and accurate.

References

  1. http://www.liaad.up.pt/~ltorgo/Regression/DataSets.html.Google ScholarGoogle Scholar
  2. http://www.cs.toronto.edu/~delve/data/datasets.html.Google ScholarGoogle Scholar
  3. http://research.microsoft.com/en-us/projects/mslr/.Google ScholarGoogle Scholar
  4. http://archive.ics.uci.edu/ml/.Google ScholarGoogle Scholar
  5. http://www.nipsfsc.ecs.soton.ac.uk/.Google ScholarGoogle Scholar
  6. http://osmot.cs.cornell.edu/kddcup/.Google ScholarGoogle Scholar
  7. http://www-stat.stanford.edu/~jhf/R-RuleFit.html.Google ScholarGoogle Scholar
  8. http://additivegroves.net.Google ScholarGoogle Scholar
  9. E. Bauer and R. Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine learning, 36(1):105--139, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Friedman. Greedy function approximation: a gradient boosting machine. Annals of Statistics, 29:1189--1232, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  11. J. Friedman and B. Popescu. Predictive learning via rule ensembles. The Annals of Applied Statistics, pages 916--954, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  12. I. Guyon and A. Elisseeff. An introduction to variable and feature selection. The Journal of Machine Learning Research, 3:1157--1182, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. T. Hastie and R. Tibshirani. Generalized additive models. Chapman & Hall/CRC, 1990.Google ScholarGoogle Scholar
  14. G. Hooker. Discovering additive structure in black box functions. In KDD, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. G. Hooker. Generalized functional anova diagnostics for high-dimensional functions of dependent variables. Journal of Computational and Graphical Statistics, 16(3):709--732, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  16. R. Kelley Pace and R. Barry. Sparse spatial autoregressions. Statistics & Probability Letters, 33(3):291--297, 1997.Google ScholarGoogle ScholarCross RefCross Ref
  17. P. Li, C. Burges, and Q. Wu. Mcrank: Learning to rank using multiple classification and gradient boosting. In NIPS, 2007.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. W. Loh. Regression trees with unbiased variable selection and interaction detection. Statistica Sinica, 12(2):361--386, 2002.Google ScholarGoogle Scholar
  19. Y. Lou, R. Caruana, and J. Gehrke. Intelligible models for classification and regression. In KDD, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C. D. Manning, P. Raghavan, and H. Schütze. Introduction to information retrieval. Cambridge University Press Cambridge, 2008. Google ScholarGoogle ScholarCross RefCross Ref
  21. D. Sorokina, R. Caruana, and M. Riedewald. Additive groves of regression trees. In ECML, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. D. Sorokina, R. Caruana, M. Riedewald, and D. Fink. Detecting statistical interactions with additive groves of trees. In ICML, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. S. M. Weiss and N. Indurkhya. Rule-based machine learning methods for functional prediction. Journal of Artificial Intelligence Research, 3:383--403, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. S. Wood. Thin plate regression splines. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 65(1):95--114, 2003.Google ScholarGoogle Scholar
  25. S. Wood. Generalized additive models: an introduction with R. CRC Press, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Accurate intelligible models with pairwise interactions

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      KDD '13: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
      August 2013
      1534 pages
      ISBN:9781450321747
      DOI:10.1145/2487575

      Copyright © 2013 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 11 August 2013

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      KDD '13 Paper Acceptance Rate125of726submissions,17%Overall Acceptance Rate1,133of8,635submissions,13%

      Upcoming Conference

      KDD '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader