In this paper, first we derive a novel relaxation method for the system of linear inequalities and apply it to the learning for associative memories. Since the proposed intersection learning can guarantee the recall of all training data, it can greatly enlarge the storage capacity of associative memories. In addition, it requires much less weights renewal times than the conventional methods. We also propose a multimodule associative memory which can be learned by the intersection learning algorithm. The proposed associative memory can deal with many-to-many associations and it is applied to a knowledge processing task. Computer simulation results show the effectiveness of the proposed learning algorithm and associative memory.
|出版物ステータス||Published - 1998 12 1|
|イベント||Proceedings of the 1998 2nd International Conference on knowledge-Based Intelligent Electronic Systems (KES '98) - Adelaide, Aust|
継続期間: 1998 4 21 → 1998 4 23
|Other||Proceedings of the 1998 2nd International Conference on knowledge-Based Intelligent Electronic Systems (KES '98)|
|期間||98/4/21 → 98/4/23|
ASJC Scopus subject areas
- Computer Science(all)