Optimization process occurs in many aspects and areas of everyday life. However, the big use of the internet in recent years caused a complex management of large quantities of data that are stored in many different data sources and optimization attend the domain of big data to optimize multi and dynamic data that stored in a complex dataset including all types of transactions in the data sources. So, the diversity of data stored in different data sources caused a complexity to access the information and user find a problem to present the same real world object from different sources in a clear and complementary one representation. Therefore, the high complexity of the representation of a target concept “object” that provided from different data sources, the dynamic feature selection problem based big data fusion present as a solution and a novel approach that will be applicable to solve a dynamic multi-objective optimization feature selection problem (MOOP) based on Multi-Objective Particle Swarm Optimization (MOPSO). This paper carried out on the state-of-the-art of the research done to present an overview of static and dynamic optimization in literature approach, then to define an overview of big data and to present an idea about the future work that will be able to solve the dynamic feature selection based on big data fusion with MOPSO.

Dynamic Multi-Objective Optimization Problems (DMOPs) and Many-Objective Optimization Problems (MaOPs) are two classes of the optimization field that have potential applications in engineering. Modified Multi-Objective Evolutionary Algorithms hybrid approaches seem to be suitable to effectively deal with such problems. However, the standard Crow Search Algorithm has not been considered for either DMOPs or MaOPs to date. This paper proposes a Distributed Bi-behaviors Crow Search Algorithm (DB-CSA) with two different mechanisms, one corresponding to the search behavior and another to the exploitative behavior with a dynamic switch mechanism. The bi-behaviors CSA chasing profile is defined based on a large Gaussian-like Beta-1 function, which ensures diversity enhancement, while the narrow Gaussian Beta-2 function is used to improve the solution tuning and convergence behavior. Two variants of the proposed DB-CSA approach are developed: the first variant is used to solve a set of MaOPs with 2, 3, 5, 7, 8, 10,15 objectives, and the second aims to solve several types of DMOPs with different time-varying Pareto optimal sets and a Pareto optimal front. The second variant of DB-CSA algorithm (DB-CSA-II) is proposed to solve DMOPs, including a dynamic optimization process to effectively detect and react to the dynamic change. The Inverted General Distance, the Mean Inverted General Distance and the Hypervolume Difference are the main measurement metrics used to compare the DB-CSA approach to the state-of-the-art MOEAs. The Taguchi method has been used to manage the meta-parameters of the DB-CSA algorithm. All quantitative results are analyzed using the non-parametric Wilcoxon signed rank test with 0.05 significance level, which validated the efficiency of the proposed method for solving 44 test beds (21 DMOPs and 23 MaOPS).

Background: Artificial intelligence (AI) is transforming medicine by supporting data-driven diagnosis, prognosis, and personalized care. In rheumatology, AI applications are rapidly expanding in imaging, disease monitoring, and therapeutic decision support. This review aimed to summarize current evidence on AI in osteoporosis and chronic inflammatory rheumatic diseases, with a focus on methodological robustness and clinical applicability. Methods: A narrative review was conducted following SANRA criteria. PubMed and the Cochrane Library were systematically searched for studies published between January 2015 and July 2025 using MeSH terms and free-text keywords related to AI, osteoporosis, and inflammatory rheumatic diseases. A total of 323 articles were included. Results: Machine learning and deep learning models show strong performance in osteoporosis for predicting bone mineral density (BMD), bone loss, and fractures. In chronic inflammatory rheumatic diseases, AI improves imaging interpretation, particularly for sacroiliitis. AI tools also demonstrate potential for predicting disease risk and activity, diagnostic support and treatment response. Hybrid models combining imaging, clinical, and biological data appear particularly promising. However, most studies rely on retrospective single-center datasets, with limited external validation, suboptimal explainability, and scarce evidence of real-world implementation. Conclusions: AI holds significant promise for advancing diagnosis and personalized management in osteoporosis and rheumatic diseases. However, major challenges persist, including heterogeneous data quality, inconsistent methodological reporting, limited clinical validation, and barriers to integration into routine practice. Bridging the gap between algorithmic performance and clinical impact will require prospective studies, robust validation frameworks, and strategies to build trust among clinicians and patients.

Particle swarm optimization system based on the distributed architecture over multiple sub-swarms has shown its efficiency for static optimization and has not been studied to solve dynamic multi-objective problems (DMOPs). When solving DMOP, tracking the best solutions over time and ensuring good exploitation and exploration are the main challenging tasks. This study proposes a novel Dynamic Pareto bi-level Multi-Objective Particle Swarm Optimization (DPb-MOPSO) algorithm including two parallel optimization levels. At the first level, all solutions are managed in a single search space. When a dynamic change is successfully detected in the objective values, the Pareto ranking operator is used to enable a multiple sub-swarm’ subdivisions and processing which drives the second level of enhanced exploitation. A dynamic handling strategy based on random detectors is used to track the changes of the objective function due to time-varying parameters. A response strategy consisting in re-evaluate all unimproved solutions and replacing them with newly generated ones is also implemented. Inverted generational distance, mean inverted generational distance, and hypervolume difference metrics are used to assess the DPb-MOPSO performances. All quantitative results are analyzed using Friedman’s analysis of variance while the Lyapunov theorem is used for stability analysis. Compared with several multi-objective evolutionary algorithms, the DPb-MOPSO is robust in solving 21 complex problems over a range of changes in both the Pareto optimal set and Pareto optimal front. For 13 UDF and ZJZ functions, DPb-MOPSO can solve 8/13 and 7/13 on IGD and HVD with moderate changes. For the 8 FDA and dMOP benchmarks, DPb-MOPSO was able to resolve 4/8 with severe change on MIGD, and 5/8 for moderate and slight changes. However, for the 3 kind of environmental changes, DPb-MOPSO assumes 4/8 of the solving function on IGD and HVD metrics.