Towards Modularity Optimization Using Reinforcement Learning to Community Detection in Dynamic Social Networks

• URL: http://arxiv.org/abs/2111.15623v1
• Date: Thu, 25 Nov 2021 19:55:57 GMT
• Title: Towards Modularity Optimization Using Reinforcement Learning to Community Detection in Dynamic Social Networks
• Authors: Aur\'elio Ribeiro Costa
• Abstract summary: We propose an approach to the problem of community detection in dynamic networks based on a reinforcement learning strategy. An experiment using synthetic and real-world dynamic network data shows results comparable to static scenarios.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The identification of community structure in a social network is an important problem tackled in the literature of network analysis. There are many solutions to this problem using a static scenario, when facing a dynamic scenario some solutions may be adapted but others simply do not fit, moreover when considering the demand to analyze constantly growing networks. In this context, we propose an approach to the problem of community detection in dynamic networks based on a reinforcement learning strategy to deal with changes on big networks using a local optimization on the modularity score of the changed entities. An experiment using synthetic and real-world dynamic network data shows results comparable to static scenarios.

Related papers

• Modularity-based approach for tracking communities in dynamic social networks [0.39462888523270856]
  We introduce a novel framework for tracking communities over time in a dynamic network. Our framework adopts a modularity-based strategy and does not require a predefined threshold. We validated the efficacy of our framework through extensive experiments on synthetic networks.
  arXiv  Detail & Related papers  (2023-02-24T17:17:59Z)
• Multi-agent Reinforcement Learning with Graph Q-Networks for Antenna Tuning [60.94661435297309]
  The scale of mobile networks makes it challenging to optimize antenna parameters using manual intervention or hand-engineered strategies. We propose a new multi-agent reinforcement learning algorithm to optimize mobile network configurations globally. We empirically demonstrate the performance of the algorithm on an antenna tilt tuning problem and a joint tilt and power control problem in a simulated environment.
  arXiv  Detail & Related papers  (2023-01-20T17:06:34Z)
• PointFix: Learning to Fix Domain Bias for Robust Online Stereo Adaptation [67.41325356479229]
  We propose to incorporate an auxiliary point-selective network into a meta-learning framework, called PointFix. In a nutshell, our auxiliary network learns to fix local variants intensively by effectively back-propagating local information through the meta-gradient. This network is model-agnostic, so can be used in any kind of architectures in a plug-and-play manner.
  arXiv  Detail & Related papers  (2022-07-27T07:48:29Z)
• Offline Contextual Bandits for Wireless Network Optimization [107.24086150482843]
  In this paper, we investigate how to learn policies that can automatically adjust the configuration parameters of every cell in the network in response to the changes in the user demand. Our solution combines existent methods for offline learning and adapts them in a principled way to overcome crucial challenges arising in this context.
  arXiv  Detail & Related papers  (2021-11-11T11:31:20Z)
• A purely data-driven framework for prediction, optimization, and control of networked processes: application to networked SIS epidemic model [0.8287206589886881]
  We develop a data-driven framework based on operator-theoretic techniques to identify and control nonlinear dynamics over large-scale networks. The proposed approach requires no prior knowledge of the network structure and identifies the underlying dynamics solely using a collection of two-step snapshots of the states.
  arXiv  Detail & Related papers  (2021-08-01T03:57:10Z)
• ABEM: An Adaptive Agent-based Evolutionary Approach for Mining Influencers in Online Social Networks [1.6128569396451058]
  A key step in evolutionary influence in online social networks is the identification of a small number of users, known as influencers. The evolving nature of the structure of these networks makes it difficult to locate and identify these influencers. We propose an adaptive agent-based approach to address this problem in the context of both static and dynamic networks.
  arXiv  Detail & Related papers  (2021-04-14T00:31:08Z)
• Competing Adaptive Networks [56.56653763124104]
  We develop an algorithm for decentralized competition among teams of adaptive agents. We present an application in the decentralized training of generative adversarial neural networks.
  arXiv  Detail & Related papers  (2021-03-29T14:42:15Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)
• On Robustness and Transferability of Convolutional Neural Networks [147.71743081671508]
  Modern deep convolutional networks (CNNs) are often criticized for not generalizing under distributional shifts. We study the interplay between out-of-distribution and transfer performance of modern image classification CNNs for the first time. We find that increasing both the training set and model sizes significantly improve the distributional shift robustness.
  arXiv  Detail & Related papers  (2020-07-16T18:39:04Z)
• Multi-Agent Reinforcement Learning for Adaptive User Association in Dynamic mmWave Networks [17.295158818748188]
  We propose a scalable and flexible algorithm for user association based on multi-agent reinforcement learning. Users act as independent agents that, based on their local observations only, learn to autonomously coordinate their actions in order to optimize the network sum-rate. Simulation results show that the proposed algorithm is able to adapt to (fast) changes of radio environment, thus providing large sum-rate gain in comparison to state-of-the-art solutions.
  arXiv  Detail & Related papers  (2020-06-16T10:51:27Z)
• DANR: Discrepancy-aware Network Regularization [15.239252118069762]
  Network regularization is an effective tool for learning coherent models over networks. We propose a novel approach that is robust to inadequate regularizations and effectively captures model evolution and structural changes over-temporal networks. We develop a scalable and scalable algorithm based on the alternating method of multipliers (ADMM) to solve the proposed problem with guaranteed convergence to global optimum solutions.
  arXiv  Detail & Related papers  (2020-05-31T02:01:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.