• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.4
• /
• pp.259-262
• /
• 2010

Study about fuzzy entropy and similarity measure on intuitionistic fuzzy sets (IFSs) were proposed, and analyzed. Unlike fuzzy set, IFSs contains uncertainty named hesistancy, which is contained in fuzzy membership function itself. Hence, designing fuzzy entropy is not easy because of ununified entropy definition. By considering different fuzzy entropy definitions, fuzzy entropy is designed and discussed their relation. Similarity measure was also presented and verified its usefulness to evaluate degree of similarity.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.6
• /
• pp.583-588
• /
• 2002

Recently, Szmidt and Kacprzyk[Fuzzy Sets and Systems 118(2001) 467-477] proposed a non-probabilistic-type entropy measure for intuitionistic fuzzy sets. Tt is a result of a geometric interpretation of intuitionistic fuzzy sets and uses a ratio of distances between them. They showed that the proposed measure can be defined in terms of the ratio of intuitionistic fuzzy cardinalities: of $F\bigcapF^c and F\bigcupF^c$, while applying the Hamming distances. In this note, while applying the Euclidean distances, it is also shown that the proposed measure can be defined in terms of the ratio of some function of intuitionistic fuzzy cardinalities: of $F\bigcapF^c and F\bigcupF^c$.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.13-16
• /
• 2002

Recently, Szmidt and Kacprzyk[Fuzzy Sets and Systems 118(2001) 467-477] Proposed a non-probabilistic-type entropy measure for intuitionistic fuzzy sets. It is a result of a geometric interpretation of intuitionistic fuzzy sets and uses a ratio of distances between them. They showed that the proposed measure can be defined in terms of the ratio of intuitionistic fuzzy cardinalities: of F∩F$\^$c/ and F∪F$\^$c/, while applying the Hamming distances. In this note, while applying the Euclidean distances, it is also shown that the proposed measure can be defined in terms of the ratio of some function of intuitionistic fuzzy cardinalities: of F∩F$\^$c/ and F∪F$\^$c/.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.187-190
• /
• 2007

In this paper, we introduce concepts of entropy and similarity measure of interval-valued intuitionistic fuzzy sets (IVIFSs), discuss their relationship between similarity measure and entropy of IVIFSs, show that similarity measure and entropy of IVIFSs can be transformed by each other based on their axiomatic definitions and give some formulas to calculate entropy and similarity measure of IVIFSs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.3121-3143
• /
• 2019

Segmentation plays an important role in the field of image processing and computer vision. Intuitionistic fuzzy C-means (IFCM) clustering algorithm emerged as an effective technique for image segmentation in recent years. However, standard fuzzy C-means (FCM) and IFCM algorithms are sensitive to noise and initial cluster centers, and they ignore the spatial relationship of pixels. In view of these shortcomings, an improved algorithm based on IFCM is proposed in this paper. Firstly, we propose a modified non-membership function to generate intuitionistic fuzzy set and a method of determining initial clustering centers based on grayscale features, they highlight the effect of uncertainty in intuitionistic fuzzy set and improve the robustness to noise. Secondly, an improved nonlinear kernel function is proposed to map data into kernel space to measure the distance between data and the cluster centers more accurately. Thirdly, the local spatial-gray information measure is introduced, which considers membership degree, gray features and spatial position information at the same time. Finally, we propose a new measure of intuitionistic fuzzy entropy, it takes into account fuzziness and intuition of intuitionistic fuzzy set. The experimental results show that compared with other IFCM based algorithms, the proposed algorithm has better segmentation and clustering performance.

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.986-1016
• /
• 2019

Mobile user interface pattern (MUIP) is a kind of structured representation of interaction design knowledge. Several studies have suggested that MUIPs are a proven solution for recurring mobile interface design problems. To facilitate MUIP selection, an effective clustering method is required to discover hidden knowledge of pattern data set. In this paper, we employ the semi-supervised kernel fuzzy c-means clustering (SSKFCM) method to cluster MUIP data. In order to improve the performance of clustering, clustering parameters are optimized by utilizing the global optimization capability of particle swarm optimization (PSO) algorithm. Since the PSO algorithm is easily trapped in local optima, a novel PSO algorithm is presented in this paper. It combines an improved intuitionistic fuzzy entropy measure and a new population search strategy to enhance the population search capability and accelerate the convergence speed. Experimental results show the effectiveness and superiority of the proposed clustering method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.362-365
• /
• 2007