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

Massimo Perini

dblp:246/0524 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0001-5006-9979ORCID · reported

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 integration and cleaning · 44% Machine learning and data management · 44% Query processing and optimization · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning and data management
in-database machine learning
0.812024
In-Database Data Imputation · Proc. ACM Manag. Data 2024
Data integration and cleaning › missing data
missing value imputation
0.812024
In-Database Data Imputation · Proc. ACM Manag. Data 2024
Query processing and optimization
shared computation
0.212024
In-Database Data Imputation · Proc. ACM Manag. Data 2024

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

stochastic linear regression · 0.8gaussian discriminant analysis · 0.8MICE · 0.8
YearPublicationVenuePosition
2024 In-Database Data Imputation
abstract
Missing data is a widespread problem in many domains, creating challenges in data analysis and decision making. Traditional techniques for dealing with missing data, such as excluding incomplete records or imputing simple estimates (e.g., mean), are computationally efficient but may introduce bias and disrupt variable relationships, leading to inaccurate analyses. Model-based imputation techniques offer a more robust solution that preserves the variability and relationships in the data, but they demand significantly more computation time, limiting their applicability to small datasets. This work enables efficient, high-quality, and scalable data imputation within a database system using the widely used MICE method. We adapt this method to exploit computation sharing and a ring abstraction for faster model training. To impute both continuous and categorical values, we develop techniques for in-database learning of stochastic linear regression and Gaussian discriminant analysis models. Our MICE implementations in PostgreSQL and DuckDB outperform alternative MICE implementations and model-based imputation techniques by up to two orders of magnitude in terms of computation time, while maintaining high imputation quality.
Massimo Perini, Milos Nikolic 0001
Proc. ACM Manag. Data1