| Co-Investigator(Kenkyū-buntansha) |
WAN Youha Kanazawa University, Faculty of Eng.Asst.Prof., 工学部, 講師 (10283095)
IKEDA Kazushi Kanazawa University, Faculty of Eng.Asst.Prof., 工学部, 講師 (10262552)
馬 志強 金沢大学, 工学部, 講師 (10251935)
|
|---|
| Budget Amount *help |
¥1,600,000 (Direct Cost: ¥1,600,000)
Fiscal Year 1997: ¥300,000 (Direct Cost: ¥300,000)
Fiscal Year 1996: ¥1,300,000 (Direct Cost: ¥1,300,000)
|
|---|
| Research Abstract |
1. Pattern Classification by Multilayr Ne0ural Networks
In the signal detection based on frequency components, when the number of the signal samples is limited, accurate detection by linear methods is difficult. The multilayr neural networks can provide high classification performance. The vectors of the signals, which have a small number samples or low SNR,are usually distributed randomly in the N dimensional space. Therefore, the boundary, which separate these vectors becomes very complicated. This can be done by using the nonlinearity of the neurons in the multilayr NNs.
2. Selection of Minimum Training Data for Generalization
A data selection method has been proposed, by which the data belong to the different classes and across over the boundary are selected. These data can guarantee generalization, that is the data, which were not used in the training can be effectively separated.
3. Selection of Minimum Training Data for On-Line Training
The data are successively applied to the neural networks in the on-line applications. A method, which can select the useful data and hold the minimum number of the training data, has been proposed. Through several kinds of examples, the proposed method was confirmed to be useful.
4.Optimization of Activation Functions
The network size required for some applications is highly dependent on the activation functions, that is nonlinear functions. A simultaneous learning method for both connection weights and activation functons has been proposed. The parity check problem, which is a difficult task for the multilayr neural networks, can be effectively solved using the minimum number of the hidden units.
|
