Interactive neural‐network simulation: A textbook pattern‐recognition problem yields to art‐enhanced counterpropagation

We explain our motivation for truly interactive dynamic‐system simulation and apply DESIRE/NEUNET software to a classical textbook problem in neural‐network pattern recognition. Neural‐network designs which can distinguish two closely spaced spirals must discriminate precisely between complicated, nonconvex pattern clusters. This classical textbook problem is quite difficult. It was finally solved by an unconventional back‐propagation network using ad hoc layer skipping and, more accurately, by Boston University's ARTMAP algorithm. We discuss competitive learning and present a new accurate solution using a counterpropagation network whose novel competitive layer separates closely spaced patterns cleanly with the CLEARN algorithm, a very fast computer routine which emulates simplified adaptive‐resonance functionality.