Dealing with the data imbalance problem on pulsar candidates sifting based on feature selection

Abstract

Pulsar detection has become an active research topic in radio astronomy recently. One of the essential procedures for pulsar detection is pulsar candidate sifting (PCS), a procedure of finding out the potential pulsar signals in a survey. However, pulsar candidates are always class-imbalanced, as most candidates are non-pulsars such as RFI and only a tiny part of them are from real pulsars. Class imbalance has greatly damaged the performance of machine learning (ML) models, resulting in a heavy cost as some real pulsars are misjudged. To deal with the problem, techniques of choosing relevant features to discriminate pulsars from non-pulsars are focused on, which is known as {\itshape feature selection}. Feature selection is a process of selecting a subset of the most relevant features from a feature pool. The distinguishing features between pulsars and non-pulsars can significantly improve the performance of the classifier even if the data are highly imbalanced.In this work, an algorithm of feature selection called {\itshape K-fold Relief-Greedy} algorithm (KFRG) is designed. KFRG is a two-stage algorithm. In the first stage, it filters out some irrelevant features according to their K-fold Relief scores, while in the second stage, it removes the redundant features and selects the most relevant features by a forward greedy search strategy. Experiments on the dataset of the High Time Resolution Universe survey verified that ML models based on KFRG are capable for PCS, correctly separating pulsars from non-pulsars even if the candidates are highly class-imbalanced.

arXiv comment20 pages, 5 figures, 7 tables

References in corpus (20)

• SMOTE: Synthetic Minority Over-sampling Technique
• LOFAR: The LOw-Frequency ARray
• The Five-Hundred-Meter Aperture Spherical Radio Telescope (FAST) Project
• The Parkes Multibeam Pulsar Survey: I. Observing and Data Analysis Systems, Discovery and Timing of 100 Pulsars
• The High Time Resolution Universe Pulsar Survey I: System configuration and initial discoveries
• Fifty Years of Pulsar Candidate Selection: From simple filters to a new principled real-time classification approach
• Pulsar searches and timing with the SKA
• Searching for pulsars using image pattern recognition
• Selection of radio pulsar candidates using artificial neural networks
• The spatial energy spectrum of magnetic fields in our Galaxy
• SPINN: a straightforward machine learning solution to the pulsar candidate selection problem
• The High Time Resolution Universe Survey VI: An Artificial Neural Network and Timing of 75 Pulsars
• The High Time Resolution Universe Pulsar Survey VIII: The Galactic millisecond pulsar population
• Separation of pulsar signals from noise with supervised machine learning algorithms
• Photometric classification of type Ia supernovae in the SuperNova Legacy Survey with supervised learning
• Prospects for Detecting Dark Matter Halo Substructure with Pulsar Timing
• Detection of Dispersed Radio Pulses: A machine learning approach to candidate identification and classification
• Concat Convolutional Neural Network for Pulsar Candidate Selection
• Pulsar Candidate Sifting Using Multi-input Convolution Neural Networks
• Hellinger Distance Trees for Imbalanced Streams