Anda belum login :: 26 Nov 2024 15:15 WIB
Home
|
Logon
Hidden
»
Administration
»
Collection Detail
Detail
A Novel approach to Multiagent Reinforcement Learning: Utilizing OLAP Mining in the Learning Process
Oleh:
Kaya, Mehmet
;
Alhajj, Reda
Jenis:
Article from Journal - ilmiah internasional
Dalam koleksi:
IEEE Transactions on Systems, Man, and Cybernetics: Part C Applications and Reviews vol. 35 no. 4 (Nov. 2005)
,
page 582-590.
Topik:
Association Rules
;
Data Cube
;
Data Mining
;
Multiagent
;
online
Ketersediaan
Perpustakaan Pusat (Semanggi)
Nomor Panggil:
II69.1
Non-tandon:
1 (dapat dipinjam: 0)
Tandon:
tidak ada
Lihat Detail Induk
Isi artikel
Reinforcement learning is considered as a strong method for learning in multiagent systems environments. However, it still has some drawbacks, including modeling other learning agents present in the domain as part of the state of the environment, and some states are much less experienced than others, or some state-action pairs are never visited during the learning phase. Further, before the learning process is completed, an agent cannot exhibit a certain behavior in some states that may be sufficiently experienced. This shows that learning in a partially observable and dynamic multiagent systems environment still constitutes a difficult and major research problem that is worth further investigation. Motivated by this, in this paper, a novel learning approach that integrates online analytical processing (OLAP)-based data mining into the process is proposed. First, a data cube OLAP architecture that facilitates effective storage and processing of the state information reported by agents is described. This way, the action of the other agent, even one not in the visual environment of the agent under consideration, can simply be estimated by extracting online association rules, a well-known data mining technique, from the constructed data cube. Then, a new action selection model that is also based on association rules mining is presented. Finally, states that are not sufficiently experienced by mining multiple-level association rules from the proposed data cube are generalized. Experiments conducted on a well-known pursuit domain show the robustness and effectiveness of the proposed learning approach.
Opini Anda
Klik untuk menuliskan opini Anda tentang koleksi ini!
Kembali
Process time: 0.015625 second(s)