Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Fast Learning in Networks of Locally-Tuned Processing Units
19893.0k citationsJohn Moody, Christian J. Darkenprofile →
This map shows the geographic impact of John Moody's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by John Moody with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Moody more than expected).
This network shows the impact of papers produced by John Moody. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by John Moody. The network helps show where John Moody may publish in the future.
Co-authorship network of co-authors of John Moody
This figure shows the co-authorship network connecting the top 25 collaborators of John Moody.
A scholar is included among the top collaborators of John Moody based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with John Moody. John Moody is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Moody, John, et al.. (2004). Stochastic Direct Reinforcement: Application to Simple Games with Recurrence.. National Conference on Artificial Intelligence. 23–34.7 indexed citations
Dunis, Christian L., John Moody, & Allan Timmermann. (2001). Developments in forecast combination and portfolio choice. Wiley eBooks.35 indexed citations
Burgess, Andrew N., et al.. (1998). Decision technologies for computational finance : proceedings of the Fifth International Conference Computational Finance. Kluwer Academic Publishers eBooks.2 indexed citations
11.
Moody, John. (1991). The Effective Number of Parameters: An Analysis of Generalization and Regularization in Nonlinear Learning Systems. Neural Information Processing Systems. 4. 847–854.318 indexed citations
12.
Moody, John, et al.. (1991). Principled Architecture Selection for Neural Networks: Application to Corporate Bond Rating Prediction. Neural Information Processing Systems. 4. 683–690.66 indexed citations
13.
Moody, John & Norman Yarvin. (1991). Networks with Learned Unit Response Functions. Neural Information Processing Systems. 4. 1048–1055.21 indexed citations
14.
Darken, Christian J. & John Moody. (1991). Towards Faster Stochastic Gradient Search. Neural Information Processing Systems. 4. 1009–1016.64 indexed citations
15.
Darken, Christian J. & John Moody. (1990). Note on Learning Rate Schedules for Stochastic Optimization. Neural Information Processing Systems. 3. 832–838.93 indexed citations
Moody, John, et al.. (1989). Note on Development of Modularity in Simple Cortical Models. Neural Information Processing Systems. 2. 133–140.3 indexed citations
18.
Moody, John. (1988). Fast Learning in Multi-Resolution Hierarchies. Neural Information Processing Systems. 1. 29–39.103 indexed citations
Eğecioǧlu, Ömer, Terence R. Smith, & John Moody. (1987). Computable functions and complexity in neural networks. Elsevier eBooks. 135–164.2 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.