Fifty Years of Pulsar Candidate Selection: From simple filters to a new principled real-time classification approach
R. J. Lyon, B. W. Stappers, S. Cooper, J. M. Brooke, J. D. Knowles

TL;DR
This paper introduces a real-time machine learning approach for pulsar candidate selection that efficiently handles large data volumes, improves detection accuracy, and is suitable for future large-scale surveys like SKA.
Contribution
It develops a new online classification method using a tree-based machine learning model and novel features, addressing limitations of previous filtering techniques.
Findings
Processed millions of candidates in seconds
Achieved over 90% pulsar recall rate
Discovered 20 new pulsars in survey data
Abstract
Improving survey specifications are causing an exponential rise in pulsar candidate numbers and data volumes. We study the candidate filters used to mitigate these problems during the past fifty years. We find that some existing methods such as applying constraints on the total number of candidates collected per observation, may have detrimental effects on the success of pulsar searches. Those methods immune to such effects are found to be ill-equipped to deal with the problems associated with increasing data volumes and candidate numbers, motivating the development of new approaches. We therefore present a new method designed for on-line operation. It selects promising candidates using a purpose-built tree-based machine learning classifier, the Gaussian Hellinger Very Fast Decision Tree (GH-VFDT), and a new set of features for describing candidates. The features have been chosen so as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
