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

Michael Geden

dblp:216/5629 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 2Applied, interdisciplinary, general and emerging computing · 1

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.

Human-computer interaction and pervasive computing
1 paper
Learning and educational technologies · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
multi-objective optimization
0.512021
Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization · AAAI 2021
Machine learning › Trustworthy machine learning
fairness
0.112021
Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization · AAAI 2021
Computational social science and digital humanities
algorithmic decision-making
0.112021
Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization · AAAI 2021
Computational social science and digital humanities › algorithmic decision-making
algorithmic hiring
0.112021
Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization · AAAI 2021
Learning and educational technologies
educational games
0.112020
Predictive Student Modeling in Educational Games with Multi-Task Learning · AAAI 2020

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

dirichlet-based genetic operators · 1.5bi-goal evolution · 1.5SPEA2-SDE · 1.5NSGA-III · 1.5stacked LSTM · 0.4sequential representation learning · 0.4residual connections · 0.4
YearPublicationVenuePosition
2021 Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization
abstract
Hiring is a high-stakes decision-making process that balances the joint objectives of being fair and accurately selecting the top candidates. The industry standard method employs subject-matter experts to manually generate hiring algorithms; however, this method is resource intensive and finds sub-optimal solutions. Despite the recognized need for algorithmic hiring solutions to address these limitations, no reported method currently supports optimizing predictive objectives while complying to legal fairness standards. We present the novel application of Evolutionary Many-Objective Optimization (EMOO) methods to create the first fair, interpretable, and legally compliant algorithmic hiring approach. Using a proposed novel application of Dirichlet-based genetic operators for improved search, we compare state-of-the-art EMOO models (NSGA-III, SPEA2-SDE, bi-goal evolution) to expert solutions, verifying our results across three real world datasets across diverse organizational positions. Experimental results demonstrate the proposed EMOO models outperform human experts, consistently generate fairer hiring algorithms, and can provide additional lift when removing constraints required for human analysis.
Michael Geden, Joshua Andrews
AAAI1
2020 Predictive Student Modeling in Educational Games with Multi-Task Learning
abstract
Modeling student knowledge is critical in adaptive learning environments. Predictive student modeling enables formative assessment of student knowledge and skills, and it drives personalized support to create learning experiences that are both effective and engaging. Traditional approaches to predictive student modeling utilize features extracted from students’ interaction trace data to predict student test performance, aggregating student test performance as a single output label. We reformulate predictive student modeling as a multi-task learning problem, modeling questions from student test data as distinct “tasks.” We demonstrate the effectiveness of this approach by utilizing student data from a series of laboratory-based and classroom-based studies conducted with a game-based learning environment for microbiology education, Crystal Island. Using sequential representations of student gameplay, results show that multi-task stacked LSTMs with residual connections significantly outperform baseline models that do not use the multi-task formulation. Additionally, the accuracy of predictive student models is improved as the number of tasks increases. These findings have significant implications for the design and development of predictive student models in adaptive learning environments.
Michael Geden, Andrew Emerson, Jonathan P. Rowe, Roger Azevedo, James C. Lester
AAAI1
2020 Automated Analysis of Middle School Students' Written Reflections During Game-Based Learning
Dan Carpenter, Michael Geden, Jonathan P. Rowe, Roger Azevedo, James C. Lester
AIED (1)2
2020 Predictive Student Modeling in Block-Based Programming Environments with Bayesian Hierarchical Models
abstract
Recent years have seen a growing interest in block-based programming environments for computer science education. Although block-based programming offers a gentle introduction to coding for novice programmers, introductory computer science still presents significant challenges, so there is a great need for block-based programming environments to provide students with adaptive support. Predictive student modeling holds significant potential for adaptive support in block-based programming environments because it can identify early on when a student is struggling. However, predictive student models often make a number of simplifying assumptions, such as assuming a normal response distribution or homogeneous student characteristics, which can limit the predictive performance of models. These assumptions, when invalid, can significantly reduce the predictive accuracy of student models.
Andrew Emerson, Michael Geden, Andy Smith, Eric N. Wiebe, Bradford W. Mott, Kristy Elizabeth Boyer, James C. Lester
UMAP2