Scalable and space-efficient Robust Matroid Center algorithms

M Ceccarello, A Pietracaprina, G Pucci, F Soldà - Journal of Big Data, 2023 - Springer
Given a dataset V of points from some metric space, a popular robust formulation of the k-
center clustering problem requires to select k points (centers) of V which minimize the …

Implementing distributed similarity joins using locality sensitive hashing

M Aumüller, M Ceccarello - … of the 25th International Conference on …, 2022 - bia.unibz.it
Similarity joins are a basic primitive in data mining. Given two sets of points, we are
interested in reporting all pairs of points whose similarity is above a user-defined threshold …

Indexing Temporal Relations for Range-Duration Queries

M Ceccarello, A Dignös, J Gamper… - Proceedings of the 35th …, 2023 - dl.acm.org
Temporal information plays a crucial role in many database applications, however support
for queries on such data is limited. We present an index structure, termed RD-index, to …

Indexing temporal relations for range-duration queries

M Ceccarello, A Dignös, J Gamper… - Distributed and Parallel …, 2025 - Springer
Temporal information plays a crucial role in many database applications, however support
for queries on such data is limited. We present an index structure, termed rd-index, to …

[PDF][PDF] Implementing Distributed Approximate Similarity Joins using Locality Sensitive Hashing

M Aumüller, M Ceccarello - EDBT: International Conference …, 2022 - openproceedings.org
Similarity joins are a basic primitive in data mining. Given two sets of points, we are
interested in reporting all pairs of points whose similarity is above a user-defined threshold …

Empirical Characterization of the Fuzzy ARTMAP Algorithm for E-Discovery: Towards Explainable Technology-Assisted Review

CP Courchaine - 2022 - search.proquest.com
Technology-assisted review systems in e-discovery are typically considered “black boxes,”
providing no insight into how predictions are made, making it difficult for attorneys to trust the …