3.8 Proceedings Paper

Detection of Pulsar Candidates using Bagging Method

出版社

ELSEVIER SCIENCE BV
DOI: 10.1016/j.procs.2020.03.062

关键词

Bagging; CVM; ANN; KNN; CDT; AUC; Error Rate; Computation Time(CT)

向作者/读者索取更多资源

The pulsar classification represents a major issue in the astrophysical area. The Bagging Algorithm is an ensemble method widely used to improve the performance of classification algorithms, especially in the case of pulsar search. In this way, our paper tries to prove how the Bagging Method can improve the performance of pulsar candidate detection in connection with four basic classifiers: Core Vector Machines (CVM), the K-Nearest-Neighbors (KNN), the Artificial Neural Network (ANN), and Cart Decision Tree (CDT). The Error Rate, Area Under the Curve (AUC), and Computation Time (CT) are measured to compare the performance of different classifiers. The High Time Resolution Universe (HTRU2) dataset, collected from the UCI Machine Learning Repository, is used in the experimentation phase. (C) 2020 The Authors. Published by Elsevier B.V.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据