Support Vector Machines and Kd-tree for Separating Quasars from Large Survey Databases
Gao Dan, Zhang Yanxia, Zhao Yongheng

TL;DR
This study compares kd-tree and support vector machines for classifying quasars and stars in large astronomical survey databases, evaluating their accuracy and efficiency using photometric data.
Contribution
It demonstrates that both algorithms are effective for automated classification, with SVMs slightly more accurate and kd-tree faster, optimizing quasar candidate selection.
Findings
SVMs have marginally higher accuracy than kd-tree.
Both algorithms perform better with fewer features.
Using four color parameters yields the highest classification accuracy.
Abstract
We compare the performance of two automated classification algorithms: k-dimensional tree (kd-tree) and support vector machines (SVMs), to separate quasars from stars in the databases of the Sloan Digital Sky Survey (SDSS) and the Two Micron All Sky Survey (2MASS) catalogs. The two algorithms are trained on subsets of SDSS and 2MASS objects whose nature is known via spectroscopy. We choose different attribute combination as input patterns to train the classifier using photometric data only and present the classification results obtained by these two methods. Performance metrics such as precision and recall, true positive rate and true negative rate, F-measure, G-mean and Weighted Accuracy are computed to evaluate the performance of the two algorithms. The study shows that both kd-tree and SVMs are effective automated algorithms to classify point sources. SVMs show slightly higher…
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.
Taxonomy
TopicsImpact of Light on Environment and Health · Advanced Statistical Methods and Models · Remote Sensing in Agriculture
