Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/24204
Title: Towards an Analytical Definition of Sufficient Data
Authors: Byerly, A
Kalganova, T
Keywords: data reduction;dimensional reduction;UMAP;class separation;dataset severability
Issue Date: 7-Jan-2023
Publisher: Springer Nature
Citation: Byerly, A. and Kalganova, T. (2023) 'Towards an Analytical Definition of Sufficient Data', SN Computer Science, 4 (2), 144, pp. 1 - 23. doi: 10.1007/s42979-022-01549-4.
Abstract: Copyright © 2022 The Author(s). We show that, for each of five datasets of increasing complexity, certain training samples are more informative of class membership than others. These samples can be identified a priori to training by analyzing their position in reduced dimensional space relative to the classes' centroids. Specifically, we demonstrate that samples nearer the classes' centroids are less informative than those that are furthest from it. For all five datasets, we show that there is no statistically significant difference between training on the entire training set and when excluding up to 2% of the data nearest to each class's centroid.
Description: The article available on this repository is an uncorrected preprint available at https://doi.org/10.48550/arXiv.2202.03238 . It has not been peer reviewed.
URI: https://bura.brunel.ac.uk/handle/2438/24204
DOI: https://doi.org/10.1007/s42979-022-01549-4
Other Identifiers: arXiv:2202.03238v1
ORCID iDs: Adam Byerly https://orcid.org/0000-0002-9124-5008; Tatiana Kalganova https://orcid.org/0000-0003-4859-7152.
144
Appears in Collections:Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Preprint.pdfarXiv perpetual, non-exclusive license (https://arxiv.org/licenses/nonexclusive-distrib/1.0/): This license gives limited rights to arXiv to distribute the article, and also limits re-use of any type from other entities or individuals. Some authors require a license that is not listed here. As long as the desired license does not restrict arXiv’s license, authors can select the arXiv license and then indicate the desired license in the first page of the article. This is a requirement of some funders and governments. Metadata license: A Creative Commons CC0 1.0 Universal Public Domain Dedication (https://creativecommons.org/publicdomain/zero/1.0/) will apply to all metadata.2.91 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.