A rule-based classifier with accurate and fast rule term induction for continuous attributes

Manal Almutairi; Frederic Stahl; Max Bramer

doi:10.1109/ICMLA.2018.00068

A rule-based classifier with accurate and fast rule term induction for continuous attributes

Manal Almutairi, Frederic Stahl, Max Bramer

University of Reading

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

221 Downloads (Pure)

Abstract

Rule-based classifiers are considered more expressive, human readable and less prone to over-fitting compared with decision trees, especially when there is noise in the data. Furthermore, rule-based classifiers do not suffer from the replicated subtree problem as classifiers induced by top down induction of decision trees (also known as 'Divide and Conquer'). This research explores some recent developments of a family of rulebased classifiers, the Prism family and more particular G-Prism-FB and G-Prism-DB algorithms, in terms of local discretisation methods used to induce rule terms for continuous data. The paper then proposes a new algorithm of the Prism family based on a combination of Gauss Probability Density Distribution (GPDD), InterQuartile Range (IQR) and data transformation methods. This new rule-based algorithm, termed G-Rules-IQR, is evaluated empirically and outperforms other members of the Prism family in execution time, accuracy and tentative accuracy.

Original language	English
Title of host publication	Proceedings - 17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018
Editors	M. Arif Wani, Moamar Sayed-Mouchaweh, Edwin Lughofer, Joao Gama, Mehmed Kantardzic
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	413-420
Number of pages	8
ISBN (Electronic)	978-1-5386-6805-4
ISBN (Print)	978-1-5386-6806-1
DOIs	https://doi.org/10.1109/ICMLA.2018.00068
Publication status	Published - 17 Jan 2019
Event	17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018 - Orlando, United States Duration: 17 Dec 2018 → 20 Dec 2018

Conference

Conference	17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018
Country/Territory	United States
City	Orlando
Period	17/12/18 → 20/12/18

Keywords

Dynamic Rule Term Boundaries
Interquartile Range Rule Term Boundaries
Modular Classification Rule Induction

Access to Document

10.1109/ICMLA.2018.00068

ICMLA2018
© © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Accepted author manuscript (Post-print), 520 KB

Cite this

Almutairi, M., Stahl, F., & Bramer, M. (2019). A rule-based classifier with accurate and fast rule term induction for continuous attributes. In M. A. Wani, M. Sayed-Mouchaweh, E. Lughofer, J. Gama, & M. Kantardzic (Eds.), Proceedings - 17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018 (pp. 413-420). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICMLA.2018.00068

Almutairi, Manal ; Stahl, Frederic ; Bramer, Max. / A rule-based classifier with accurate and fast rule term induction for continuous attributes. Proceedings - 17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018. editor / M. Arif Wani ; Moamar Sayed-Mouchaweh ; Edwin Lughofer ; Joao Gama ; Mehmed Kantardzic. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 413-420

@inproceedings{f1ca3815f56e42b7a878c5ce5b65d6fe,

title = "A rule-based classifier with accurate and fast rule term induction for continuous attributes",

abstract = "Rule-based classifiers are considered more expressive, human readable and less prone to over-fitting compared with decision trees, especially when there is noise in the data. Furthermore, rule-based classifiers do not suffer from the replicated subtree problem as classifiers induced by top down induction of decision trees (also known as 'Divide and Conquer'). This research explores some recent developments of a family of rulebased classifiers, the Prism family and more particular G-Prism-FB and G-Prism-DB algorithms, in terms of local discretisation methods used to induce rule terms for continuous data. The paper then proposes a new algorithm of the Prism family based on a combination of Gauss Probability Density Distribution (GPDD), InterQuartile Range (IQR) and data transformation methods. This new rule-based algorithm, termed G-Rules-IQR, is evaluated empirically and outperforms other members of the Prism family in execution time, accuracy and tentative accuracy.",

keywords = "Dynamic Rule Term Boundaries, Interquartile Range Rule Term Boundaries, Modular Classification Rule Induction",

author = "Manal Almutairi and Frederic Stahl and Max Bramer",

year = "2019",

month = jan,

day = "17",

doi = "10.1109/ICMLA.2018.00068",

language = "English",

isbn = "978-1-5386-6806-1",

pages = "413--420",

editor = "Wani, {M. Arif} and Moamar Sayed-Mouchaweh and Edwin Lughofer and Joao Gama and Mehmed Kantardzic",

booktitle = "Proceedings - 17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018 ; Conference date: 17-12-2018 Through 20-12-2018",

}

