mlsanityData to 7 Oct 2026

Imbalance Learning for Variable Star Classification

arXiv 2002.12386 ↗First posted 27 Feb 2020astro-ph.IM cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

The accurate automated classification of variable stars into their respective sub-types is difficult. Machine learning based solutions often fall foul of the imbalanced learning problem, which causes poor generalisation performance in practice, especially on rare variable star sub-types. In previous work, we attempted to overcome such deficiencies via the development of a hierarchical machine learning classifier. This 'algorithm-level' approach to tackling imbalance, yielded promising results on Catalina Real-Time Survey (CRTS) data, outperforming the binary and multi-class classification schemes previously applied in this area. In this work, we attempt to further improve hierarchical classification performance by applying 'data-level' approaches to directly augment the training data so that they better describe under-represented classes. We apply and report results for three data augmentation methods in particular: textitRandomly textitAugmented textitSampled textitLight curves from magnitude textitError (textttRASLE), augmenting light curves with Gaussian Process modelling (textttGpFit) and the Synthetic Minority Over-sampling Technique (textttSMOTE). When combining the 'algorithm-level' (i.e. the hierarchical scheme) together with the 'data-level' approach, we further improve variable star classification accuracy by 1-4%. We found that a higher classification rate is obtained when using textttGpFit in the hierarchical model. Further improvement of the metric scores requires a better standard set of correctly identified variable stars and, perhaps enhanced features are needed.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 1; 2025: 0; 2026: 1.

7 papers.