.png){kind=icon}
Return
Extended distributed learning automata
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-014-0577-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a new structure for cooperative learning automata called extended learning automata (eDLA) is introduced. Based on the new structure, an iterative randomized heuristic algorithm using sampling is proposed for finding an optimal subgraph in a stochastic edge-weighted graph. Stochastic graphs are graphs in which the weights of edges have an unknown probability distribution. The proposed algorithm uses an eDLA to find a policy that leads to a subgraph that satisfy some restrictions such as minimum or maximum weight (length). At each stage of the proposed algorithm, the eDLA determines which edges should be sampled. The proposed eDLA-based sampling method may reduce unnecessary samples and hence decrease the time required for finding an optimal subgraph. It is shown that the proposed method converges to an optimal solution, the probability of which can be made arbitrarily close to 1 by using a sufficiently small learning parameter. A new variance-aware threshold value is also proposed that can significantly improve the convergence rate of the proposed eDLA-based algorithm. It is further shown that our algorithm is competitive in terms of the quality of the solution.
Keywords:
Distributed learning automata (DLA)
Extended distributed learning automata (eDLA)
Learning automata (LA)
Stochastic graph
Stochastic subgraph
Sampling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
ShareSavePastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
OAAI
OAAIShareSaveA Role for Transcription Factor GTF2IRD2 in Executive Function in Williams-Beuren Syndrome.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveService selection in stochastic environments: a learning-automaton based solutionAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSaveA formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functionsAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSaveShareSaveLAMR: learning automata based multicast routing protocol for multi-channel multi-radio wireless mesh networksAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSave
View more