The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Applying LSTM to Time Series Predictable through Time-Window Approaches
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Self-citationLearning to forget: Continual prediction with LSTM
Gers, F. A., Schmidhuber, J., & Cummins, F. (2000) · Neural Computation · doi:10.1162/089976600300015015 · Cited by 4,823
Self-citationOscillation and Chaos in Physiological Control Systems
Mackey, M. C., & Glass, L. (1977) · Science · doi:10.1126/science.267326 · Cited by 4,135
'Neural-gas' network for vector quantization and its application to time-series prediction
Martinetz, T. M., Berkovich, S. G., & Schulten, K. J. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.238311 · Cited by 1,431
A Resource-Allocating Network for Function Interpolation
Platt, J. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.213 · Cited by 1,354
A new evolutionary system for evolving artificial neural networks
Yao, X., & Liu, Y. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572107 · Cited by 874
Learning long-term dependencies in NARX recurrent neural networks
Lin, T., Horne, B. G., Tino, P., & Giles, C. L. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.548162 · Cited by 784
LSTM recurrent networks learn simple context-free and context-sensitive languages
Gers, F. A., & Schmidhuber, E. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.963769 · Cited by 722
Self-citationBeneš, J. (1990) · Czech digital mathematics library · Cited by 649
Recurrent nets that time and count
Gers, F. A., & Schmidhuber, J. (2000) · Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks. IJCNN 2000. Neural Computing: New Challenges and Perspectives for the New Millennium · doi:10.1109/ijcnn.2000.861302 · Cited by 623
Self-citation
Cited by
Harnessing Nonlinearity: Predicting Chaotic Systems and Saving Energy in Wireless Communication
Jaeger, H., & Haas, H. (2004) · Science · doi:10.1126/science.1091277 · Cited by 3,811
DeepAR: Probabilistic forecasting with autoregressive recurrent networks
Salinas, D., Flunkert, V., Gasthaus, J., & Januschowski, T. (2020) · International Journal of Forecasting · doi:10.1016/j.ijforecast.2019.07.001 · Cited by 2,661
Deep Forest: Towards An Alternative to Deep Neural Networks
Zhou, Z.-H., & Feng, J. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/497 · Cited by 935
DeepAnT: A Deep Learning Approach for Unsupervised Anomaly Detection in Time Series
Munir, M., Siddiqui, S. A., Dengel, A., & Ahmed, S. (2019) · IEEE Access · doi:10.1109/access.2018.2886457 · Cited by 696
Predicting the Price of Bitcoin Using Machine Learning
McNally, S., Roche, J., & Caton, S. (2018) · 2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP) · doi:10.1109/pdp2018.2018.00060 · Cited by 665
Metadata
- Authors
- Gers, F. A., Eck, D., & Schmidhuber, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 669-676
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1560739766
- Cited by
- 334
- References
- 16
- FWCI
- 1.56
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Applying LSTM to Time Series Predictable through Time-Window Approaches. https://app.cochat.ai/papers/10.1007/3-540-44668-0_93
- The paper
- Gers, F. A., Eck, D., & Schmidhuber, J. (2001). Applying LSTM to Time Series Predictable through Time-Window Approaches. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-44668-0_93
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.