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

Ron Zadicario

dblp:322/0776 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0001-8968-4848ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Theory of computation · 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%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.912025
Differentially Private Explanations for Clusters · Proc. ACM Manag. Data 2025
Data mining › clustering
interpretable clustering
0.912025
Differentially Private Explanations for Clusters · Proc. ACM Manag. Data 2025
Privacy and data protection
differential privacy
0.912025
Differentially Private Explanations for Clusters · Proc. ACM Manag. Data 2025

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

differential privacy · 1.7
YearPublicationVenuePosition
2025 Differentially Private Explanations for Clusters
abstract
The dire need to protect sensitive data has led to various flavors of privacy definitions. Among these, Differential privacy (DP) is considered one of the most rigorous and secure notions of privacy, enabling data analysis while preserving the privacy of data contributors. One of the fundamental tasks of data analysis is clustering , which is meant to unravel hidden patterns within complex datasets. However, interpreting clustering results poses significant challenges, and often necessitates an extensive analytical process. Interpreting clustering results under DP is even more challenging, as analysts are provided with noisy responses to queries, and longer, manual exploration sessions require additional noise to meet privacy constraints. While increasing attention has been given to clustering explanation frameworks that aim at assisting analysts by automatically uncovering the characteristics of each cluster, such frameworks may also disclose sensitive information within the dataset, leading to a breach in privacy. To address these challenges, we present DPClustX, a framework that provides explanations for black-box clustering results while satisfying DP. DPClustX takes as input the sensitive dataset alongside privately computed clustering labels, and outputs a global explanation, emphasizing prominent characteristics of each cluster while guaranteeing DP. We perform an extensive experimental analysis of DPClustX on real data, showing that it provides insightful and accurate explanations even under tight privacy constraints.
Amir Gilad, Tova Milo, Kathy Razmadze, Ron Zadicario
Proc. ACM Manag. Data4
2024 The Expander Hitting Property When the Sets Are Arbitrarily Unbalanced
Amnon Ta-Shma, Ron Zadicario
APPROX/RANDOM2
2022 System-level crash safe sorting on persistent memory
abstract
Sorting is a fundamental operation in software systems. An example for that is a prepossessing phase before executing analytics operations.
Omri Arad, Yoav Ben Shimon, Ron Zadicario, Daniel G. Waddington, Moshe Hershcovitch, Adam Morrison 0001
SYSTOR3