STATISTICAL ANALYSIS ON COMPLEXLY STRUCTURED DATA

Modern data are characterised by their large volume and messy features. Traditional statistical methods, while theoretically valid, are frequently computationally intractable for large and incomplete data sets. Statisticians will often manipulate data set so as to reduce its size and restore its rectangular structure through artificial data imputation. Elementary statistical methods cannot provide valid inference of the newly constructed complex data. We address inference over these complexly formed data sets in two sections; performing inference over aggregated data, and estimating parameters from imputed data. In the first section we discuss inference on complexly aggregated data using results in Symbolic Data Analysis. The discussion opens by examining the aggregation of data sets into so called symbols, and subsequently showing the convergence of these symbols. Our examination also introduces distribution-valued symbols which provide a granular form of the existing coarse symbolic variables. Our analysis then turns to model-based inference with symbolic data. This section opens with an application to network traffic using interval-valued symbols of unidirectional data. We provide consistency in estimation, bounds on information loss under aggregation, and identify models that are sufficiency invariant under aggregation. The consistency results are extended to a generic setting when considering inference with respect to a single or multiple symbols. In the second part, we address a missing data problem through the lens of ordinary least squares. Large data sets often contain missing elements, due to pragmatic sampling choices or incomplete collection methods. We synthetically construct the pseudocensus of the population through the common semiparametric weighted K-nearest neighbours algorithm. The resulting OLS estimator is shown to be biased and we subsequently provide two methods of bias correction using the internal weights of the imputation algorithm and a bias-correction coefficient. The estimator is also shown to be consistent. These results are validated in some simulated analyses.

Authors

Institutions

Publication Details

Journal
Bulletin of the Australian Mathematical Society
Published
2024-11-25
DOI
https://doi.org/10.1017/s0004972724001060
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

STATISTICAL ANALYSIS ON COMPLEXLY STRUCTURED DATA

Prosha A. Rahman
Bulletin of the Australian Mathematical Society
Neural Networks and Applications
article

STATISTICAL ANALYSIS ON COMPLEXLY STRUCTURED DATA

Prosha A. Rahman
article en

Abstract

Modern data are characterised by their large volume and messy features. Traditional statistical methods, while theoretically valid, are frequently computationally intractable for large and incomplete data sets. Statisticians will often manipulate data set so as to reduce its size and restore its rectangular structure through artificial data imputation. Elementary statistical methods cannot provide valid inference of the newly constructed complex data. We address inference over these complexly formed data sets in two sections; performing inference over aggregated data, and estimating parameters from imputed data. In the first section we discuss inference on complexly aggregated data using results in Symbolic Data Analysis. The discussion opens by examining the aggregation of data sets into so called symbols, and subsequently showing the convergence of these symbols. Our examination also introduces distribution-valued symbols which provide a granular form of the existing coarse symbolic variables. Our analysis then turns to model-based inference with symbolic data. This section opens with an application to network traffic using interval-valued symbols of unidirectional data. We provide consistency in estimation, bounds on information loss under aggregation, and identify models that are sufficiency invariant under aggregation. The consistency results are extended to a generic setting when considering inference with respect to a single or multiple symbols. In the second part, we address a missing data problem through the lens of ordinary least squares. Large data sets often contain missing elements, due to pragmatic sampling choices or incomplete collection methods. We synthetically construct the pseudocensus of the population through the common semiparametric weighted K-nearest neighbours algorithm. The resulting OLS estimator is shown to be biased and we subsequently provide two methods of bias correction using the internal weights of the imputation algorithm and a bias-correction coefficient. The estimator is also shown to be consistent. These results are validated in some simulated analyses.

Bulletin of the Australian Mathematical SocietyVol. 111(1)
UNSW Sydney (AU)
Openalex Percentile: Top 81%
Neural Networks and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

STATISTICAL ANALYSIS ON COMPLEXLY STRUCTURED DATA — Prosha A. Rahman · Bulletin of the Australian Mathematical Society (2024) | TGRS Research Map | TGRS