Machine Learning

2.6k papers and 321.7k indexed citations
i
.

About

The 2.6k papers published in Machine Learning in the last decades have received a total of 321.7k indexed citations. Papers published in Machine Learning usually cover Artificial Intelligence (2.1k papers), Computer Vision and Pattern Recognition (420 papers) and Computational Theory and Mathematics (357 papers) specifically the topics of Machine Learning and Algorithms (573 papers), Machine Learning and Data Classification (408 papers) and Data Mining Algorithms and Applications (221 papers). The most active scholars publishing in Machine Learning are Leo Breiman, Vladimir Vapnik, Corinna Cortes, J. R. Quinlan, Robert E. Schapire, Peter Dayan, Richard S. Sutton, Christopher J. Watkins, Ronald J. Williams and Rich Caruana.

In The Last Decade

Machine Learning

2.3k papers receiving 285.9k citations

Fields of papers published in Machine Learning

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers published in Machine Learning. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers published in Machine Learning.

Countries where authors publish in Machine Learning

Since Specialization
Citations

This map shows the geographic impact of research published in Machine Learning. 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 papers published in Machine Learning with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Machine Learning more than expected).

Random Forests 1995 2026 2005 2015 74.2k
  1. Random Forests (2001)
  2. Support-vector networks (1995)
  3. Support-Vector Networks (1995)
  4. Bagging predictors (1996)
  5. Bagging Predictors (1996)
  6. Induction of decision trees (1986)
  7. Induction of Decision Trees (1986)
  8. Gene Selection for Cancer Classification using Support Vector Machines (2002)
  9. Q-learning (1992)
  10. Extremely randomized trees (2006)
  11. Simple statistical gradient-following algorithms for connectionist reinforcement learning (1992)
  12. Multitask Learning (1997)
  13. Bayesian Network Classifiers (1997)
  14. Finite-time Analysis of the Multiarmed Bandit Problem (2002)
  15. Instance-Based Learning Algorithms (1991)
  16. Genetic Algorithms and Machine Learning (1988)
  17. Theoretical and Empirical Analysis of ReliefF and RReliefF (2003)
  18. Technical Note: Q-Learning (1992)
  19. Support Vector Data Description (2003)
  20. A Bayesian Method for the Induction of Probabilistic Networks from Data (1992)
  21. Instance-based learning algorithms (1991)
  22. Learning to Predict by the Methods of Temporal Differences (1988)
  23. An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization (2000)
  24. The Strength of Weak Learnability (1990)
  25. An Introduction to Variational Methods for Graphical Models (1999)
  26. Learning Bayesian Networks: The Combination of Knowledge and Statistical Data (1995)
  27. On the Optimality of the Simple Bayesian Classifier under Zero-One Loss (1997)
  28. A theory of learning from different domains (2009)
  29. The strength of weak learnability (1990)
  30. Learning to predict by the methods of temporal differences (1988)
  31. A survey on semi-supervised learning (2019)
  32. A Bayesian method for the induction of probabilistic networks from data (1992)
  33. A Simple Generalisation of the Area Under the ROC Curve for Multiple Class Classification Problems (2001)
  34. Learning Bayesian networks: The combination of knowledge and statistical data (1995)
  35. Classifier chains for multi-label classification (2011)
  36. Improved Boosting Algorithms Using Confidence-rated Predictions (1999)
  37. Self-improving reactive agents based on reinforcement learning, planning and teaching (1992)

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.

Explore journals with similar magnitude of impact

Rankless by CCL
2026