ScholarGate
어시스턴트

방법 비교

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

약한 지도 순환 신경망×Gated Recurrent Unit (GRU)×
분야딥러닝딥러닝
계열Machine learningMachine learning
기원 연도2009–20162014
창시자Broadly attributed to the weak supervision / distant supervision research community (Mintz et al., 2009; Ratner et al., 2016)Cho, K., van Merrienboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., & Bengio, Y.
유형Supervised learning under noisy or incomplete labelsRecurrent neural network with gating
원전Ratner, A., De Sa, C., Wu, S., Selsam, D., & Re, C. (2016). Data Programming: Creating Large Training Sets, Quickly. Advances in Neural Information Processing Systems (NeurIPS), 29. 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. In Proceedings of EMNLP 2014, pp. 1724–1734. link ↗
별칭WS-RNN, distantly supervised RNN, noise-tolerant RNN, weakly supervised sequence modelGRU, GRU network, gated RNN, GRU cell
관련53
요약A weakly supervised RNN trains a recurrent neural network on sequences whose labels come from imperfect sources — heuristic rules, distant supervision, crowdsourcing, or generative label models — rather than expensive expert annotation. This lets researchers exploit large unlabeled corpora for sequential tasks such as text classification, named entity recognition, or time-series prediction when fully annotated data is scarce or costly.The Gated Recurrent Unit (GRU), introduced by Cho et al. in 2014, is a streamlined recurrent neural network that uses two learned gates — an update gate and a reset gate — to selectively retain or discard information across time steps, enabling effective sequence modelling with fewer parameters than LSTM.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

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

ScholarGate방법 비교: Weakly supervised recurrent neural network · Gated Recurrent Unit. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare