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

Daniel Andrés Díaz-Pachón

dblp:278/2848 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0001-6281-1720ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 since 2021Theory of computation · 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.

Theoretical computer science
2 papers
Algorithms and data structures · 46% Mathematical optimization · 27% Information theory · 27%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › statistical inference
missing data
0.812024
An Information Theoretic Approach to Prevalence Estimation and Missing Data · IEEE Trans. Inf. Theory 2024
Mathematical optimization
statistical estimation
0.812024
An Information Theoretic Approach to Prevalence Estimation and Missing Data · IEEE Trans. Inf. Theory 2024
Data mining
pattern mining
0.712023
High Dimensional Mode Hunting Using Pettiest Components Analysis · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Algorithms and data structures › numerical linear algebra
dimensionality reduction
0.712023
High Dimensional Mode Hunting Using Pettiest Components Analysis · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Algorithms and data structures › numerical linear algebra › dimensionality reduction
principal component analysis
0.712023
High Dimensional Mode Hunting Using Pettiest Components Analysis · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Computational social science and digital humanities
survey methodology
0.212024
An Information Theoretic Approach to Prevalence Estimation and Missing Data · IEEE Trans. Inf. Theory 2024

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

active information · 2.8regression model · 1.5asymptotic normality · 1.5pettiest component analysis · 1.3
YearPublicationVenuePosition
2024 An Information Theoretic Approach to Prevalence Estimation and Missing Data
abstract
Many data sources, including tracking social behavior to election polling to testing studies for understanding disease spread, are subject to sampling bias whose implications are not fully yet understood. In this paper we study estimation of a given feature (such as disease, or behavior at social media platforms) from biased samples, treating non-respondent individuals as missing data. Prevalence of the feature among sampled individuals has an upward bias under the assumption of individuals’ willingness to be sampled. This can be viewed as a regression model with symptoms as covariates and the feature as outcome. It is assumed that the outcome is unknown at the time of sampling, and therefore the missingness mechanism only depends on the covariates. We show that data, in spite of this, is missing at random only when the sizes of symptom classes in the population are known; otherwise data is missing not at random. With an information theoretic viewpoint, we show that sampling bias corresponds to external information due to individuals in the population knowing their covariates, and we quantify this external information by active information. The reduction in prevalence, when sampling bias is adjusted for, similarly translates into active information due to bias correction, with opposite sign to active information due to testing bias. We develop unified results that show that prevalence and active information estimates are asymptotically normal under all missing data mechanisms, when testing errors are absent and present respectively. The asymptotic behavior of the estimators is illustrated through simulations.
Ola Hössjer, Daniel Andrés Díaz-Pachón, Chen Zhao 0012, J. Sunil Rao
IEEE Trans. Inf. Theory2
2023 High Dimensional Mode Hunting Using Pettiest Components Analysis
abstract
Principal components analysis has been used to reduce the dimensionality of datasets for a long time. In this paper, we will demonstrate that in mode detection the components of smallest variance, the pettiest components, are more important. We prove that for a multivariate normal or Laplace distribution, we obtain boxes of optimal volume by implementing "pettiest component analysis," in the sense that their volume is minimal over all possible boxes with the same number of dimensions and fixed probability. This reduction in volume produces an information gain that is measured using active information. We illustrate our results with a simulation and a search for modal patterns of digitized images of hand-written numbers using the famous MNIST database; in both cases pettiest components work better than their competitors. In fact, we show that modes obtained with pettiest components generate better written digits for MNIST than principal components.
Daniel Andrés Díaz-Pachón, J. Sunil Rao, Jean-Eudes J. Dazard
IEEE Trans. Pattern Anal. Mach. Intell.2