MARC보기
LDR00000nam u2200205 4500
001000000431760
00520200224104838
008200131s2019 ||||||||||||||||| ||eng d
020 ▼a 9781088327913
035 ▼a (MiAaPQ)AAI13902220
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 247004
0820 ▼a 004
1001 ▼a Lundberg, Scott.
24510 ▼a Explainable Machine Learning for Science and Medicine.
260 ▼a [S.l.]: ▼b University of Washington., ▼c 2019.
260 1 ▼a Ann Arbor: ▼b ProQuest Dissertations & Theses, ▼c 2019.
300 ▼a 176 p.
500 ▼a Source: Dissertations Abstracts International, Volume: 81-05, Section: B.
500 ▼a Advisor: Lee, Su-In.
5021 ▼a Thesis (Ph.D.)--University of Washington, 2019.
506 ▼a This item must not be sold to any third party vendors.
506 ▼a This item must not be added to any third party search indexes.
520 ▼a Understanding why a machine learning model made a certain prediction can be as crucial as the prediction's accuracy in many scientific and medical applications. However, the highest accuracy for large modern datasets is often achieved by complex models that even experts struggle to interpret, such as tree-based ensembles or deep learning models. In this dissertation I present several solutions that improve our ability to explain traditional (often complex) machine learning models. Each of these solutions were developed in response to specific challenges that we faced in our application of machine learning to biology and medicine. I present solutions that enable the better interpretation of very large graphical models, and show how that can enhance our understanding of human genome regulation. I then present a unified model agnostic approach to explain the output of any machine learning model that connects game theory with local explanations, uniting many previous methods. By applying this approach to early-warning medical decision support we are able to use a complex, high accuracy model, and also provide explanations of the clinical risk factors that impacted the model's prediction. I then focus specifically on tree-based models, such as random forests and gradient boosted trees, where we have developed the first polynomial time algorithm to exactly compute classic attribution values from game theory. Based on these methods we have created a new set of tools for understanding both global model structure and individual model predictions. The associated open source software supports many modern machine learning frameworks and is widely used across many industries.
590 ▼a School code: 0250.
650 4 ▼a Computer science.
690 ▼a 0984
71020 ▼a University of Washington. ▼b Computer Science and Engineering.
7730 ▼t Dissertations Abstracts International ▼g 81-05B.
773 ▼t Dissertation Abstract International
790 ▼a 0250
791 ▼a Ph.D.
792 ▼a 2019
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T15492347 ▼n KERIS ▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다.
980 ▼a 202002 ▼f 2020
990 ▼a ***1008102
991 ▼a E-BOOK