Comparison of Multi-class and Binary Classification Machine Learning Models in Identifying Strong Gravitational Lenses

被引:11
|
作者
Teimoorinia, Hossen [1 ,2 ]
Toyonaga, Robert D. [1 ,3 ]
Fabbro, Sebastien [1 ,2 ]
Bottrell, Connor [2 ]
机构
[1] NRC Herzberg Astron & Astrophys, 5071 West Saanich Rd, Victoria, BC V9E 2E7, Canada
[2] Univ Victoria, Dept Phys & Astron, Victoria, BC V8P 5C2, Canada
[3] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
cosmology; observations; gravitational lensing; strong; methods; data analysis; numerical; observational; techniques; image processing;
D O I
10.1088/1538-3873/ab747b
中图分类号
P1 [天文学];
学科分类号
0704 ;
摘要
Typically, binary classification lens-finding schemes are used to discriminate between lens candidates and non-lenses. However, these models often suffer from substantial false-positive classifications. Such false positives frequently occur due to images containing objects such as crowded sources, galaxies with arms, and also images with a central source and smaller surrounding sources. Therefore, a model might confuse the stated circumstances with an Einstein ring. It has been proposed that by allowing such commonly misclassified image types to constitute their own classes, machine learning models will more easily be able to learn the difference between images that contain real lenses, and images that contain lens imposters. Using Hubble Space Telescope images, in the F814W filter, we compare the usage of binary and multi-class classification models applied to the lens finding task. From our findings, we conclude there is not a significant benefit to using the multi-class model over a binary model. We will also present the results of a simple lens search using a multi-class machine learning model, and potential new lens candidates.
引用
收藏
页数:11
相关论文
共 50 条
  • [21] Enhancing directed binary trees for multi-class classification
    Montanes, Elena
    Barranquero, Jose
    Diez, Jorge
    Jose del Coz, Juan
    INFORMATION SCIENCES, 2013, 223 : 42 - 55
  • [22] Malicious Software Family Classification using Machine Learning Multi-class Classifiers
    San, Cho Cho
    Thwin, Mie Mie Su
    Htun, Naing Linn
    COMPUTATIONAL SCIENCE AND TECHNOLOGY, 2019, 481 : 423 - 433
  • [23] Multi-Class Electrogastrogram (EGG) Signal Classification Using Machine Learning Algorithms
    Raihan, Md Mohsin Sarker
    Bin Shams, Abdullah
    Bin Preo, Rahat
    2020 23RD INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (ICCIT 2020), 2020,
  • [24] Bearing Fault Classification Using Multi-Class Machine Learning (ML) Techniques
    Sujatha, C.
    Mohan, Aravind
    EAI ENDORSED TRANSACTIONS ON SCALABLE INFORMATION SYSTEMS, 2024, 11 (01)
  • [25] Multi-Class Classification of Turkish Texts with Machine Learning Algorithms<bold> </bold>
    Gurcan, Fatih
    2018 2ND INTERNATIONAL SYMPOSIUM ON MULTIDISCIPLINARY STUDIES AND INNOVATIVE TECHNOLOGIES (ISMSIT), 2018, : 294 - 298
  • [26] Machine learning with automatic feature selection for multi-class protein fold classification
    Huang, CD
    Liang, SF
    Lin, CT
    Wu, RC
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2005, 21 (04) : 711 - 720
  • [27] Voting base Online Sequential Extreme Learning Machine for Multi-class Classification
    Cao, Jiuwen
    Lin, Zhiping
    Huang, Guang-Bin
    2013 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2013, : 2327 - 2330
  • [28] ECG Multi-Class Classification using Neural Network as Machine Learning Model
    Lassoued, Hela
    Ketata, Raouf
    2018 INTERNATIONAL CONFERENCE ON ADVANCED SYSTEMS AND ELECTRICAL TECHNOLOGIES (IC_ASET), 2017, : 473 - 478
  • [29] Multi-Class Text Classification of Uzbek News Articles using Machine Learning
    Rabbimov, I. M.
    Kobilov, S. S.
    IV INTERNATIONAL SCIENTIFIC AND TECHNICAL CONFERENCE MECHANICAL SCIENCE AND TECHNOLOGY UPDATE (MSTU-2020), 2020, 1546
  • [30] An active learning algorithm for multi-class classification
    Liu, Dongjiang
    Liu, Yanbi
    PATTERN ANALYSIS AND APPLICATIONS, 2019, 22 (03) : 1051 - 1063