The goal of this paper is to design a new correlation coefficient for -spherical fuzzy sets (TSFSs), which can accurately measure the nature of correlation (i.e., positive and negative) as well as the degree of relationship between TSFS. In order to formulate our proposed idea, we had taken inspiration from the statistical concept of the correlation coefficient. While doing so, we firstly introduce the variance and covariance of two TSFS and then constructed our scheme using these two newly defined notions. The numerical value of our proposed correlation coefficient lies within the interval , as it should be from a statistical point of view, whereas the existing methods cannot measure the negative correlation between TSFS, as their numerical value falls within the interval , which is not reasonable both statistically and intuitively. This aspect has also been thoroughly demonstrated using some numerical examples. The comparison results witnessed the dominance and upper hand of our proposed method over the existing definitions, with reliable and better results. In order to demonstrate the feasibility, usefulness, and practical application, we applied our proposed scheme to solve technical and scientific problems of multicriteria decision-making and pattern recognition. The numerical results show that our proposed scheme is practically suitable, technically applicable, and intuitively reasonable.
The omnipresence of internet technology and the advent of smart devices accumulate varieties of voluminous, viscous real-time data in a network from varieties of sources and also facilitates a way for criminal, intruders to attack the network which persuades information theft, financial loss, cyber-attack, and cyberwar. It is the major challenge for researchers to determine sensitive data from large scale real-time data so that the right action can be taken at the right time. Therefore, it is important to purpose a framework to handle massive data and to detect sensitive data from big data. In this regard, the collected data from the network are stored in cloud drives, other storage devices and then transferred to Hadoop distributed file system and processed with MapReduce processing using distributed computing concepts, Machine learning algorithms, and advanced statistical methods. Statistical analytical tools like Descriptive Analysis, Regression, ANOVA, Parametric Levene's test, Pearson Correlation, and Kruskal-Wallis Test present that recent big data analytical tools are effective than the traditional method for retrieval of sensitive data from Big Data.
1 January 2025 in International Journal of Intelligent Systems
The correlation coefficient (CC) is a statistical measure that is very useful to quantify the strength and direction of the relationship between two variables, processes, or sets. The primary objective of this paper is to propose a novel CC explicitly tailored for spherical fuzzy sets (SFSs), aiming to address the limitations and drawbacks associated with existing CCs. Our approach employs statistical concepts to quantify the correlation between variables and datasets within the context of SFSs. We formulate our proposed CC for SFSs by incorporating variance and covariance as fundamental components. This innovative approach not only accurately quantifies the degree of correlation between two SFSs but also characterizes the nature of their relationship, whether it is positive, neutral, or negative. As a result, our CC yields numerical values within the range of [−1, 1]. In contrast, existing methods focus solely on measuring the degree of association between two SFSs and are unable to differentiate the nature of the relationship, especially in cases of inverse correlation. We conduct a comparison to evaluate the efficiency of our proposed scheme in comparison to existing techniques, using numerical examples to showcase the dominance of our method. The comparative results indicate that our proposed approach effectively addresses the limitations of existing methods and produces more reliable and precise results. Furthermore, we applied our method to address three real‐world challenges in pattern recognition, medical diagnosis, and mega‐project selection, demonstrating its practicality, advantages, and usefulness.
27 April 2020 in Proceedings of Engineering and Technology Innovation
Clustering is a method for analyzing grouped data. Circular data were well used in various applications, such as wind directions, departure directions of migrating birds or animals, etc. The expectation & maximization (EM) algorithm on mixtures of von Mises distributions is popularly used for clustering circular data. In general, the EM algorithm is sensitive to initials and not robust to outliers in which it is also necessary to give a number of clusters a priori. In this paper, we consider a learning-based schema for EM, and then propose a learning-based EM algorithm on mixtures of von Mises distributions for clustering grouped circular data. The proposed clustering method is without any initial and robust to outliers with automatically finding the number of clusters. Some numerical and real data sets are used to compare the proposed algorithm with existing methods. Experimental results and comparisons actually demonstrate these good aspects of effectiveness and superiority of the proposed learning-based EM algorithm.