Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Amy McGovern

dblp:61/200 · DBLP profile ↗
← Back
16ranked-venue papers
12as first author
1since 2021 · last 2025
0000-0001-6675-7119ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 11 · 8 first-author · 1 since 2021Databases, data management, data science and information retrieval · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
6 papers
Trustworthy machine learning · 67% Kernel, tree and ensemble methods · 15% Reinforcement learning · 12%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Human-computer interaction and pervasive computing
1 paper
Human-AI interaction · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Environmental and earth informatics · 100%

Topics — the 16 heaviest of 17, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Human-AI interaction
trust in AI
0.312025
(Re)Conceptualizing trustworthy AI: A foundation for change · Artif. Intell. 2025
Environmental and earth informatics
weather forecasting
0.212015
Day-Ahead Hail Prediction Integrating Machine Learning with Storm-Scale Numerical Weather Models · AAAI 2015
Data mining
probabilistic graphical models
0.112008
Spatiotemporal Relational Probability Trees: An Introduction · ICDM 2008
Data mining › predictive modeling › classification › decision tree learning
probability estimation trees
0.112008
Spatiotemporal Relational Probability Trees: An Introduction · ICDM 2008
Data mining › structured data mining
relational data mining
0.112008
Spatiotemporal Relational Probability Trees: An Introduction · ICDM 2008
Data mining
spatiotemporal data mining
0.112008
Spatiotemporal Relational Probability Trees: An Introduction · ICDM 2008
Machine learning › Reinforcement learning
relational reinforcement learning
0.112007
Utile Distinctions for Relational Reinforcement Learning · IJCAI 2007
Machine learning › Kernel, tree and ensemble methods
ensemble learning
0.112015
Day-Ahead Hail Prediction Integrating Machine Learning with Storm-Scale Numerical Weather Models · AAAI 2015
Machine learning › Kernel, tree and ensemble methods
gradient boosting
0.112015
Day-Ahead Hail Prediction Integrating Machine Learning with Storm-Scale Numerical Weather Models · AAAI 2015
Machine learning › Kernel, tree and ensemble methods › ensemble learning › tree ensembles
random forest
0.112015
Day-Ahead Hail Prediction Integrating Machine Learning with Storm-Scale Numerical Weather Models · AAAI 2015
Machine learning › Learning paradigms
multiple instance learning
0.012003
Identifying Predictive Structures in Relational Data Using Multiple Instance Learning · ICML 2003
Knowledge, reasoning and agents › Knowledge representation and reasoning
relational learning
0.012003
Identifying Predictive Structures in Relational Data Using Multiple Instance Learning · ICML 2003
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.012001
Automatic Discovery of Subgoals in Reinforcement Learning using Diverse Density · ICML 2001
Machine learning › Reinforcement learning › hierarchical reinforcement learning › option discovery
subgoal discovery
0.012001
Automatic Discovery of Subgoals in Reinforcement Learning using Diverse Density · ICML 2001
Machine learning › Reinforcement learning
reinforcement learning for combinatorial optimization
0.011998
Scheduling Straight-Line Code Using Reinforcement Learning and Rollouts · NIPS 1998
Compilers and program optimization
instruction scheduling
0.011998
Scheduling Straight-Line Code Using Reinforcement Learning and Rollouts · NIPS 1998

Methods — techniques the papers use, named apart from their topics

