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.

Arjun Kashettiwar

dblp:336/2748 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Query processing and optimization · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
approximate query processing
0.712023
Reinforced Approximate Exploratory Data Analysis · AAAI 2023
Query processing and optimization
interactive data exploration
0.712023
Reinforced Approximate Exploratory Data Analysis · AAAI 2023
Query processing and optimization › approximate query processing
sampling-based approximate query processing
0.712023
Reinforced Approximate Exploratory Data Analysis · AAAI 2023

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

deep reinforcement learning · 0.7
YearPublicationVenuePosition
2023 Reinforced Approximate Exploratory Data Analysis
abstract
Exploratory data analytics (EDA) is a sequential decision making process where analysts choose subsequent queries that might lead to some interesting insights based on the previous queries and corresponding results. Data processing systems often execute the queries on samples to produce results with low latency. Different downsampling strategy preserves different statistics of the data and have different magnitude of latency reductions. The optimum choice of sampling strategy often depends on the particular context of the analysis flow and the hidden intent of the analyst. In this paper, we are the first to consider the impact of sampling in interactive data exploration settings as they introduce approximation errors. We propose a Deep Reinforcement Learning (DRL) based framework which can optimize the sample selection in order to keep the analysis and insight generation flow intact. Evaluations with real datasets show that our technique can preserve the original insight generation flow while improving the interaction latency, compared to baseline methods.
Shaddy Garg, Subrata Mitra, Tong Yu 0001, Yash Gadhia, Arjun Kashettiwar
AAAI5