Alistair Moffat
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alistair Moffat has a total of 133 co-authors. Here are the top co-authors by number of shared publications:
Justin Zobel
The University of Melbourne
29 shared publications- J. Shane Culpepper
The University of Queensland, Brisbane, Australia
21 shared publications - Joel Mackenzie
The University of Queensland, Brisbane, Australia
12 shared publications Vo Ngoc Anh
Department of Computer Science and Software Engineering, The University of Melbourne, Victoria 3010, Australia
12 shared publications- Artem Polyvyanyy
The University of Melbourne
11 shared publications - Falk Scholer
RMIT University, Melbourne, Australia
11 shared publications
Latest Publications
- Open Access
- 24 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 129-138
Does Form Affect Function? An Extended Study of LLM Re-Ranking Behavior
- 24 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 129-138
Open AccessDoes Form Affect Function? An Extended Study of LLM Re-Ranking Behavior
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3593-3597
Modalities of Expert Search: How Users Transition Between Names and Topics
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3593-3597
Open AccessModalities of Expert Search: How Users Transition Between Names and Topics
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4005-4009
Targeted Parameter Selection for Rank-Biased Measurement
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4005-4009
Open AccessTargeted Parameter Selection for Rank-Biased Measurement
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3743-3747
On the Robustness of LLM Re-Rankings
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3743-3747
Open AccessOn the Robustness of LLM Re-Rankings
- 8 June 2026
- Published by Springer Nature
- p. 322-337
Conditioning and Stability in Process Discovery
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 4-5
(Everything You Never Knew You Needed To Know About) Rank-Biased Measurement For Web Search
Measurement is a fundamental human activity. It is through measurement that we identify opportunity, and via opportunity that we seek improvement. In information retrieval and web search we measure how good search engines are at ordering answers to user queries, how close two ranked lists are to each other, how good LLMs are at re-ranking sets of candidate documents, and how close generated answer sentences are to the ideal output. This talk begins by motivating the well-known ''top-weighted'' measurements that are used when assessing the quality of a ranked list of documents against known annotations (qrels). In particular, Moffat and Zobel [2] suggest use of a parameterized geometric distribution to assign weights to ranks, arguing that a distribution with a bounded infinite sum is preferable to ones with unbounded sums; and also motivating the geometric sequence via a proposed user browsing model, the first time this had been done. Their rankbiased precision mechanism has the further advantage of allowing the extent of the uncertainty to be quantified, where uncertainty arises whenever the qrels are not comprehensive.
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 4-5
Open Access(Everything You Never Knew You Needed To Know About) Rank-Biased Measurement For Web Search
Measurement is a fundamental human activity. It is through measurement that we identify opportunity, and via opportunity that we seek improvement. In information retrieval and web search we measure how good search engines are at ordering answers to user queries, how close two ranked lists are to each other, how good LLMs are at re-ranking sets of candidate documents, and how close generated answer sentences are to the ideal output. This talk begins by motivating the well-known ''top-weighted'' measurements that are used when assessing the quality of a ranked list of documents against known annotations (qrels). In particular, Moffat and Zobel [2] suggest use of a parameterized geometric distribution to assign weights to ranks, arguing that a distribution with a bounded infinite sum is preferable to ones with unbounded sums; and also motivating the geometric sequence via a proposed user browsing model, the first time this had been done. Their rankbiased precision mechanism has the further advantage of allowing the extent of the uncertainty to be quantified, where uncertainty arises whenever the qrels are not comprehensive.
- 24 March 2026
- Published by Springer Nature
- p. 399-414
FaE: A Resource of Logs, Profiles, and Rankings for Academic Expert Finding
- 24 March 2026
- Published by Springer Nature
- p. 399-414
FaE: A Resource of Logs, Profiles, and Rankings for Academic Expert Finding
- Open Access
- 6 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 325-330
Empirical Asymptotic Growth of Dynamic Pruning Mechanisms
- 6 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 325-330
Open AccessEmpirical Asymptotic Growth of Dynamic Pruning Mechanisms
- Open Access
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 198540-198563
The Effects of Log Noise in Process Mining
Process mining bridges the gap between theoretical models and real-world processes by extracting actionable insights from the event logs generated by business operations. The growing importance of process mining means that the presence of noise in event logs poses a significant obstacle, reducing the accuracy and dependability of analysis. Moreover, the concept of noise lacks a unified definition in process mining. To address that challenge, we present a comprehensive review of the literature to consolidate definitions of noise and establish a unified taxonomy, deriving a hierarchical decomposition framework of noise types, and discussing their origins. Building on this framework, we next introduce a noise injection tool, called SNIP, that enables controlled experimentation by simulating various noise scenarios in event logs, with our discussion here supported by a case study demonstrating the tool’s application. Lastly, we explore how established noise concepts from related disciplines can be applied to enrich process mining methodologies. Together, these contributions provide a structured foundation for understanding noise in event logs, promoting more robust and reliable process mining outcomes.
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 198540-198563
Open AccessThe Effects of Log Noise in Process Mining
Process mining bridges the gap between theoretical models and real-world processes by extracting actionable insights from the event logs generated by business operations. The growing importance of process mining means that the presence of noise in event logs poses a significant obstacle, reducing the accuracy and dependability of analysis. Moreover, the concept of noise lacks a unified definition in process mining. To address that challenge, we present a comprehensive review of the literature to consolidate definitions of noise and establish a unified taxonomy, deriving a hierarchical decomposition framework of noise types, and discussing their origins. Building on this framework, we next introduce a noise injection tool, called SNIP, that enables controlled experimentation by simulating various noise scenarios in event logs, with our discussion here supported by a case study demonstrating the tool’s application. Lastly, we explore how established noise concepts from related disciplines can be applied to enrich process mining methodologies. Together, these contributions provide a structured foundation for understanding noise in event logs, promoting more robust and reliable process mining outcomes.
- Open Access
- 20 October 2025
- Published by Springer Nature in Process Science
- Vol. 2 (1) , 1-28
Generalization estimation in process mining: the impact of event data quality
- 20 October 2025
- Published by Springer Nature in Process Science
- Vol. 2 (1) , 1-28
Open AccessGeneralization estimation in process mining: the impact of event data quality