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

Jamal Mohammed

dblp:384/0159 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0003-3485-4303ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
time series analysis
0.812024
Quantifying and Estimating the Predictability Upper Bound of Univariate Numeric Time Series · KDD 2024
Information theory › information measures › entropy › entropy rate
entropy rate estimation
0.812024
Quantifying and Estimating the Predictability Upper Bound of Univariate Numeric Time Series · KDD 2024
Data mining › time series analysis
time series forecasting
0.212024
Quantifying and Estimating the Predictability Upper Bound of Univariate Numeric Time Series · KDD 2024

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

tolerance thresholds · 1.5lempel-ziv compression · 1.5
YearPublicationVenuePosition
2025 Explaining Autonomous Navigation to Human-in-the-Loop Operator in Multi-Task Rotorcraft Search & Rescue Operations
abstract
Aerial search and rescue (SAR) rotorcrafts currently need multiple specialist human operators, increasing cost and the risk of downtime due to crew unavailability and mental stress. Autonomy can aid fewer operators performing multiple tasks, but the human operator must maintain situation awareness (SA) of crucial autonomous decisions. A key challenge is the cognitive stress on a multi-tasking human-in-the-loop (HITL) due to the AI agent making decisions without human understanding. Explainable AI (XAI) has often been proposed as a way to explain autonomy decisions, but current XAI solutions doesn’t adapt to real-time human factors in high stress and high stakes situations. Here, we allow an AI agent to perform autonomous rotorcraft navigation, whilst the HITL operator has to perform two simultaneous tasks: (i) search for a target on the ground by toggling an onboard camera, and (ii) maintain SA of the autonomous navigation task through our novel XAI interface. Our novel XAI approach leverages on dimensionality reduction techniques to visualize the reinforcement learning (RL) navigation’s internal states, highlighting patterns in its decision-making process through intuitive interactive clustering on saliency maps. To ensure convergence on performance, we design a two-way interface that allows the human to interpret AI decisions and then give feedback via a Large Language Model to modify the autonomous navigation. Testing demonstrates increased task performance (+43%), while experiencing substantial human reductions in physical demand (-53%), time pressure (-30%), effort (-23%), and frustration (-26%), but at the cost of slightly increased mental demand (+12%).
Nathaniel Amadi, Samuel Cartwright, Noe Claudel, Jamal Mohammed, Kenechukwu Agbo, Paris Chatzithanos, Mariusz Wisniewski, Antonios Tsourdos, Yang Xing 0002, Weisi Guo
SMC4
2024 Quantifying and Estimating the Predictability Upper Bound of Univariate Numeric Time Series
abstract
The intrinsic predictability of a given time series indicates how well an (ideal) algorithm could potentially predict it when trained on the time series data. Being able to compute the intrinsic predictability helps the developers of prediction algorithms immensely in deciding whether there is further optimization potential, as it tells them how close they are to what is (theoretically) achievable. We call the intrinsic predictability the predictability upper bound ¶imax and propose a novel method for quantifying and estimating it for univariate numeric time series. So far, this has only been done for symbolic time series, even though most real-world time series are numeric by nature. We base our technique on the close relationship between entropy and predictability, utilizing the entropy rate of a time series to compute ¶imax . Since existing entropy rate estimators, such as those based on the Lempel-Ziv compression algorithm, only work for symbolic data, we develop new estimators using tolerance thresholds for matching numeric values. We demonstrate that ¶imax is an effective upper bound that characterizes the intrinsic predictability of a time series. We give formal proofs and we validate our arguments experimentally by comparing ¶imax with the prediction accuracy of different state-of-the-art models on various real-world datasets from different domains.
Jamal Mohammed, Michael H. Böhlen, Sven Helmer
KDD1