A new distributed and decentralized stochastic optimization algorithm with applications in Big Data analytics

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The world is witnessing an unprecedented growth of needs in data analytics. Big Data is distinguished by its three main characteristics: velocity, variety and volume. An open issue and challenge faced by the data community is how to scale up analytic algorithms. To address this issue, optimization of large scale data sets has attracted many researchers in recent years. In this paper, we first present the most recent advances in optimization of Big Data analytics. Further, we introduce a fully distributed stochastic optimization algorithm for decision making over large scale data sets. We also propose the optimal weight design for the proposed algorithm and study its performance by considering a practical application in cognitive networks. Experimental results confirm that the proposed method performs well, proven to be distributed, scalable and robust to missing data and communication failures.

Cite

CITATION STYLE

APA

Shahbazian, R., Grandinetti, L., & Guerriero, F. (2019). A new distributed and decentralized stochastic optimization algorithm with applications in Big Data analytics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11331 LNCS, pp. 77–91). Springer Verlag. https://doi.org/10.1007/978-3-030-13709-0_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free