Automatic Classification of Kepler Planetary Transit Candidates
Sean D. McCauliff, Jon M. Jenkins, Joseph Catanzarite, Christopher J., Burke, Jeffrey L. Coughlin, Joseph D. Twicken, Peter Tenenbaum, Shawn Seader,, Jie Li, Miles Cote

TL;DR
This paper introduces a machine learning approach using random forests to classify Kepler transit signals, significantly reducing manual effort and providing candidate quality assessment.
Contribution
It applies random forest algorithms to classify exoplanet candidates, false positives, and noise, achieving high accuracy and marking the first use of this method in exoplanet classification.
Findings
Overall error rate of 5.85%
Exoplanet candidate classification error of 2.81%
Effective automated classification of Kepler signals
Abstract
In the first three years of operation the Kepler mission found 3,697 planet candidates from a set of 18,406 transit-like features detected on over 200,000 distinct stars. Vetting candidate signals manually by inspecting light curves and other diagnostic information is a labor intensive effort. Additionally, this classification methodology does not yield any information about the quality of planet candidates; all candidates are as credible as any other candidate. The torrent of exoplanet discoveries will continue after Kepler as there will be a number of exoplanet surveys that have an even broader search area. This paper presents the application of machine-learning techniques to the classification of exoplanet transit-like signals present in the \Kepler light curve data. Transit-like detections are transformed into a uniform set of real-numbered attributes, the most important of which…
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.
