Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T17:03:23.707Z Has data issue: false hasContentIssue false

Searching for Pulsating Stars Using Clustering Algorithms

Published online by Cambridge University Press:  29 August 2019

R. Kgoadi
Affiliation:
College of Science and Engineering, James Cook University, Townsville, Australia email: refilwe.kgoadi1@my.jcu.edu.au
I. Whittingham
Affiliation:
College of Science and Engineering, James Cook University, Townsville, Australia email: refilwe.kgoadi1@my.jcu.edu.au
C. Engelbrecht
Affiliation:
Physics Department, Faculty of Science, University of Johannesburg, South Africa
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Clustering algorithms constitute a multi-disciplinary analytical tool commonly used to summarise large data sets. Astronomical classifications are based on similarity, where celestial objects are assigned to a specific class according to specific physical features. The aim of this project is to obtain relevant information from high-dimensional data (at least three input variables in a data-frame) derived from stellar light-curves using a number of clustering algorithms such as K-means and Expectation Maximisation. In addition to identifying the best performing algorithm, we also identify a subset of features that best define stellar groups. Three methodologies are applied to a sample of Kepler time series in the temperature range 6500–19,000 K. In that spectral range, at least four classes of variable stars are expected to be found: δ Scuti, γ Doradus, Slowly Pulsating B (SPB), and (the still equivocal) Maia stars.

Supplementary material: PDF

Kgoadi et al. supplementary material

Kgoadi et al. supplementary material

Download Kgoadi et al. supplementary material(PDF)
PDF 835 KB