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.
AutoRec
2015764 citationsAditya Krishna Menon, Scott Sanner et al.ANU Open Research (Australian National University)profile →
Improving LDA topic models for microblogs via tweet pooling and automatic labeling
2013321 citationsScott Sanner, Lexing Xie et al.ANU Open Research (Australian National University)profile →
Online continual learning in image classification: An empirical survey
2021229 citationsZheda Mai, Ruiwen Li et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Scott Sanner'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 Scott Sanner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Scott Sanner more than expected).
This network shows the impact of papers produced by Scott Sanner. 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 Scott Sanner. The network helps show where Scott Sanner may publish in the future.
Co-authorship network of co-authors of Scott Sanner
This figure shows the co-authorship network connecting the top 25 collaborators of Scott Sanner.
A scholar is included among the top collaborators of Scott Sanner 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 Scott Sanner. Scott Sanner is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Sanner, Scott, et al.. (2018). Reinforcement Learning with Multiple Experts: A Bayesian Model Combination Approach. Neural Information Processing Systems. 31. 9528–9538.6 indexed citations
13.
Soh, Harold, et al.. (2017). Nonlinear Optimization and Symbolic Dynamic Programming for Parameterized Hybrid Markov Decision Processes.. National Conference on Artificial Intelligence.1 indexed citations
14.
Bui, Hung, Jaya Kawale, Nikos Vlassis, et al.. (2016). Practical linear models for large-scale one-class collaborative filtering. ANU Open Research (Australian National University). 3854–3860.10 indexed citations
15.
Sanner, Scott, et al.. (2012). Symbolic Dynamic Programming for Continuous State and Observation POMDPs. Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft). 25. 1394–1402.6 indexed citations
16.
Guo, Shengbo & Scott Sanner. (2010). Real-time Multiattribute Bayesian Preference Elicitation with Pairwise Comparison Queries. ANU Open Research (Australian National University). 289–296.25 indexed citations
17.
Downey, Carlton & Scott Sanner. (2010). Temporal Difference Bayesian Model Averaging: A Bayesian Perspective on Adapting Lambda. ANU Open Research (Australian National University). 311–318.12 indexed citations
18.
Sanner, Scott & Craig Boutilier. (2007). Approximate solution techniques for factored first-order MDPs. International Conference on Automated Planning and Scheduling. 288–295.11 indexed citations
19.
Sanner, Scott & Sheila A. McIlraith. (2006). An ordered theory resolution calculus for hybrid reasoning in first-order extensions of description logic. Principles of Knowledge Representation and Reasoning. 100–110.1 indexed citations
20.
Sanner, Scott & David McAllester. (2005). Affine algebraic decision diagrams (AADDs) and their application to structured probabilistic inference. International Joint Conference on Artificial Intelligence. 1384–1390.35 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.