Skip to main content
SpringerLink
Log in

Using a modified counter-propagation algorithm to classify conjoined data

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bishop CM (1997) Neural Networks: A Pattern Recognition Perspective. Institute of Physics Publishing & Oxford University Press; (B6): E. Fiesler, and R. Beale, (eds). In: Handbook of Neural Computation. ISBN: 0 7503 0312 3

  2. Hecht-Nielsen R (1987) Counterpropagation Networks. Applied Optics 26(23):4979–4984

    Google Scholar 

  3. Moody J, Darken CJ (1989) Fast learning in networks of locally turned processing units. Neural Computation 1:281–294

    Google Scholar 

  4. NeuralWare (1993) Neural computing; A technology handbook for professional II/PLUS and neuralWorks explorer. Pittsburgh, PA: NeuralWare

  5. Selim SZ, Ismail MA (1984) K-means-type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Transactions on Pattern Analysis and Machine Intelligence. 6(1):81–87

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Intelligent Systems and Complex Processes, Swinburne University of Technology, P.O.Box 218, Hawthorn, Australia, 3122

    Hans Pierrot & Tim Hendtlass

Authors
  1. Hans Pierrot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tim Hendtlass
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hans Pierrot.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pierrot, H., Hendtlass, T. Using a modified counter-propagation algorithm to classify conjoined data. Appl Intell 24, 241–251 (2006). https://doi.org/10.1007/s10489-006-8515-6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-006-8515-6

Keywords

Search

Navigation