spatial neighborhood ensemble probability · 0.4random forest · 0.4linear regression · 0.4gradient boosting trees · 0.4sampling · 0.1probability estimation trees · 0.1reinforcement learning · 0.0multiple instance learning · 0.0diverse density · 0.0rollouts · 0.0rollout · 0.0
YearPublicationVenuePosition
2025 (Re)Conceptualizing trustworthy AI: A foundation for change
abstract
Developers and academics have grown increasingly interested in developing “trustworthy” artificial intelligence (AI). However, this aim is difficult to achieve in practice, especially given trust and trustworthiness are complex, multifaceted concepts that cannot be completely guaranteed nor built entirely into an AI system. We have drawn on the breadth of trust-related literature across multiple disciplines and fields to synthesize knowledge pertaining to interpersonal trust, trust in automation, and risk and trust. Based on this review we have (re)conceptualized trustworthiness in practice as being both (a) perceptual, meaning that a user assesses whether, when, and to what extent AI model output is trustworthy, even if it has been developed in adherence to AI trustworthiness standards, and (b) context-dependent, meaning that a user's perceived trustworthiness and use of an AI model can vary based on the specifics of their situation (e.g., time-pressures for decision-making, high-stakes decisions). We provide our reconceptualization to nuance how trustworthiness is thought about, studied, and evaluated by the AI community in ways that are more aligned with past theoretical research.
Christopher D. Wirz, Julie Demuth, Ann Bostrom, Mariana Cains, Imme Ebert-Uphoff, David John Gagne II, Andrea Schumacher, Amy McGovern, Deianna Madlambayan
Artif. Intell.8
2017 Moving from managing enrollment to predicting student success
abstract
We describe the construction and assessment of a plan to foster student success in Computer Science (CS) in response to continued enrollment growth. We examined cross correlations of grades from student transcripts from the past four years to determine what patterns of grades in early classes were indicative of future success. The resulting statistics and visualizations showed that students generally did better in the first class than subsequent classes, suggesting that C grades in the first class might indicate difficulty. We also examined students enrolled in the pre-capstone software engineering course. The analysis showed that no graduating CS major had received a C in both first two programming courses. We examined the data to be sure that the proposal would not diminish the participation of members of underrepresented groups disproportionately. As a result, the CS faculty approved a change in prerequisite for the third course to require that student receive an A or a B in at least one of the first two courses. GPA data was also analyzed and found to be a poor predictor of success in computer science, demonstrating that our previous approach to limiting enrollment was inferior. This new approach has advantages over the previous GPA-based plan, but enrollment management plans risk making college harder for at risk students to succeed in CS. The biggest limitation of this plan is that it is expected to make only a small change in CS enrollment.
Deborah Anne Trytten, Amy McGovern
FIE2
2015 Day-Ahead Hail Prediction Integrating Machine Learning with Storm-Scale Numerical Weather Models
abstract
Hail causes billions of dollars in losses by damaging buildings, vehicles, and crops. Improving the spatial and temporal accuracy of hail forecasts would allow people to mitigate hail damage. We have developed an approach to forecasting hail that identifies potential hail storms in storm-scale numerical weather prediction models and matches them with observed hailstorms. Machine learning models, including random forests, gradient boosting trees, and linear regression, are used to predict the expected hail size from each forecast storm. The individual hail size forecasts are merged with a spatial neighborhood ensemble probability technique to produce a consensus probability of hail at least 25.4 mm in diameter. The system was evaluated during the 2014 National Oceanic and Atmospheric Administration Hazardous Weather Testbed Experimental Forecast Program and compared with a physics-based hail size model. The machine-learning-based technique shows advantages in producing smaller size errors and more reliable probability forecasts. The machine learning approaches correctly predicted the location and extent of a significant hail event in eastern Nebraska and a marginal severe hail event in Colorado.
David John Gagne II, Amy McGovern, Jerald Brotzge, Michael Coniglio, James Correia Jr., Ming Xue
AAAI2
2014 Enhancing understanding and improving prediction of severe weather through spatiotemporal relational learning
abstract
Severe weather, including tornadoes, thunderstorms, wind, and hail annually cause significant loss of life and property. We are developing spatiotemporal machine learning techniques that will enable meteorologists to improve the prediction of these events by improving their understanding of the fundamental causes of the phenomena and by building skillful empirical predictive models. In this paper, we present significant enhancements of our Spatiotemporal Relational Probability Trees that enable autonomous discovery of spatiotemporal relationships as well as learning with arbitrary shapes. We focus our evaluation on two real-world case studies using our technique: predicting tornadoes in Oklahoma and predicting aircraft turbulence in the United States. We also discuss how to evaluate success for a machine learning algorithm in the severe weather domain, which will enable new methods such as ours to transfer from research to operations, provide a set of lessons learned for embedded machine learning applications, and discuss how to field our technique.
Amy McGovern, David John Gagne II, John K. Williams, Rodger A. Brown, Jeffrey B. Basara
Mach. Learn.1
2013 Making in-class competitions desirable for marginalized groups
abstract
Inspired by research that indicates that direct competition is not always comfortable for female students, we redesigned an existing class competition to permit students to choose whether they wished to participate in either direct or indirect competition. We pilot tested it in the Spring of 2013 in a undergraduate/graduate class on introductory artificial intelligence at the University of Oklahoma. Although the results for female students are inconclusive due to their small number, we observed that international students embraced the indirect competitions. This suggests that allowing the option of indirect competition may also appeal other groups of students who can be marginalized in engineering. Our results indicate the international students prefer the less risky option of indirect competition.
Amy McGovern, Deborah Anne Trytten
FIE1
2013 Enhanced spatiotemporal relational probability trees and forests
abstract
Many real world domains are inherently spatiotemporal in nature. In this work, we introduce significant enhancements to two spatiotemporal relational learning methods, the spatiotemporal relational probability tree and the spatiotemporal relational random forest, that increase their ability to learn using spatiotemporal data. We enabled the models to formulate questions on both objects and the scalar and vector fields within and around objects, allowing the models to differentiate based on the gradient, divergence, and curl and to recognize the shape of point clouds defined by fields. This enables the model to ask questions about the change of a shape over time or about its orientation. These additions are validated on several real-world hazardous weather datasets. We demonstrate that these additions enable the models to learn robust classifiers that outperform the versions without these new additions. In addition, analysis of the learned models shows that the findings are consistent with current meteorological theories.
Amy McGovern, Nathaniel Troutman, Rodger A. Brown, John K. Williams, Jennifer Abernethy
Data Min. Knowl. Discov.1
2011 Identifying predictive multi-dimensional time series motifs: an application to severe weather prediction
Amy McGovern, Derek H. Rosendahl, Rodger A. Brown, Kelvin Droegemeier
Data Min. Knowl. Discov.1
2011 Machine learning in space: extending our reach
Amy McGovern, Kiri Wagstaff
Mach. Learn.1
2008 Spatiotemporal Relational Probability Trees: An Introduction
abstract
We introduce spatiotemporal relational probability trees (SRPTs), probability estimation trees for relational data that can vary in both space and time. The SRPT algorithm addresses the exponential increase in search complexity through sampling. We validate the SRPT using a simulated data set and we empirically demonstrate the SRPT algorithm on two real-world data sets.
Amy McGovern, Nathan C. Hiers, Matthew W. Collier, David John Gagne II, Rodger A. Brown
ICDM1
2008 Optimistic pruning for multiple instance learning
Amy McGovern, David D. Jensen
Pattern Recognit. Lett.1
2007 Utile Distinctions for Relational Reinforcement Learning
William Dabney, Amy McGovern
IJCAI2
2007 Creating significant learning experiences in introductory artificial intelligence
abstract
We introduced an arcade-style gaming environment for use in a mixed undergraduate and graduate introductory artificial intelligence (AI) course. Our primary goal in this course was to provide students with a "significant learning experience" [3]. We achieved this goal by creating projects based in the game environment that illustrate several major AI topic areas. These projects were designed to be challenging, enjoyable, and to demonstrate AI programming in a realistic environment. Each of the projects was designed to be feasible for all the students yet flexible enough to allow the stronger students to explore alternative solutions. We evaluated our success in achieving these goals through student evaluations, comments, and exam grades.
Amy McGovern, Jason Fager
SIGCSE1
2003 Identifying Predictive Structures in Relational Data Using Multiple Instance Learning
Amy McGovern, David D. Jensen
ICML1
2002 Building a Basic Block Instruction Scheduler with Reinforcement Learning and Rollouts
Amy McGovern, J. Eliot B. Moss, Andrew G. Barto
Mach. Learn.1
2001 Automatic Discovery of Subgoals in Reinforcement Learning using Diverse Density
Amy McGovern, Andrew G. Barto
ICML1
1998 Scheduling Straight-Line Code Using Reinforcement Learning and Rollouts
Amy McGovern, J. Eliot B. Moss
NIPS1