Measuring Difficulty of Learning Using Ensemble Methods

被引:0
|
作者
Chen, Bowen [1 ]
Koh, Yun Sing [1 ]
Halstead, Ben [1 ]
机构
[1] Univ Auckland, Sch Comp Sci, Auckland, New Zealand
来源
DATA MINING, AUSDM 2022 | 2022年 / 1741卷
关键词
Complexity measures; Boosting; Instance difficulty; CLASSIFICATION PROBLEMS; COMPLEXITY-MEASURES;
D O I
10.1007/978-981-19-8746-5_3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Measuring the difficulty of each instance is a crucial metaknowledge extraction problem. Most studies on data complexity have focused on extracting the characteristics at a dataset level instead of the instance level while also requiring the complete label knowledge of the dataset, which can often be expensive to obtain. At the instance level, the most commonly used metrics to determine difficult to classify instances are dependant on the learning algorithm used (i.e., uncertainty), and are measurements of the entire system instead of only the dataset. Additionally, these metrics only provide information of misclassification in regard to the learning algorithm and not in respect of the composition of the instances within the dataset. We introduce and propose several novel instance difficulty measures in a semi-supervised boosted ensemble setting to identify difficult to classify instances based on their learning difficulty in relation to other instances within the dataset. The proposed difficulty measures measure both the fluctuations in labeling during the construction process of the ensemble and the amount of resources required for the correct label. This provides the degree of difficulty and gives further insight into the origin of classification difficulty at the instance level reflected by the scores of different difficulty measures.
引用
收藏
页码:28 / 42
页数:15
相关论文
共 50 条
  • [1] An Approach to Measuring the Difficulty of Learning Activities
    Gallego-Duran, Francisco J.
    Molina-Carmona, Rafael
    Llorens-Largo, Faraon
    LEARNING AND COLLABORATION TECHNOLOGIES, LCT 2016, 2016, 9753 : 417 - 428
  • [2] Measuring the difficulty of activities for adaptive learning
    Francisco J. Gallego-Durán
    Rafael Molina-Carmona
    Faraón Llorens-Largo
    Universal Access in the Information Society, 2018, 17 : 335 - 348
  • [3] Measuring the difficulty of activities for adaptive learning
    Gallego-Duran, Francisco J.
    Molina-Carmona, Rafael
    Llorens-Largo, Faran
    UNIVERSAL ACCESS IN THE INFORMATION SOCIETY, 2018, 17 (02) : 335 - 348
  • [4] Measuring the Difficulty of Specific Learning Problems
    Thornton, C.
    Connection Science, 1995, 7 (01)
  • [5] Measuring the prediction difficulty of individual cases in a dataset using machine learning
    Kwon, Hyunjin
    Greenberg, Matthew
    Josephson, Colin Bruce
    Lee, Joon
    SCIENTIFIC REPORTS, 2024, 14 (01):
  • [6] Using ensemble of ensemble machine learning methods to predict outcomes of cardiac resynchronization
    Cai, Cheng
    Tafti, Ahmad P.
    Ngufor, Che
    Zhang, Pei
    Xiao, Peilin
    Dai, Mingyan
    Liu, Hongfang
    Noseworthy, Peter
    Chen, Minglong
    Friedman, Paul A.
    Cha, Yong-Mei
    JOURNAL OF CARDIOVASCULAR ELECTROPHYSIOLOGY, 2021, 32 (09) : 2504 - 2514
  • [7] Measuring learning difficulty level by comparing ontologies
    Zhang, Dehai
    Zhu, Yao
    FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS, 2007, : 699 - +
  • [8] Heart disease detection using ensemble and non-ensemble machine learning methods
    Moumin, Zeinab Mahdi
    Ecemis, Irem Nur
    Karhan, Mustafa
    EUROPEAN PHYSICAL JOURNAL-SPECIAL TOPICS, 2024,
  • [9] Arabic Sentiment Analysis Using Deep Learning and Ensemble Methods
    Alharbi, Amal
    Kalkatawi, Manal
    Taileb, Mounira
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2021, 46 (09) : 8913 - 8923
  • [10] Classification of Energy Consumption in the Balkans using Ensemble Learning Methods
    Jankovic, Radmila
    Amelio, Alessia
    Ranjha, Zulfiqar Ali
    2019 2ND INTERNATIONAL CONFERENCE ON ADVANCEMENTS IN COMPUTATIONAL SCIENCES (ICACS), 2019, : 39 - 46