This paper introduces a cutting-edge data architecture designed for a smart advertising context, prioritizing efficient data flow and performance, robust security, while guaranteeing data privacy and integrity. At the core of this study lies the application of federated learning (FL) as the primary methodology, which emphasizes the authenticity and privacy of data while promptly discarding irrelevant or fraudulent information. Our innovative data model employs a semi-random role assignment strategy based on a variety of criteria to efficiently collect and amalgamate data. The architecture is composed of model nodes, data nodes, and validator nodes, where the role of each node is determined by factors such as computational capability, interconnection quality, and historical performance records. A key feature of our proposed system is the selective engagement of a subset of nodes for modeling and validation, optimizing resource use and minimizing data loss. The AROUND social network platform serves as a real-world case study, illustrating the efficacy of our data architecture in a practical setting. Both simulated and real implementations of our architecture showcase its potential to dramatically curtail network traffic and average CPU usage, while preserving the accuracy of the FL model. Remarkably, the system is capable of achieving over a 50% reduction in both network traffic and average CPU usage even when the user count escalates by twenty-fold. The click rate, user engagement, and other parameters have also been evaluated, proving that the proposed architecture’s advantages do not affect the smart advertising accuracy. These findings highlight the proposed architecture’s capacity to scale efficiently and maintain high performance in smart advertising environments, making it a valuable contribution to the evolving landscape of digital marketing and FL.

Small datasets are frequent in some scientific fields. Such datasets are usually created due to the difficulty or cost of producing laboratory and experimental data. On the other hand, researchers are interested in using machine learning methods to analyze this scale of data. For this reason, in some cases, low-performance, overfitting models are developed for small-scale data. As a result, it appears necessary to develop methods for dealing with this type of data. In this research, we provide a new and innovative framework for regression problems with a small sample size. The base of our proposed method is the K-nearest neighbors (KNN) algorithm. For feature selection, instance selection, and hyperparameter tuning, we use the bat optimization algorithm (BA). Generative Adversarial Networks (GANs) are employed to generate synthetic data, effectively addressing the challenges associated with data sparsity. Concurrently, Deep Neural Networks (DNNs), as a deep learning approach, are utilized for feature extraction from both synthetic and real datasets. This hybrid framework integrates KNN, DNN, and GAN as foundational components and is optimized in multiple aspects (features, instances, and hyperparameters) using BA. The outcomes exhibit an enhancement of up to 5% in the coefficient of determination ($R^2$ score) using the proposed method compared to the standard KNN method optimized through grid search.

As social networks continue to expand, smart advertising increasingly depends on machine learning to deliver personalized and effective advertisements. Federated Learning (FL) is a distributed learning paradigm that supports privacy-preserving advertising by training models locally while avoiding direct sharing of raw user data. However, ensuring the correctness, reliability, and operational robustness of FL-driven smart advertising systems remains a significant challenge, particularly in distributed and user-facing environments. In this study, we investigate the use of model checking as a formal verification technique for validating key properties of an FL-based smart advertising workflow in social networks. We combine a structured finite-state modeling approach with Linear Temporal Logic (LTL) specifications and model-checking tools to assess correctness, availability, and baseline privacy requirements. Using controlled simulation-based configurations, we show that, for a setup with 100 users and 20 edge servers, the system delivers advertisements to all users and the global model successfully processes 200 out of 200 requests. We further analyze verification overhead through detection-time measurements, observing an increase in average detection time from 10.05 s to 11.98 s as the number of users rises from 20 to 100. These results indicate that the proposed framework can provide practical assurance for FL-enabled smart advertising workflows, support more reliable deployment in distributed intelligent systems, and improve trustworthiness in real advertising applications.

The rapid growth of online learning platforms has intensified the need for privacy-aware methods that can analyze learner behavior without centralizing sensitive activity logs. This study presents a Federated Learning-Based Graph Representation Learning (FL-GRL) framework for online student performance analysis in distributed learning environments. Each learner is represented through a local Student Learning Knowledge Graph (SLKG) that captures typed interactions with courses, lessons, webinars, challenges, and forum activities. Graph Neural Networks (GNNs) are used to derive relation-aware embeddings from these local graphs, while federated learning supports collaborative model optimization without sharing raw data. A federated clustering stage is then used to identify soft learner groups with partially overlapping behavioral patterns that may support exploratory personalization and confidence-aware educational follow-up. The current experiments focus on the feasibility of privacy-aware graph-based analysis rather than on a complete supervised prediction benchmark. Results across the evaluated graph-based variants indicate that the proposed framework is operationally viable, preserves relational structure better than flat-feature formulations, and provides an interpretable basis for learner-group discovery in privacy-sensitive online education settings.