Demo Data from VLDB 2026 / reviewers in the wild / expert
Brandon Lockhart
dblp:285/4664
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 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
2 papers |
Data mining · 30% Data integration and cleaning · 30% Query processing and optimization · 30% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data integration and cleaning
data preprocessing |
0.5 | 1 | 2021 | DataPrep.EDA: Task-Centric Exploratory Data Analysis for Statistical Modeling in Python · SIGMOD Conference 2021 |
Data mining
exploratory data analysis |
0.5 | 1 | 2021 | DataPrep.EDA: Task-Centric Exploratory Data Analysis for Statistical Modeling in Python · SIGMOD Conference 2021 |
Query processing and optimization
query result explanation |
0.5 | 1 | 2021 | Explaining Inference Queries with Bayesian Optimization · Proc. VLDB Endow. 2021 |
Machine learning and data management
machine learning pipeline |
0.1 | 1 | 2021 | Explaining Inference Queries with Bayesian Optimization · Proc. VLDB Endow. 2021 |
Methods — techniques the papers use, named apart from their topics
warm-start · 0.5individual contribution encoding · 0.5black-box optimization · 0.5bayesian optimization · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | DataPrep.EDA: Task-Centric Exploratory Data Analysis for Statistical Modeling in PythonabstractExploratory Data Analysis (EDA) is a crucial step in any data science project. However, existing Python libraries fall short in supporting data scientists to complete common EDA tasks for statistical modeling. Their API design is either too low level, which is optimized for plotting rather than EDA, or too high level, which is hard to specify more fine-grained EDA tasks. In response, we propose DataPrep.EDA, a novel task-centric EDA system in Python. DataPrep.EDA allows data scientists to declaratively specify a wide range of EDA tasks in different granularity with a single function call. We identify a number of challenges to implement DataPrep.EDA, and propose effective solutions to improve the scalability, usability, customizability of the system. In particular, we discuss some lessons learned from using Dask to build the data processing pipelines for EDA tasks and describe our approaches to accelerate the pipelines. We conduct extensive experiments to compare DataPrep.EDA with Pandas-profiling, the state-of-the-art EDA system in Python. The experiments show that DataPrep.EDA significantly outperforms Pandas-profiling in terms of both speed and user experience. DataPrep.EDA is open-sourced as an EDA component of DataPrep: https://github.com/sfu-db/dataprep. Jinglin Peng, Weiyuan Wu, Brandon Lockhart, Song Bian 0002, Jing Nathan Yan, Linghao Xu, Zhixuan Chi, Jeffrey M. Rzeszotarski, Jiannan Wang 0001 |
SIGMOD Conference | 3 |
| 2021 | Explaining Inference Queries with Bayesian OptimizationabstractObtaining an explanation for an SQL query result can enrich the analysis experience, reveal data errors, and provide deeper insight into the data. Inference query explanation seeks to explain unexpected aggregate query results on inference data; such queries are challenging to explain because an explanation may need to be derived from the source, training, or inference data in an ML pipeline. In this paper, we model an objective function as a black-box function and propose BOExplain, a novel framework for explaining inference queries using Bayesian optimization (BO). An explanation is a predicate defining the input tuples that should be removed so that the query result of interest is significantly affected. BO --- a technique for finding the global optimum of a black-box function --- is used to find the best predicate. We develop two new techniques (individual contribution encoding and warm start) to handle categorical variables. We perform experiments showing that the predicates found by BOExplain have a higher degree of explanation compared to those found by the state-of-the-art query explanation engines. We also show that BOExplain is effective at deriving explanations for inference queries from source and training data on a variety of real-world datasets. BOExplain is open-sourced as a Python package at https://github.com/sfu-db/BOExplain. Brandon Lockhart, Jinglin Peng, Weiyuan Wu, Jiannan Wang 0001, Eugene Wu 0002 |
Proc. VLDB Endow. | 1 |