Rinki Solanki
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Rinki Solanki has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Pranab K. Muhuri
Department of Computer Science, South Asian University, New Delhi, India
1 shared publication - Q. M. Danish Lohani
South Asian University
1 shared publication
Latest Publications
- 18 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 26 (6) , 3715-3729
Novel Adaptive Clustering Algorithms Based on a Probabilistic Similarity Measure Over Atanassov Intuitionistic Fuzzy Set
This paper reports a novel probabilistic similarity measure (PSM) for Atanassov Intuitionistic Fuzzy Sets (AIFSs). It then exploits PSM to propose an adaptive probabilistic similarity degree and develops the novel probabilistic λ-cutting algorithm for clustering. Further, the probabilistic distance measure (obtained from PSM) is used to develop a new clustering technique, which we have named 'Probabilistic Intuitionistic Fuzzy c-Mean (PIFCM) algorithm'. Simulation experiments have been conducted over a variety of data sets including UCI machine learning datasets and real-world car dataset. The results obtained have been thoroughly compared with other well-known clustering techniques such as fuzzy c-mean (FCM), IFCM, association coefficient method and λ-cutting method. From the experimental results, it is found that our probabilistic λ-cutting algorithm and PIFCM algorithm outperforms their existing counterparts.
- 18 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 26 (6) , 3715-3729
Novel Adaptive Clustering Algorithms Based on a Probabilistic Similarity Measure Over Atanassov Intuitionistic Fuzzy Set
This paper reports a novel probabilistic similarity measure (PSM) for Atanassov Intuitionistic Fuzzy Sets (AIFSs). It then exploits PSM to propose an adaptive probabilistic similarity degree and develops the novel probabilistic λ-cutting algorithm for clustering. Further, the probabilistic distance measure (obtained from PSM) is used to develop a new clustering technique, which we have named 'Probabilistic Intuitionistic Fuzzy c-Mean (PIFCM) algorithm'. Simulation experiments have been conducted over a variety of data sets including UCI machine learning datasets and real-world car dataset. The results obtained have been thoroughly compared with other well-known clustering techniques such as fuzzy c-mean (FCM), IFCM, association coefficient method and λ-cutting method. From the experimental results, it is found that our probabilistic λ-cutting algorithm and PIFCM algorithm outperforms their existing counterparts.