Almutairi, M, Stahl, F & Bramer, M 2019, A rule-based classifier with accurate and fast rule term induction for continuous attributes. in MA Wani, M Sayed-Mouchaweh, E Lughofer, J Gama & M Kantardzic (eds), Proceedings - 17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018. Institute of Electrical and Electronics Engineers Inc., pp. 413-420, 17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018, Orlando, United States, 17/12/18. https://doi.org/10.1109/ICMLA.2018.00068

A rule-based classifier with accurate and fast rule term induction for continuous attributes. / Almutairi, Manal; Stahl, Frederic; Bramer, Max.
Proceedings - 17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018. ed. / M. Arif Wani; Moamar Sayed-Mouchaweh; Edwin Lughofer; Joao Gama; Mehmed Kantardzic. Institute of Electrical and Electronics Engineers Inc., 2019. p. 413-420.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A rule-based classifier with accurate and fast rule term induction for continuous attributes

AU - Almutairi, Manal

AU - Stahl, Frederic

AU - Bramer, Max

PY - 2019/1/17

Y1 - 2019/1/17

N2 - Rule-based classifiers are considered more expressive, human readable and less prone to over-fitting compared with decision trees, especially when there is noise in the data. Furthermore, rule-based classifiers do not suffer from the replicated subtree problem as classifiers induced by top down induction of decision trees (also known as 'Divide and Conquer'). This research explores some recent developments of a family of rulebased classifiers, the Prism family and more particular G-Prism-FB and G-Prism-DB algorithms, in terms of local discretisation methods used to induce rule terms for continuous data. The paper then proposes a new algorithm of the Prism family based on a combination of Gauss Probability Density Distribution (GPDD), InterQuartile Range (IQR) and data transformation methods. This new rule-based algorithm, termed G-Rules-IQR, is evaluated empirically and outperforms other members of the Prism family in execution time, accuracy and tentative accuracy.

AB - Rule-based classifiers are considered more expressive, human readable and less prone to over-fitting compared with decision trees, especially when there is noise in the data. Furthermore, rule-based classifiers do not suffer from the replicated subtree problem as classifiers induced by top down induction of decision trees (also known as 'Divide and Conquer'). This research explores some recent developments of a family of rulebased classifiers, the Prism family and more particular G-Prism-FB and G-Prism-DB algorithms, in terms of local discretisation methods used to induce rule terms for continuous data. The paper then proposes a new algorithm of the Prism family based on a combination of Gauss Probability Density Distribution (GPDD), InterQuartile Range (IQR) and data transformation methods. This new rule-based algorithm, termed G-Rules-IQR, is evaluated empirically and outperforms other members of the Prism family in execution time, accuracy and tentative accuracy.

KW - Dynamic Rule Term Boundaries

KW - Interquartile Range Rule Term Boundaries

KW - Modular Classification Rule Induction

UR - http://www.scopus.com/inward/record.url?scp=85062226999&partnerID=8YFLogxK

U2 - 10.1109/ICMLA.2018.00068

DO - 10.1109/ICMLA.2018.00068

M3 - Conference contribution

AN - SCOPUS:85062226999

SN - 978-1-5386-6806-1

SP - 413

EP - 420

BT - Proceedings - 17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018

A2 - Wani, M. Arif

A2 - Sayed-Mouchaweh, Moamar

A2 - Lughofer, Edwin

A2 - Gama, Joao

A2 - Kantardzic, Mehmed

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018

Y2 - 17 December 2018 through 20 December 2018

ER -

Almutairi M, Stahl F, Bramer M. A rule-based classifier with accurate and fast rule term induction for continuous attributes. In Wani MA, Sayed-Mouchaweh M, Lughofer E, Gama J, Kantardzic M, editors, Proceedings - 17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018. Institute of Electrical and Electronics Engineers Inc. 2019. p. 413-420 doi: 10.1109/ICMLA.2018.00068

A rule-based classifier with accurate and fast rule term induction for continuous attributes

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this