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

Amit Mualem

dblp:329/5228 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—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 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 · 67% Recommender systems · 33%

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

TopicWeightPapersLastEvidence papers
Recommender systems
explainable recommendation
0.612022
FEDEX: An Explainability Framework for Data Exploration Steps · Proc. VLDB Endow. 2022
Data mining
exploratory data analysis
0.612022
FEDEX: An Explainability Framework for Data Exploration Steps · Proc. VLDB Endow. 2022
Data mining › pattern mining › association rule mining
interestingness measures
0.612022
FEDEX: An Explainability Framework for Data Exploration Steps · Proc. VLDB Endow. 2022

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

semantic relatedness · 0.6exceptionality measure · 0.6diversity measure · 0.6
YearPublicationVenuePosition
2022 FEDEX: An Explainability Framework for Data Exploration Steps
abstract
When exploring a new dataset, Data Scientists often apply analysis queries, look for insights in the resulting dataframe, and repeat to apply further queries. We propose in this paper a novel solution that assists data scientists in this laborious process. In a nutshell, our solution pinpoints the most interesting (sets of) rows in each obtained dataframe. Uniquely, our definition of interest is based on the contribution of each row to the interestingness of different columns of the entire dataframe, which, in turn, is defined using standard measures such as diversity and exceptionality. Intuitively, interesting rows are ones that explain why (some column of) the analysis query result is interesting as a whole. Rows are correlated in their contribution and so the interesting score for a set of rows may not be directly computed based on that of individual rows. We address the resulting computational challenge by restricting attention to semantically-related sets, based on multiple notions of semantic relatedness; these sets serve as more informative explanations. Our experimental study across multiple real-world datasets shows the usefulness of our system in various scenarios.
Daniel Deutch, Amir Gilad, Tova Milo, Amit Mualem, Amit Somech
Proc. VLDB Endow.4