• 한국지능시스템학회:학술대회논문집
• /
• 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
• /
• 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.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2002년도 추계학술대회 및 정기총회
• /
• pp.5-8
• /
• 2002

In this paper, we introduce a simple new method on calculating the entropy of the image fuzzy set gotten by the extension principle without calculating its membership function.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제10권3호
• /
• pp.218-223
• /
• 2010

Discussion and analysis about relative mutual information has been carried out through fuzzy entropy and similarity measure. Fuzzy relative mutual information measure (FRIM) plays an important part as a measure of information shared between two fuzzy pattern vectors. This FRIM is analyzed and explained through similarity measure between two fuzzy sets. Furthermore, comparison between two measures is also carried out.

• 한국지능시스템학회논문지
• /
• 제12권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$.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2002년도 추계학술대회 및 정기총회
• /
• 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/.

• 해양환경안전학회:학술대회논문집
• /
• 해양환경안전학회 2017년도 공동학술발표회
• /
• pp.104-104
• /
• 2017

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2006년도 추계학술대회 학술발표 논문집 제16권 제2호
• /
• pp.157-160
• /
• 2006

본 논문에서 우리는 Wang와 Li(1998)와 Turksen(1986)에 의해 소개된 구간치 퍼지집합을 생각하고 구간치 퍼지집합상에서 쇼케이적분에 의해 정의된 엔트로피를 조사한다. 더욱이 이러한 엔트로피와 관련된 성질들을 토의하고 간단한 예들을 알아본다.

• 한국지능시스템학회논문지
• /
• 제18권2호
• /
• pp.257-261
• /
• 2008

In this Paper we derived fuzzy entropy that is based on similarity measure. Similarity measure represents the degree of similarity between two informations, those informations characteristics are not important. First we construct similarity measure between two informations, and derived entropy functions with obtained similarity measure. Obtained entropy is verified with proof. With the help of one-to-one similarity is also obtained through distance measure, this similarity measure is also proved in our paper.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
• /
• pp.5-8
• /
• 2000

In this paper, we propose new algorithms for the partition of input space and the generation of fuzzy control rules. The one consists of Shannon and extended fuzzy entropy function, the other consists of adaptive fuzzy neural system with back propagation teaming rule. The focus of this scheme is to realize the optimal fuzzy rule base with the minimal number of the parameters of the rules, reducing the complexity of the system. The proposed algorithm is tested with the time series prediction problem using Mackey-Glass chaotic time series.

• 한국통신학회논문지
• /
• 제30권9C호
• /
• pp.854-859
• /
• 2005

모호함의 측도를 위하여 퍼지 엔트로피와 거리측도 그리고 유사측도와의 관계를 이용하여 새로운 퍼지 측도를 제안하였다. 제안된 퍼지 엔트로피는 거리측도를 이용하여 구성된다. 거리측도는 일반적으로 사용되는 해밍 거리를 이용하였다. 또한 집합사이의 유사성을 측정하기 위한 유사측도를 거리 측도를 이용하여 구성하였고, 제안한 퍼지 엔트로피와 유사측도를 증명을 통하여 타당성을 확인하였다.