The article describes recent adaptive estimation algorithms over distributed networks. The algorithms rely on local collaborations and exploit the space-time structure of the data. Each node is allowed to communicate with its neighbors in order to exploit the spatial dimension, while it also evolves locally to account for the time dimension. Algorithms of the least-mean-squares and least-squares types are described. Both incremental and diffusion strategies are considered.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ali H. SAYED, Cassio G. LOPES, "Adaptive Processing over Distributed Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 8, pp. 1504-1510, August 2007, doi: 10.1093/ietfec/e90-a.8.1504.
Abstract: The article describes recent adaptive estimation algorithms over distributed networks. The algorithms rely on local collaborations and exploit the space-time structure of the data. Each node is allowed to communicate with its neighbors in order to exploit the spatial dimension, while it also evolves locally to account for the time dimension. Algorithms of the least-mean-squares and least-squares types are described. Both incremental and diffusion strategies are considered.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.8.1504/_p
Copy
@ARTICLE{e90-a_8_1504,
author={Ali H. SAYED, Cassio G. LOPES, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Adaptive Processing over Distributed Networks},
year={2007},
volume={E90-A},
number={8},
pages={1504-1510},
abstract={The article describes recent adaptive estimation algorithms over distributed networks. The algorithms rely on local collaborations and exploit the space-time structure of the data. Each node is allowed to communicate with its neighbors in order to exploit the spatial dimension, while it also evolves locally to account for the time dimension. Algorithms of the least-mean-squares and least-squares types are described. Both incremental and diffusion strategies are considered.},
keywords={},
doi={10.1093/ietfec/e90-a.8.1504},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - Adaptive Processing over Distributed Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1504
EP - 1510
AU - Ali H. SAYED
AU - Cassio G. LOPES
PY - 2007
DO - 10.1093/ietfec/e90-a.8.1504
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2007
AB - The article describes recent adaptive estimation algorithms over distributed networks. The algorithms rely on local collaborations and exploit the space-time structure of the data. Each node is allowed to communicate with its neighbors in order to exploit the spatial dimension, while it also evolves locally to account for the time dimension. Algorithms of the least-mean-squares and least-squares types are described. Both incremental and diffusion strategies are considered.
ER -