Analyzing the Fine Structure of Distributions
Not on the map. Why?
Abstract (arXiv)
One aim of data mining is the identification of interesting structures in data. For better analytical results, the basic properties of an empirical distribution, such as skewness and eventual clipping, i.e. hard limits in value ranges, need to be assessed. Of particular interest is the question of whether the data originate from one process or contain subsets related to different states of the data producing process. Data visualization tools should deliver a clear picture of the univariate probability density distribution (PDF) for each feature. Visualization tools for PDFs typically use kernel density estimates and include both the classical histogram, as well as the modern tools like ridgeline plots, bean plots and violin plots. If density estimation parameters remain in a default setting, conventional methods pose several problems when visualizing the PDF of uniform, multimodal, skewed distributions and distributions with clipped data, For that reason, a new visualization tool called the mirrored density plot (MD plot), which is specifically designed to discover interesting structures in continuous features, is proposed. The MD plot does not require adjusting any parameters of density estimation, which is what may make the use of this plot compelling particularly to non-experts. The visualization tools in question are evaluated against statistical tests with regard to typical challenges of explorative distribution analysis. The results of the evaluation are presented using bimodal Gaussian, skewed distributions and several features with already published PDFs. In an exploratory data analysis of 12 features describing quarterly financial statements, when statistical testing poses a great difficulty, only the MD plots can identify the structure of their PDFs. In sum, the MD plot outperforms the above mentioned methods.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Aug 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
4 papers.
- 2026Where Do AI Coding Agents Fail? An Empirical Study of Failed Agentic Pull Requests in GitHubcited by 10
- 2021Swarm Intelligence for Self-Organized Clusteringcited by 1
- 2021The Exploitation of Distance Distributions for Clusteringcited by 1
- 2025SSRCA: a novel machine learning pipeline to perform sensitivity analysis for agent-based modelscited by 0
- 2026Where Do AI Coding Agents Fail? An Empirical Study of Failed Agentic Pull Requests in GitHub21 Jan 2026
- 2025SSRCA: a novel machine learning pipeline to perform sensitivity analysis for agent-based models30 May 2025
- 2021The Exploitation of Distance Distributions for Clustering22 Aug 2021
- 2021Swarm Intelligence for Self-Organized Clustering10 Jun 2021