This paper presents a comparison of popular period finding algorithms applied to the light curves of variable stars from the Catalina Real-Time Transient Survey, MACHO and ASAS data sets. We analyse the accuracy of the methods against magnitude, sampling rates, quoted period, quality measures (signal-to-noise and number of observations), variability and object classes. We find that measure of dispersion-based techniques – analysis of variance with harmonics and conditional entropy – consistently give the best results but there are clear dependences on object class and light-curve quality. Period aliasing and identifying a period harmonic also remain significant issues. We consider the performance of the algorithms and show that a new conditional entropy-based algorithm is the most optimal in terms of completeness and speed. We also consider a simple ensemble approach and find that it performs no better than individual algorithms.
A comparison of period finding algorithms
M. Graham,A. Drake,S. Djorgovski,A. Mahabal,C. Donalek,V. Duan,A. Maher
Published 2013 in Monthly Notices of the Royal Astronomical Society
ABSTRACT
PUBLICATION RECORD
- Publication year
2013
- Venue
Monthly Notices of the Royal Astronomical Society
- Publication date
2013-07-08
- Fields of study
Physics
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-61 of 61 references · Page 1 of 1
CITED BY
Showing 1-84 of 84 citing papers · Page 1 of 1