A competitive three-level pruning technique for information security

Morshed Chowdhury, Jemal Abawajy, Andrei Kelarev, Kouichi Sakurai

研究成果: ジャーナルへの寄稿学術誌査読

抄録

The reduction of size of ensemble classifiers is important for various security applications. The majority of known pruning algorithms belong to the following three categories: ranking based, clustering based, and optimization based methods. The present paper introduces and investigates a new pruning technique. It is called a Three-Level Pruning Technique, TLPT, because it simultaneously combines all three approaches in three levels of the process. This paper investigates the TLPT method combining the state-of-the-art ranking of the Ensemble Pruning via Individual Contribution ordering, EPIC, the clustering of the K-Means Pruning, KMP, and the optimisation method of Directed Hill Climbing Ensemble Pruning, DHCEP, for a phishing dataset. Our new experiments presented in this paper show that the TLPT is competitive in comparison to EPIC, KMP and DHCEP, and can achieve better outcomes. These experimental results demonstrate the effectiveness of the TLPT technique in this example of information security application.

本文言語英語
ページ(範囲)25-32
ページ数8
ジャーナルCommunications in Computer and Information Science
490
DOI
出版ステータス出版済み - 2014

!!!All Science Journal Classification (ASJC) codes

  • コンピュータ サイエンス(全般)
  • 数学 (全般)

フィンガープリント

「A competitive three-level pruning technique for information security」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル