ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

설명 가능한 LSTM (Explainable LSTM)×설명 가능한 GRU×
분야딥러닝딥러닝
계열Machine learningMachine learning
기원 연도2017–20192014 (GRU); 2016–2017 (XAI integration)
창시자Lundberg & Lee (SHAP); Ribeiro et al. (LIME); community synthesisCho, K. et al. (GRU); explainability layer via Lundberg & Lee (SHAP) and Ribeiro et al. (LIME)
유형Interpretable deep learning (post-hoc explainability)Recurrent neural network with post-hoc or attention-based interpretability
원전Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗Cho, K., van Merrienboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., & Bengio, Y. (2014). Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation. Proceedings of EMNLP 2014, 1724–1734. DOI ↗
별칭XAI-LSTM, interpretable LSTM, LSTM with SHAP, transparent LSTMXAI-GRU, Interpretable GRU, GRU with explainability, Transparent GRU
관련55
요약Explainable LSTM pairs a trained Long Short-Term Memory network with post-hoc interpretability techniques — chiefly SHAP, LIME, integrated gradients, or attention visualization — to reveal which time steps, tokens, or features drive each prediction. It bridges the accuracy of recurrent deep learning with the transparency demanded by high-stakes domains such as clinical decision support, fraud detection, and regulatory compliance.Explainable GRU pairs the Gated Recurrent Unit, a compact and efficient recurrent architecture, with explainability techniques such as SHAP, LIME, or attention weighting to reveal which time steps and features drove each prediction. It brings interpretability to sequential modelling without sacrificing the GRU's ability to capture temporal dependencies.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Explainable LSTM · Explainable GRU. 2026-06-17에 다음에서 검색함: https://scholargate.app/ko/compare