skip to main content
10.1145/3209978.3210151acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
short-paper

Transparent Tree Ensembles

Published:27 June 2018Publication History

ABSTRACT

Every day more technologies and services are backed by complex machine-learned models, consuming large amounts of data to provide a myriad of useful services. While users are willing to provide personal data to enable these services, their trust in and engagement with the systems could be improved by providing insight into how the machine learned decisions were made. Complex ML systems are highly effective but many of them are black boxes and give no insight into how they make the choices they make. Moreover, those that do often do so at the model-level rather than the instance-level. In this work we present a method for deriving explanations for instance-level decisions in tree ensembles. As this family of models accounts for a large portion of industrial machine learning, this work opens up the possibility for transparent models at scale.

References

  1. Leo Breiman . 2001. Random Forests. Machine Learning, Vol. 45, 1 (2001), 5--32. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Rich Caruana, Yin Lou, Johannes Gehrke, Paul Koch, Marc Sturm, and Noemie Elhadad . 2015. Intelligible Models for HealthCare: Predicting Pneumonia Risk and Hospital 30-Day Readmission Proceedings of the ACM Conference on Knowledge Discovery and Data Mining. Sydney, Australia, 1721--1730. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. George Forman . 2003. An extensive empirical study of feature selection metrics for text classification. Journal of machine learning research Vol. 3, Mar (2003), 1289--1305. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Satoshi Hara and Kohei Hayashi . 2016. Making tree ensembles interpretable. WHI 2016. arXiv preprint arXiv:1606.05390 (2016).Google ScholarGoogle Scholar
  5. M. Lichman . 2013. UCI Machine Learning Repository. (2013). http://archive.ics.uci.edu/mlGoogle ScholarGoogle Scholar
  6. Yin Lou, Rich Caruana, and Johannes Gehrke . 2012. Intelligible Models for Classification and Regression Proceedings of the ACM Conference on Knowledge Discovery and Data Mining. Beijing, China. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Yin Lou, Rich Caruana, Johannes Gehrke, and Giles Hooker . 2013. Accurate Intelligible Models with Pairwise Interactions Proceedings of the ACM Conference on Knowledge Discovery and Data Mining. Chicago, Illinois. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Marco Tulio Ribeiro, Sameer Singh, and Carlos Guestrin . 2016. Why Should I Trust You?: Explaining the Predictions of Any Classifier Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 1135--1144. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Transparent Tree Ensembles

        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
          SIGIR '18: The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval
          June 2018
          1509 pages
          ISBN:9781450356572
          DOI:10.1145/3209978

          Copyright © 2018 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: 27 June 2018

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • short-paper

          Acceptance Rates

          SIGIR '18 Paper Acceptance Rate86of409submissions,21%Overall Acceptance Rate792of3,983submissions,20%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader