Koby Crammer
About
In The Last Decade
Koby Crammer
93 papers receiving 7.6k citations
Hit Papers
Peers
Comparison fields: 5 of 178
- Artificial Intelligence 6.1k
- Computer Vision and Pattern Recognition 2.6k
- Information Systems 643
- Management Science and Operations Research 579
- Signal Processing 554
Countries citing papers authored by Koby Crammer
This map shows the geographic impact of Koby Crammer'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 Koby Crammer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Koby Crammer more than expected).
Fields of papers citing papers by Koby Crammer
This network shows the impact of papers produced by Koby Crammer. 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 Koby Crammer. The network helps show where Koby Crammer may publish in the future.
Co-authorship network of co-authors of Koby Crammer
This figure shows the co-authorship network connecting the top 25 collaborators of Koby Crammer. A scholar is included among the top collaborators of Koby Crammer 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 Koby Crammer. Koby Crammer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | A Better Resource Allocation Algorithm with Semi-Bandit Feedback | 0 |
| 2 | Convex Multi-Task Learning by Clustering | 16 |
| 3 | Concept Drift Detection Through Resampling | 50 |
| 4 | Prediction with Limited Advice and Multiarmed Bandits with Paid Observations | 19 |
| 5 | 1 | |
| 6 | Hartigan's K-means versus Lloyd's K-means: is it time for a change? | 17 |
| 7 | More Is Better: Large Scale Partially-supervised Sentiment Classication | 2 |
| 8 | Adaptive Regularization for Similarity Measures. | 2 |
| 9 | Volume Regularization for Binary Classification | 2 |
| 10 | Training Dependency Parser Using Light Feedback | 1 |
| 11 | Learning Multiple Tasks using Shared Hypotheses | 20 |
| 12 | Metric Learning for Graph-Based Domain Adaptation | 4 |
| 13 | 8 | |
| 14 | Confidence in Structured-Prediction Using Confidence-Weighted Models | 16 |
| 15 | Gaussian Margin Machines | 18 |
| 16 | Learning Bounds for Domain Adaptation | 215 |
| 17 | Online Classification on a Budget | 94 |
| 18 | Online Passive-Aggressive Algorithms | 54 |
| 19 | Kernel Design Using Boosting | 93 |
| 20 | Improved Output Coding for Classification Using Continuous Relaxation | 17 |
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.