Robert E. Schapire
Impact in
- Ecological Modeling top 0.01%
- Species Distribution and Climate Change
- Artificial Intelligence top 0.01%
- Machine Learning and Algorithms
- Machine Learning and Data Classification
- Imbalanced Data Classification Techniques
- Text and Document Classification Technologies
Papers in
-
- Machine Learning and Algorithms 97
- Machine Learning and Data Classification 31
- Algorithms and Data Compression 27
- Imbalanced Data Classification Techniques 20
- Neural Networks and Applications 14
-
- Advanced Bandit Algorithms Research 37
- Auction Theory and Applications 12
- Co-authors
- Yoav Freund (26 shared papers)Steven J. Phillips (5 shared papers)Robert P. Anderson (2 shared papers)Yoram Singer (14 shared papers)Miroslav Dudı́k (11 shared papers)Mary E. Blair (1 shared paper)Peter L. Bartlett (2 shared papers)Nicolò Cesa‐Bianchi (4 shared papers)
- Journals
- Machine Learning (18 papers)Journal of Machine Learning Research (8 papers)Journal of Computer and System Sciences (3 papers)Information and Computation (3 papers)Journal of the ACM (3 papers)
- Partner nations
- United StatesIsraelGermany
In The Last Decade
Robert E. Schapire
155 papers receiving 56.4k citations
Robert E. Schapire's Hit Papers
Peers
Comparison fields: 5 of 233
- Ecological Modeling 11.3k
- Artificial Intelligence 23.9k
- Computer Vision and Pattern Recognition 11.7k
- Nature and Landscape Conservation 5.3k
- Ecology 8.5k
Countries citing papers authored by Robert E. Schapire
This map shows the geographic impact of Robert E. Schapire'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 Robert E. Schapire with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert E. Schapire more than expected).
Fields of papers citing papers by Robert E. Schapire
This network shows the impact of papers produced by Robert E. Schapire. 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 Robert E. Schapire. The network helps show where Robert E. Schapire may publish in the future.
Co-authors
The 25 scholars most cited alongside Robert E. Schapire, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 160 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Maximum entropy modeling of species geographic distributions Hit paper breakdown → | 2005 | 13642 |
| 2 | A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting Hit paper breakdown → | 1997 | 12974 |
| 3 | Experiments with a new boosting algorithm Hit paper breakdown → | 1996 | 5032 |
| 4 | The Strength of Weak Learnability Hit paper breakdown → | 1990 | 2101 |
| 5 | Opening the black box: an open‐source release of Maxent Hit paper breakdown → | 2017 | 2035 |
| 6 | A Short Introduction to Boosting Hit paper breakdown → | 1999 | 1950 |
| 7 | The strength of weak learnability Hit paper breakdown → | 1990 | 1905 |
| 8 | Improved boosting algorithms using confidence-rated predictions Hit paper breakdown → | 1998 | 1778 |
| 9 | A maximum entropy approach to species distribution modeling Hit paper breakdown → | 2004 | 1739 |
| 10 | Boosting the margin: a new explanation for the effectiveness of voting methods Hit paper breakdown → | 1998 | 1537 |
| 11 | BoosTexter: A Boosting-based System for Text Categorization Hit paper breakdown → | 2000 | 1466 |
| 12 | Improved Boosting Algorithms Using Confidence-rated Predictions Hit paper breakdown → | 1999 | 1453 |
| 13 | The Nonstochastic Multiarmed Bandit Problem Hit paper breakdown → | 2002 | 1092 |
| 14 | A brief introduction to boosting Hit paper breakdown → | 1999 | 785 |
| 15 | Large margin classification using the perceptron algorithm Hit paper breakdown → | 1998 | 740 |
| 16 | Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers Hit paper breakdown → | 2000 | 722 |
| 17 | An Efficient Boosting Algorithm for Combining Preferences Hit paper breakdown → | 1998 | 643 |
| 18 | Logistic Regression, AdaBoost and Bregman Distances Hit paper breakdown → | 2002 | 466 |
| 19 | 1999 | 399 | |
| 20 | Boosting the margin: A new explanation for the effectiveness of voting methods | 1997 | 395 |
About Robert E. Schapire
Robert E. Schapire is a scholar working on Artificial Intelligence, Management Science and Operations Research, Computational Theory and Mathematics, Computer Networks and Communications and Computer Vision and Pattern Recognition, having authored 160 papers that have together received 60.1k indexed citations. Recurring topics across this work include Machine Learning and Algorithms (97 papers), Advanced Bandit Algorithms Research (37 papers), Machine Learning and Data Classification (31 papers), Algorithms and Data Compression (27 papers), Imbalanced Data Classification Techniques (20 papers), Optimization and Search Problems (17 papers), Neural Networks and Applications (14 papers) and Auction Theory and Applications (12 papers). The work is most often cited by research in Ecological Modeling (11.3k citations), Artificial Intelligence (23.9k citations), Computer Vision and Pattern Recognition (11.7k citations), Nature and Landscape Conservation (5.3k citations) and Ecology (8.5k citations). Robert E. Schapire has collaborated with scholars based in United States, Israel and Germany. Frequent co-authors include Yoav Freund, Steven J. Phillips, Robert P. Anderson, Yoram Singer, Miroslav Dudı́k, Mary E. Blair, Peter L. Bartlett, Nicolò Cesa‐Bianchi, Peter Auer and Michael Kearns. Their work appears in journals such as Machine Learning, Journal of Machine Learning Research, Journal of Computer and System Sciences, Information and Computation and Journal of the ACM.
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.