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

Sariel Ofek

dblp:395/6836 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 first-author · 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%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.912025
Explaining Black-Box Clustering Pipelines With Cluster-Explorer · Proc. VLDB Endow. 2025
Data mining › pattern mining › itemset mining
frequent itemset mining
0.912025
Explaining Black-Box Clustering Pipelines With Cluster-Explorer · Proc. VLDB Endow. 2025
Data mining › clustering
interpretable clustering
0.912025
Explaining Black-Box Clustering Pipelines With Cluster-Explorer · Proc. VLDB Endow. 2025
Data mining
pattern mining
0.912025
Explaining Black-Box Clustering Pipelines With Cluster-Explorer · Proc. VLDB Endow. 2025

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

generalized frequent-itemset mining · 0.9
YearPublicationVenuePosition
2025 Explaining Black-Box Clustering Pipelines With Cluster-Explorer
abstract
Explaining the results of clustering pipelines by unraveling the characteristics of each cluster is a challenging task, often addressed manually through visualizations and queries. Existing solutions from the domain of Explainable Artificial Intelligence (XAI) are largely ineffective for cluster explanations, and interpretable-by-design clustering algorithms may be unsuitable when the clustering algorithm does not fit the data properties. To bridge this gap, we introduce Cluster-Explorer, a novel explainability tool for black-box clustering pipelines. Our approach formulates the explanation of clusters as the identification of concise conjunctions of predicates that maximize the coverage of the cluster's data points while minimizing separation from other clusters. We achieve this by reducing the problem to generalized frequent-itemsets mining (gFIM), where items correspond to explanation predicates, and itemset frequency indicates coverage. To enhance efficiency, we leverage inherent problem properties and implement attribute selection to further reduce computational costs. Experimental evaluations on a benchmark collection of 98 clustering results demonstrate the superiority of Cluster-Explorer in both explanation quality and execution times compared to XAI baselines.
Sariel Ofek, Amit Somech
Proc. VLDB Endow.1