1994
DOI: 10.1007/bf01414354
|View full text |Cite
|
Sign up to set email alerts
|

Counterpropagation networks applied to the classification of alkanes through infrared spectra

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

1995
1995
2003
2003

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…This has two main advantages: firstly, performance becomes independent of initialisation; and secondly, an unusually large upper learning coefficient bound may be used, resulting in very rapid training. CDUL was developed originally as a means to overcome many of the training difficulties associated with unsupervised learning, the most obvious being that an exemplar may have resulted from training vectors of more than one class, and would hence be positioned poorly in the feature space [11]. This problem is associated to the difficulty of representing different classes of data, which exist within overlapping or disjoint regions of the feature space.…”
Section: Class Directed Unsupervised Learning and Related Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…This has two main advantages: firstly, performance becomes independent of initialisation; and secondly, an unusually large upper learning coefficient bound may be used, resulting in very rapid training. CDUL was developed originally as a means to overcome many of the training difficulties associated with unsupervised learning, the most obvious being that an exemplar may have resulted from training vectors of more than one class, and would hence be positioned poorly in the feature space [11]. This problem is associated to the difficulty of representing different classes of data, which exist within overlapping or disjoint regions of the feature space.…”
Section: Class Directed Unsupervised Learning and Related Networkmentioning
confidence: 99%
“…12. Find winning node: select the minimum distance of those computed in (11) and designate the node at this distance from x to be k**.…”
Section: Appendix: Cdul2 Algorithm With and Without Fastcdul Without mentioning
confidence: 99%
“…Previous studies using uniflow counter-propagation networks as chemical classification systems given infrared absorption spectra as input [18] have shown that, although good results may be obtained through a trial and error process of altering network parameters prior to training, the unsupervised Kohonen layer training does suffer from two main shortcomings, especially if classes within the training data are indistinct, i.e. overlapping or disjoint 9 First, it is possible that a single Kohonen node may be trained by vectors of more than one class 9 If this occurs, then the final positioning of the Kohonen node in feature space will not be representative of any single class of data, and hence cause error at the recall (or testing) stage of network operation.…”
Section: Introductionmentioning
confidence: 99%