activity
20132023
most citedBoosting Search Performance Using Query Variations

28 citations · 47 across the 13 of their papers we have counts for

collaborators

15 papers

cs.IR2023

How Much Freedom Does An Effectiveness Metric Really Have?

Alistair Moffat, Joel Mackenzie

It is tempting to assume that because effectiveness metrics have free choice to assign scores to search engine result pages (SERPs) there must thus be a similar degree of freedom a…

cs.IR2022★ 4 cited

Efficient Immediate-Access Dynamic Indexing

Alistair Moffat, Joel Mackenzie

In a dynamic retrieval system, documents must be ingested as they arrive, and be immediately findable by queries. Our purpose in this paper is to describe an index structure and pr…

cs.IR2022★ 1 cited

Batch Evaluation Metrics in Information Retrieval: Measures, Scales, and Meaning

Alistair Moffat

A sequence of recent papers has considered the role of measurement scales in information retrieval (IR) experimentation, and presented the argument that (only) uniform-step interva…

cs.IR2022

A Sensitivity Analysis of the MSMARCO Passage Collection

Joel Mackenzie, Matthias Petri, Alistair Moffat

The recent MSMARCO passage retrieval collection has allowed researchers to develop highly tuned retrieval systems. One aspect of this data set that makes it distinctive compared to…

cs.AI2021

Bootstrapping Generalization of Process Models Discovered From Event Data

Artem Polyvyanyy, Alistair Moffat, Luciano García-Bañuelos

Process mining extracts value from the traces recorded in the event logs of IT-systems, with process discovery the task of inferring a process model for a log emitted by some unkno…

cs.IR2021

Anytime Ranking on Document-Ordered Indexes

Joel Mackenzie, Matthias Petri, Alistair Moffat

Inverted indexes continue to be a mainstay of text search engines, allowing efficient querying of large document collections. While there are a number of possible organizations, do…

cs.IR2020

RMITB at TREC COVID 2020

Rodger Benham, Alistair Moffat, J. Shane Culpepper

Search engine users rarely express an information need using the same query, and small differences in queries can lead to very different result sets. These user query variations ha…

cs.AI2020★ 6 cited

Entropia: A Family of Entropy-Based Conformance Checking Measures for Process Mining

Artem Polyvyanyy, Hanan Alkhammash, Claudio Di Ciccio +6

This paper presents a command-line tool, called Entropia, that implements a family of conformance checking measures for process mining founded on the notion of entropy from informa…

cs.AI2020

An Entropic Relevance Measure for Stochastic Conformance Checking in Process Mining

Artem Polyvyanyy, Alistair Moffat, Luciano García-Bañuelos

Given an event log as a collection of recorded real-world process traces, process mining aims to automatically construct a process model that is both simple and provides a useful e…

cs.IR2018★ 28 cited

Boosting Search Performance Using Query Variations

Rodger Benham, Joel Mackenzie, Alistair Moffat +1

Rank fusion is a powerful technique that allows multiple sources of information to be combined into a single result set. However, to date fusion has not been regarded as being cost…

cs.DS2016

CSA++: Fast Pattern Search for Large Alphabets

Simon Gog, Alistair Moffat, Matthias Petri

Indexed pattern search in text has been studied for many decades. For small alphabets, the FM-Index provides unmatched performance, in terms of both space required and search speed…

cs.IT2016★ 4 cited

Access Time Tradeoffs in Archive Compression

Matthias Petri, Alistair Moffat, P. C. Nagesh +1

Web archives, query and proxy logs, and so on, can all be very large and highly repetitive; and are accessed only sporadically and partially, rather than continually and holistical…

cs.IR2015

Assessing Efficiency-Effectiveness Tradeoffs in Multi-Stage Retrieval Systems Without Using Relevance Judgments

Charles L. A. Clarke, J. Shane Culpepper, Alistair Moffat

Large-scale retrieval systems are often implemented as a cascading sequence of phases -- a first filtering step, in which a large set of candidate documents are extracted using a s…

cs.DS2013★ 4 cited

From Theory to Practice: Plug and Play with Succinct Data Structures

Simon Gog, Timo Beller, Alistair Moffat +1

Engineering efficient implementations of compact and succinct structures is a time-consuming and challenging task, since there is no standard library of easy-to- use, highly optimi…

cs.DS2013

Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays

Simon Gog, Alistair Moffat, J. Shane Culpepper +2

The suffix array is an efficient data structure for in-memory pattern search. Suffix arrays can also be used for external-memory pattern search, via two-level structures that use a…