Unsupervised Classification of Variable Stars
Lucas Valenzuela, Karim Pichara

TL;DR
This paper introduces an unsupervised algorithm for classifying variable stars using light curve similarity, eliminating the need for labeled training data and enabling scalable analysis of large astronomical datasets.
Contribution
It presents a novel query-based unsupervised classification method and a fast similarity function tailored for light curves, addressing the challenge of limited labeled data.
Findings
High accuracy in classifying variable stars
Scales efficiently to large datasets
Operates without labeled training sets
Abstract
During the last ten years, a considerable amount of effort has been made to develop algorithms for automatic classification of variable stars. That has been primarily achieved by applying machine learning methods to photometric datasets where objects are represented as light curves. Classifiers require training sets to learn the underlying patterns that allow the separation among classes. Unfortunately, building training sets is an expensive process that demands a lot of human efforts. Every time data comes from new surveys; the only available training instances are the ones that have a cross-match with previously labelled objects, consequently generating insufficient training sets compared with the large amounts of unlabelled sources. In this work, we present an algorithm that performs unsupervised classification of variable stars, relying only on the similarity among light curves. We…
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.
