Stacked Community Prediction: A Distributed Stacking-Based Community Extraction Methodology for Large Scale Social Networks

Abstract

Nowadays, due to the extensive use of information networks in a broad range of fields, e.g., bio-informatics, sociology, digital marketing, computer science, etc., graph theory applications have attracted significant scientific interest. Due to its apparent abstraction, community detection has become one of the most thoroughly studied graph partitioning problems. However, the existing algorithms principally propose iterative solutions of high polynomial order that repetitively require exhaustive analysis. These methods can undoubtedly be considered resource-wise overdemanding, unscalable, and inapplicable in big data graphs, such as today’s social networks. In this article, a novel, near-linear, and highly scalable community prediction methodology is introduced. Specifically, using a distributed, stacking-based model, which is built on plain network topology characteristics of bootstrap sampled subgraphs, the underlined community hierarchy of any given social network is efficiently extracted in spite of its size and density. The effectiveness of the proposed methodology has diligently been examined on numerous real-life social networks and proven superior to various similar approaches in terms of performance, stability, and accuracy.

Mapping digital marketing research in social networks: A short-term bibliometric analysis (2018-2023)

“…The studies by Makris & Pispirigos (2021); and Gao & Zhao (2022), complement this result by providing examples and methodological approaches illustrating how technological advances are changing the way information is presented, consumed, and analyzed online. Makris & Pispirigos (2021), offer a perspective on social network analysis, both relevant aspects for understanding the observed trend mentioned initially, while Gao & Zhao (2022) demonstrate the practical application of technologies in marketing.…”