Weights optimization for multi-instance multi-label RBF neural networks using steepest descent method
Multi-instance multi-label learning (MIML) is an innovative learning framework where each sample is represented by multiple instances and associated with multiple class labels. In several learning situations, the multi-instance multi-label RBF neural networks (MIMLRBF) can exploit connections betwee...
Saved in:
Published in | Neural computing & applications Vol. 22; no. 7-8; pp. 1563 - 1569 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
London
Springer-Verlag
01.06.2013
Springer |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Multi-instance multi-label learning (MIML) is an innovative learning framework where each sample is represented by multiple instances and associated with multiple class labels. In several learning situations, the multi-instance multi-label RBF neural networks (MIMLRBF) can exploit connections between the instances and the labels of an MIML example directly, while most of other algorithms cannot learn that directly. However, the singular value decomposition (SVD) method used to compute the weights of the output layer will cause augmented overall error in network performance when training data are noisy or not easily discernible. This paper presents an improved approach to learning algorithms used for training MIMLRBF. The steepest descent (SD) method is used to optimize the weights after they are initialized by the SVD method. Comparing results employing diverse learning strategies shows interesting outcomes as have come out of this paper. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0941-0643 1433-3058 |
DOI: | 10.1007/s00521-012-0815-7 |