Hierarchical Classification with a Competitive Evolutionary Neural Tree

R.G. Adams, K. Butchart, N. Davey

Research output: Contribution to journalArticlepeer-review

23 Citations (Scopus)


A new, dynamic, tree structured network, the Competitive Evolutionary Neural Tree (CENT) is introduced. The network is able to provide a hierarchical classification of unlabelled data sets. The main advantage that the CENT offers over other hierarchical competitive networks is its ability to self determine the number, and structure, of the competitive nodes in the network, without the need for externally set parameters. The network produces stable classificatory structures by halting its growth using locally calculated heuristics. The results of network simulations are presented over a range of data sets, including Anderson’s IRIS data set. The CENT network demonstrates its ability to produce a representative hierarchical structure to classify a broad range of data sets.
Original languageEnglish
Pages (from-to)541-551
JournalNeural Networks
Issue number3
Publication statusPublished - 1999


Dive into the research topics of 'Hierarchical Classification with a Competitive Evolutionary Neural Tree'. Together they form a unique fingerprint.

Cite this