Search Results for author:
Found 17 papers, 6 papers with code
Categorical, Ratio, and Professorial Data: The Case for Reciprocal Rank
Search engine results pages are usually abstracted as binary relevance vectors and hence are categorical data, meaning that only a limited set of operations is permitted, most notably tabulation of occurrence frequencies, with determination of medians and averages not possible.
Stochastic Directly-Follows Process Discovery Using Grammatical Inference
We propose a new approach for discovering sound Directly-Follows Graphs that is grounded in grammatical inference over the input traces.
How Much Freedom Does An Effectiveness Metric Really Have?
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 as to the relative order that SERP pairs can be put into.
Efficient Immediate-Access Dynamic Indexing
In a dynamic retrieval system, documents must be ingested as they arrive, and be immediately findable by queries.
Batch Evaluation Metrics in Information Retrieval: Measures, Scales, and Meaning
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 interval scales should be used, and hence that well-known metrics such as reciprocal rank, expected reciprocal rank, normalized discounted cumulative gain, and average precision, should be either discarded as measurement tools, or adapted so that their metric values lie at uniformly-spaced points on the number line.
A Sensitivity Analysis of the MSMARCO Passage Collection
The recent MSMARCO passage retrieval collection has allowed researchers to develop highly tuned retrieval systems.
Bootstrapping Generalization of Process Models Discovered From Event Data
Generalization is also perhaps the least understood of those criteria, with that lack primarily a consequence of it measuring properties over the entire future behavior of the system when the only available sample of behavior is that provided by the log.
Anytime Ranking on Document-Ordered Indexes
Inverted indexes continue to be a mainstay of text search engines, allowing efficient querying of large document collections.
RMITB at TREC COVID 2020
Search engine users rarely express an information need using the same query, and small differences in queries can lead to very different result sets.
Entropia: A Family of Entropy-Based Conformance Checking Measures for Process Mining
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 information theory.
An Entropic Relevance Measure for Stochastic Conformance Checking in Process Mining
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 explanation of the traces.
Boosting Search Performance Using Query Variations
Rank fusion is a powerful technique that allows multiple sources of information to be combined into a single result set.
From Theory to Practice: Plug and Play with Succinct Data Structures
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 optimized, and composable components.
Data Structures and Algorithms
