Graph Theory Approach Probability Distribution Based Intuitionistic Fuzzy C-means Clustering Using LINEX Hellinger Distance and Its Applications
Year: 2026
Type: article
Abstract: Clustering is an essential task to unsupervised learning, its used to partition a dataset into groups of similar elements. In addition to traditional clustering methods, intuitionistic fuzzy c-means (IFCM) clustering algorithm has been studied to capturing uncertain information in the dataset. However, the IFCM algorithm has limitations such as the random initialization of cluster centers and the unrestricted influence of all samples on all cluster centers. Therefore, a robust algorithm named probability distribution of the minimal spanning tree based intuitionistic fuzzy c-means clustering algorithm using LINEX Hellinger distance is proposed for improving shortcomings of the IFCM. Firstly, the probability distribution of the minimal spanning tree algorithm organizes the initial cluster center based on the contribution of local density information from the data. Secondly, MST node probability distribution based IFCM using Hellinger distance, the membership degree boundary is assigned for the data samples on all cluster centers in the clustering process. Finally, the performance of the proposed modified IFCM algorithm is numerically validated using random dataset, partition coefficient and validation function are used to evaluate the validity of clustering also this paper compares the results of proposed method with the results of existing basic intuitionistic fuzzy c-means.
Authors: Senthil null, Nithya null, Bhuvaneswari null
Institution: Mother Teresa Women's University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7225906189
