A Hierarchical Nonlinear Discriminant Classifier Trained Through an Evolutionary Algorithm

Ursani, Ziauddin; Corne, David

doi:10.1007/978-3-319-96292-4_22

Cited by 4 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Despite all the above success the technique still needs further theoretical enhancements for its wider applicability on the large spectrum of datasets, which are currently under investigation. www.aetic.theiaer.org 𝜇 𝑚𝑖𝑛 = 𝜇 𝑚𝑒𝑎𝑛 − 𝜌 * 𝜇 𝑠𝑑 (11) Rearranging the variables: 𝜌 = 𝜇 𝑚𝑒𝑎𝑛 −𝜇 𝑚𝑖𝑛 𝜇 𝑠𝑑 (12) Applying limits: as minima approaches 0. lim…”

Section: Discussionmentioning

confidence: 99%

“…Column 1 and 2 of the table identify the dataset, columns 3-9 state average results of the seven methods (as referred in the table) on ten datasets in terms of number of correct predictions in percentage. At the bottom of the table there are three additional rows i.e., rows (11)(12)(13). Row 11 provides overall average of all the ten datasets.…”

Section: Comparison With Contemporary Methodsmentioning

confidence: 99%

“…An evolutionary algorithm [10][11][12][13] was used to train a model proposed hierarchical learning method realized in Microsoft Visual Studio C/C++. It should be noted that the data normalisation procedure was not applied for errorfree model test.…”

Section: Errorfree Model Testmentioning

confidence: 99%

“…The theory of probabilistic hierarchical learning for classification was introduced in a conference paper [9]. It was moulded into a theory after a series of earlier papers [10][11][12][13]. This theory introduces the hierarchical model of learning.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

The Theory of Probabilistic Hierarchical Learning for Classification

Ursani¹,

Ursani²

2023

AETiC

Self Cite

View full text Add to dashboard Cite

Providing the ability of classification to computers has remained at the core of the faculty of artificial intelligence. Its application has now made inroads towards nearly every walk of life, spreading over healthcare, education, defence, economics, linguistics, sociology, literature, transportation, agriculture, and industry etc. To our understanding most of the problems faced by us can be formulated as classification problems. Therefore, any novel contribution in this area has a great potential of applications in the real world. This paper proposes a novel way of learning from classification datasets i.e., hierarchical learning through set partitioning. The theory of probabilistic hierarchical learning for classification has been evolved through several works while widening its scope with each instance. The theory demonstrates that the classification of any dataset can be learnt by generating a hierarchy of learnt models each capable of classifying a disjoint subset of the training set. The basic assertion behind the theory is that an accurate classification of complex datasets can be achieved through hierarchical application of low complexity models. In this paper, the theory is redefined and revised based on four mathematical principles namely, principle of successive bifurcation, principle of two-tier discrimination, principle of class membership and the principle of selective data normalization. The algorithmic implementation of each principle is also discussed. The scope of the approach is now further widened to include ten popular real-world datasets in its test base. This approach does not only produce their accurate models but also produced above 95% accuracy on average with regard to the generalising ability, which is competitive with the contemporary literature.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Comparison With Contemporary Methodsmentioning

confidence: 99%