Linear Diophantine Fuzzy Aczel-Alsina Aggregation Operators by Using Fuzzy-C Means Clustering Algorithm

This paper investigates the detailed analysis of linear diophantine fuzzy Aczel-Alsina aggregation operators, enhancing their efficacy and computational efficiency while aggregating fuzzy data by using the fuzzy C-means (FCM) method. The primary goal is to look at the practical uses and theoretical foundations of these operators in the context of fuzzy systems. The aggregation process is optimised using the FCM algorithm, which divides data into clusters iteratively. This reduces computer complexity and enables more dependable aggregation. The mathematical underpinnings of Linear Diophantine Fuzzy Aczel-Alsina aggregation operators are thoroughly examined in this study, along with an explanation of their purpose in handling imprecise and uncertain data. It also investigates the integration of the FCM method, assessing its impact on simplifying the aggregation procedure, reducing algorithmic complexity, and improving the accuracy of aggregating fuzzy data sets. This work illuminates these operators performance and future directions through extensive computational experiments and empirical analysis. It provides an extensive framework that shows the recommended strategy’s effectiveness and use in a variety of real-world scenarios. We obtain our ultimate outcomes through experimental investigation, which we use to inform future work and research. The purpose of the study is to offer academics and practitioners insights on how to improve information fusion techniques and decision-making processes.