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

Iain Nicholas Smith

dblp:354/9847 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none

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

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

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
1 paper
Planning, search and constraint satisfaction · 77% Multi-agent systems · 23%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game tree search
monte carlo tree search
0.612022
Artificial Intelligence Approaches to Build Ticket to Ride Maps · AAAI 2022
Knowledge, reasoning and agents › Multi-agent systems › autonomous agents
game-playing agents
0.212022
Artificial Intelligence Approaches to Build Ticket to Ride Maps · AAAI 2022

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

planar bipartite graph construction · 0.6monte carlo tree search · 0.6
YearPublicationVenuePosition
2025 Cluster weighted models for functional data
Cristina Anton, Iain Nicholas Smith
Mach. Learn.2
2023 Mining COVID-19 Data to Predict The Effect of Policies on Severity of Outbreaks
abstract
During the years 2020, 2021, and partially 2022, the COVID-19 virus ran rampant across the globe, causing devastating effects on the masses. Using data mining techniques, we explored factors linked to severe cases of COVID-19 and tried to identify the effect of different government policies on the evolution of the severity of infections. Four countries were selected with a date range of the year 2021 to investigate each region’s efforts regarding vaccine distribution and specific policies enacted for COVID-19 suppression. Pearson’s Correlation Coefficients were used to help establish initially relationships between the policies, vaccines, and severe cases. We used the identified factors to predict the number of new COVID-19 cases and hospital ICU admissions. We included all the country data from Our World in Data (OWID) for this phase. Our investigation indicates that, given enough data, long-range trend predictions can be obtained using Random Forest Regressors. A trained Random Forest model can readily explain factors that effectively slow the spread of COVID-19. With proposed policies given as input, the model can return the expected number of cases, thus informing policies without spending multiple weeks tracking results.
Mohamad El-Hajj, Calin Anton, Cristina Anton, Dominic Dobosz, Iain Nicholas Smith, Fattima Deiab, Nagam Saleh
BIBM5
2022 Artificial Intelligence Approaches to Build Ticket to Ride Maps
abstract
Fun, as a game trait, is challenging to evaluate. Previous research explores game arc and game refinement to improve the quality of games. Fun, for some players, is having an even chance to win while executing their strategy. To explore this, we build boards for the game Ticket to Ride while optimizing for a given win rate between four AI agents. These agents execute popular strategies human players use: one-step thinking, long route exploitation, route focus, and destination hungry strategies. We create the underlying graph of a map by connecting several planar bipartite graphs. To build the map, we use a multiple phase design, with each phase implementing several simplified Monte Carlo Tree Search components. Within a phase, the components communicate with each other passively. The experiments show that the proposed approach results in improvements over randomly generated graphs and maps.
Iain Nicholas Smith, Calin Anton
AAAI1