Using a modified counter-propagation algorithm to classify conjoined data

doi:10.1007/s10489-006-8515-6

Return

Using a modified counter-propagation algorithm to classify conjoined data

2006-06-01

PRE

Hans Pierrot *

Tim Hendtlass

DOI：10.1007/s10489-006-8515-6

Original

Original request for help

Save

Abstract

En 中文

Conjoined data is data in which the classes abut but do not overlap. It is difficult to determine the boundary between the classes, as there are no inherent clusters. As a result traditional classification methods, such as Counter-Propagation networks, may underperform. This paper describes a modified Counter-Propagation network that is able to refine the boundary definition and so perform better when classifying conjoined data. The efficiency with which network resources are used suggests that it is worthy of consideration for classifying all kinds of data, not just conjoined data.