Class Density and Dataset Quality in High-Dimensional, Unstructured Data
Not on the map. Why?
Abstract (arXiv)
We provide a definition for class density that can be used to measure the aggregate similarity of the samples within each of the classes in a high-dimensional, unstructured dataset. We then put forth several candidate methods for calculating class density and analyze the correlation between the values each method produces with the corresponding individual class test accuracies achieved on a trained model. Additionally, we propose a definition for dataset quality for high-dimensional, unstructured data and show that those datasets that met a certain quality threshold (experimentally demonstrated to be > 10 for the datasets studied) were candidates for eliding redundant data based on the individual class densities.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 24 references that are in the map. First posted on arXiv 8 Feb 2022.
Builds on
7 of 24 references.
References · 7
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
- 2017EMNIST: an extension of MNIST to handwritten letterscited by 212
- 2020No Routing Needed Between Capsulescited by 27
- 2019Homogeneous Vector Capsules Enable Adaptive Gradient Descent in Convolutional Neural Networkscited by 4
- 2022Towards an Analytical Definition of Sufficient Datacited by 3
- 2021On the Importance of Capturing a Sufficient Diversity of Perspective for the Classification of micro-PCBscited by 2
Built on by
Citing papers per year: 2023: 1.
1 paper.