ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Slabě supervizovaný LSTM×Dlouhodobá krátkodobá paměť (LSTM)×
OborHluboké učeníHluboké učení
RodinaMachine learningMachine learning
Rok vzniku2016–20181997
TvůrceRatner et al. (data programming framework); Hochreiter & Schmidhuber (LSTM backbone)Hochreiter, S. & Schmidhuber, J.
TypWeakly supervised sequence modelRecurrent neural network with gated memory cells
Původní zdrojRatner, 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 ↗Hochreiter, S. & Schmidhuber, J. (1997). Long short-term memory. Neural Computation, 9(8), 1735–1780. DOI ↗
Další názvyWS-LSTM, noisy-label LSTM, distant-supervision LSTM, data-programming LSTMLSTM, LSTM network, LSTM-RNN, long short-term memory RNN
Příbuzné64
ShrnutíWeakly supervised LSTM trains a Long Short-Term Memory network on sequence data where clean, manually annotated labels are scarce or absent. Instead, multiple imperfect label sources — heuristic rules, distant supervision, crowdsourcing, or programmatic labeling functions — are combined to produce probabilistic training labels, which are then used to supervise the LSTM. This allows scalable training on large unlabeled corpora without exhaustive human annotation.Long Short-Term Memory (LSTM) is a gated recurrent neural network architecture introduced by Hochreiter and Schmidhuber in 1997. It was designed to learn dependencies across long sequences by using dedicated memory cells and three learned gates — forget, input, and output — that control what information is retained, updated, or passed forward at each time step.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Weakly supervised LSTM · Long Short-Term Memory. Získáno 2026-06-17 z https://scholargate.app/cs/compare