Cyberswarm: a novel swarm intelligence algorithm inspired by cyber community dynamics

• URL: http://arxiv.org/abs/2512.14752v1
• Date: Sun, 14 Dec 2025 12:20:20 GMT
• Title: Cyberswarm: a novel swarm intelligence algorithm inspired by cyber community dynamics
• Authors: Abdelsadeq Elfergany, Ammar Adl, Mohammed Kayed,
• Abstract summary: We introduce a general-purpose swarm intelligence algorithm for recommendation systems.<n>The framework models user preferences and community influences within a dynamic hypergraph structure.<n>The proposed algorithm represents an advancement in recommendation systems by bridging individual preferences and community influences.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recommendation systems face challenges in dynamically adapting to evolving user preferences and interactions within complex social networks. Traditional approaches often fail to account for the intricate interactions within cyber-social systems and lack the flexibility to generalize across diverse domains, highlighting the need for more adaptive and versatile solutions. In this work, we introduce a general-purpose swarm intelligence algorithm for recommendation systems, designed to adapt seamlessly to varying applications. It was inspired by social psychology principles. The framework models user preferences and community influences within a dynamic hypergraph structure. It leverages centrality-based feature extraction and Node2Vec embeddings. Preference evolution is guided by message-passing mechanisms and hierarchical graph modeling, enabling real-time adaptation to changing behaviors. Experimental evaluations demonstrated the algorithm's superior performance in various recommendation tasks, including social networks and content discovery. Key metrics such as Hit Rate (HR), Mean Reciprocal Rank (MRR), and Normalized Discounted Cumulative Gain (NDCG) consistently outperformed baseline methods across multiple datasets. The model's adaptability to dynamic environments allowed for contextually relevant and precise recommendations. The proposed algorithm represents an advancement in recommendation systems by bridging individual preferences and community influences. Its general-purpose design enables applications in diverse domains, including social graphs, personalized learning, and medical graphs. This work highlights the potential of integrating swarm intelligence with network dynamics to address complex optimization challenges in recommendation systems.

Related papers

• AdaEvolve: Adaptive LLM Driven Zeroth-Order Optimization [61.535567824938205]
  We introduce AdaEvolve, a framework that reformulates LLM-driven evolution as a hierarchical adaptive optimization problem.<n>AdaEvolve consistently outperforms the open-ended baselines across 185 different open-ended optimization problems.
  arXiv  Detail & Related papers  (2026-02-23T18:45:31Z)
• DynamiX: Large-Scale Dynamic Social Network Simulator [101.65679342680542]
  DynamiX is a novel large-scale social network simulator dedicated to dynamic social network modeling.<n>For opinion leaders, we propose an information-stream-based link prediction method recommending potential users with similar stances.<n>For ordinary users, we construct an inequality-oriented behavior decision-making module.
  arXiv  Detail & Related papers  (2025-07-26T12:13:30Z)
• GGBond: Growing Graph-Based AI-Agent Society for Socially-Aware Recommender Simulation [2.7083394633019973]
  We propose a high-fidelity social simulation platform to realistically simulate user behavior evolution under recommendation interventions.<n>The system comprises a population of Sim-User Agents equipped with a five-layer cognitive architecture that encapsulates key psychological mechanisms.<n>In particular, we introduce the Intimacy--Curiosity--Reciprocity--Risk (ICR2) motivational engine grounded in psychological and sociological theories.
  arXiv  Detail & Related papers  (2025-05-27T13:09:21Z)
• Adaptive Preference Aggregation [1.6317061277457001]
  Social choice theory provides a framework to aggregate preferences, but was not developed for the multidimensional applications typical of AI.<n>This work introduces a preference aggregation strategy that adapts to the user's context and that inherits the good properties of the maximal lottery, a Condorcet-consistent solution concept.
  arXiv  Detail & Related papers  (2025-03-13T09:57:41Z)
• Enhancing Recommendation Systems with GNNs and Addressing Over-Smoothing [7.06152589784002]
  This paper addresses key challenges in enhancing recommendation systems by leveraging Graph Neural Networks (GNNs)<n>The proposed approach introduces three GNN-based recommendation models, specifically designed to mitigate over-smoothing.<n>The study emphasizes the critical need for interpretability in recommendation systems, aiming to provide transparent and justifiable suggestions.
  arXiv  Detail & Related papers  (2024-12-04T07:50:27Z)
• Online Relational Inference for Evolving Multi-agent Interacting Systems [14.275434303742328]
  Online Inference (ORI) is designed to efficiently identify hidden interaction graphs in evolving multi-agent interacting systems. Unlike traditional offline methods that rely on a fixed training set, ORI employs online backpropagation, updating the model with each new data point. A key innovation is the use of an adjacency matrix as a trainable parameter, optimized through a new adaptive learning technique called AdaRelation.
  arXiv  Detail & Related papers  (2024-11-03T05:43:55Z)
• Multi-Agent Reinforcement Learning for Power Control in Wireless Networks via Adaptive Graphs [1.1861167902268832]
  Multi-agent deep reinforcement learning (MADRL) has emerged as a promising method to address a wide range of complex optimization problems like power control. We present the use of graphs as communication-inducing structures among distributed agents as an effective means to mitigate these challenges.
  arXiv  Detail & Related papers  (2023-11-27T14:25:40Z)
• APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation [86.29366168836141]
  We propose a graph-driven framework, named Adaptive and Personalized Graph Learning for Sequential Recommendation (APGL4SR) APGL4SR incorporates adaptive and personalized global collaborative information into sequential recommendation systems. As a generic framework, APGL4SR can outperform other baselines with significant margins.
  arXiv  Detail & Related papers  (2023-11-06T01:33:24Z)
• Generative Adversarial Reward Learning for Generalized Behavior Tendency Inference [71.11416263370823]
  We propose a generative inverse reinforcement learning for user behavioral preference modelling. Our model can automatically learn the rewards from user's actions based on discriminative actor-critic network and Wasserstein GAN.
  arXiv  Detail & Related papers  (2021-05-03T13:14:25Z)
• Optimizing Interactive Systems via Data-Driven Objectives [70.3578528542663]
  We propose an approach that infers the objective directly from observed user interactions. These inferences can be made regardless of prior knowledge and across different types of user behavior. We introduce Interactive System (ISO), a novel algorithm that uses these inferred objectives for optimization.
  arXiv  Detail & Related papers  (2020-06-19T20:49:14Z)
• Dynamic Hierarchical Mimicking Towards Consistent Optimization Objectives [73.15276998621582]
  We propose a generic feature learning mechanism to advance CNN training with enhanced generalization ability. Partially inspired by DSN, we fork delicately designed side branches from the intermediate layers of a given neural network. Experiments on both category and instance recognition tasks demonstrate the substantial improvements of our proposed method.
  arXiv  Detail & Related papers  (2020-03-24T09:56:13Z)

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.