2019
DOI: 10.3847/1538-3881/ab26ba
|View full text |Cite
|
Sign up to set email alerts
|

Autoregressive Planet Search: Application to the Kepler Mission

Abstract: The 4 yr light curves of 156,717 stars observed with NASA’s Kepler mission are analyzed using the autoregressive planet search (ARPS) methodology described by Caceres et al. The three stages of processing are maximum-likelihood ARIMA modeling of the light curves to reduce stellar brightness variations, constructing the transit comb filter periodogram to identify transit-like periodic dips in the ARIMA residuals, and Random Forest classification trained on Kepler team confirmed planets using several dozen featu… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
46
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(47 citation statements)
references
References 87 publications
1
46
0
Order By: Relevance
“…With the advent of large datasets such work is increasingly common, and classifiers have been built for Kepler (Armstrong et al 2018;Chaushev et al 2019), and WASP (Schanche et al 2018). For the Kepler dataset, Caceres et al (2019) built a random forest model to find good candidates among the results from their 'autoregressive planet search' algorithm, achieving an AUC of 0.997 in classifying planet candidates against false positives. Shallue & Vanderburg (2018) used a convolutional neural net for a similar purpose, achieving an AUC of 0.988 and again aiming to separate candidates from false positives using a different planet search method.…”
Section: Comparison To Other Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…With the advent of large datasets such work is increasingly common, and classifiers have been built for Kepler (Armstrong et al 2018;Chaushev et al 2019), and WASP (Schanche et al 2018). For the Kepler dataset, Caceres et al (2019) built a random forest model to find good candidates among the results from their 'autoregressive planet search' algorithm, achieving an AUC of 0.997 in classifying planet candidates against false positives. Shallue & Vanderburg (2018) used a convolutional neural net for a similar purpose, achieving an AUC of 0.988 and again aiming to separate candidates from false positives using a different planet search method.…”
Section: Comparison To Other Methodsmentioning
confidence: 99%
“…Past efforts to classify candidates in transit surveys with machine learning have been made, using primarily random forests (McCauliff et al 2015;Armstrong et al 2018;Schanche et al 2018;Caceres et al 2019) and convolutional neural nets (Shallue & Vanderburg 2018;Ansdell et al 2018;Dattilo et al 2019;Chaushev et al 2019;Yu et al 2019;Osborn et al 2019). To date these have all focused on identifying FPs or ranking candidates within a survey.…”
Section: Introductionmentioning
confidence: 99%
“…As a result, we do not try to explore all of the parameter space to find the best fitting model to the observed light curve. Further we do not extract the exact periodicities from the data but leave that to future work (see for example Feigelson et al 2018;Caceres et al 2019). Instead, in this Section we simply consider a test case of a hydrodynamical Be star disc simulation to show the principle that non-periodic outbursts are possible in a misaligned viscous disc model.…”
Section: Hydrodynamic Simulationsmentioning
confidence: 99%
“…So far, independent Kepler searches have focused on only a subset of light-curves (e.g., Kunimoto et al 2018;Shallue & Vanderburg 2018) or a more limited range of orbital periods than examined by the Kepler team (e.g., Wang et al 2015;Caceres et al 2019). In this paper, we present an independent systematic search of the entirety of Kepler data (∼ 200, 000 stars) for planets, using the same three-transit minimum detection criteria as the Kepler team.…”
Section: Paper Outlinementioning
confidence: 99%