CoPASample: A Heuristics Based Covariance Preserving Data Augmentation

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An efficient data augmentation algorithm generates samples that improves accuracy and robustness of training models. Augmentation with informative samples imparts meaning to the augmented data set. In this paper, we propose CoPASample (Covariance Preserving Algorithm for generating Samples), a data augmentation algorithm that generates samples which reflects the first and second order statistical information of the data set, thereby augmenting the data set in a manner that preserves the total covariance of the data. To address the issue of exponential computations in the generation of points for augmentation, we formulate an optimisation problem motivated by the approach used in (formula presented)-SVR to iteratively compute a heuristics based optimal set of points for augmentation in polynomial time. Experimental results for several data sets and comparisons with other data augmentation algorithms validate the potential of our proposed algorithm.

Cite

CITATION STYLE

APA

Agrawal, R., & Kothari, P. (2019). CoPASample: A Heuristics Based Covariance Preserving Data Augmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11943 LNCS, pp. 308–320). Springer. https://doi.org/10.1007/978-3-030-37599-7_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free