• Journal of applied mathematics & informatics
• /
• 제34권1_2호
• /
• pp.49-60
• /
• 2016

In this paper, two different approaches to chromatic number of a bipolar fuzzy graph are introduced. The first approach is based on the α-cuts of a bipolar fuzzy graph and the second approach is based on the definition of Eslahchi and Onagh for chromatic number of a fuzzy graph. Finally, the bipolar fuzzy vertex chromatic number and the edge chromatic number of a complete bipolar fuzzy graph, characterized.

• 한국지능시스템학회논문지
• /
• 제19권2호
• /
• pp.265-272
• /
• 2009

Fuzzy number intuitionistic fuzzy sets (FNIFSs), each of which is characterized by a membership function and a non-membership function whose values are trigonometric fuzzy number rather than exact numbers, are a very useful means to describe the decision information in the process of decision making. Wang [10] developed some arithmetic aggregation operators, such as the fuzzy number intuitionistic fuzzy weighted averaging (FIFWA) operator, the fuzzy number intuitionistic fuzzy ordered weighted averaging (FIFOWA) operator and the fuzzy number intuitionistic fuzzy hybrid aggregation (FIFHA) operator. In this paper, based on the FIFHA operator and the FIFWA operator, we investigate the group decision making problems in which all the information provided by the decision-makers is presented as fuzzy number intuitionistic fuzzy decision matrices where each of the elements is characterized by fuzzy number intuitionistic fuzzy numbers, and the information about attribute weights is partially known. An example is used to illustrate the applicability of the proposed approach.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제27권7호
• /
• pp.723-730
• /
• 2000

퍼지숫자는 보통숫자와는 달리 애매모호한 값을 표현하기 때문에, 어느 퍼지숫자가 다른 퍼지숫자보다 큰지 작은지를 명확히 기술하기 어렵다. 따라서, 주어진 퍼지숫자의 집합 내에서, 어느 퍼지숫자가 몇 번째로 큰지, 또는 k번째로 큰 퍼지숫자가 어느 것인지 역시 애매모호할 수밖에 없다. 본 논문에서는 퍼지숫자의 순위와 k번째로 큰 퍼지숫자를 결정하기 위하여 퍼지집합을 이용하는 방법을 제안한다. 제안하는 방법은 퍼지숫자들 사이에 퍼지대소관계가 주어졌다고 가정하며, 이를 이용하여 퍼지숫자의 순위와 k번째 큰 퍼지숫자를 결정한다. 제안하는 방법은 어느 한 퍼지숫자가 취할 수 있는 모든 순위를 퍼지집합으로 표현하며, k번째로 큰 퍼지숫자가 될 수 있는 모든 퍼지숫자들을 퍼지집합으로 표현한다.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.7-7
• /
• 2003

We studied closed set-valued Choquet integrals in two papers(1997, 2000) and convergence theorems under some sufficient conditions in two papers(2003), for examples : (i) convergence theorems for monotone convergent sequences of Choquet integrably bounded closed set-valued functions, (ii) covergence theorems for the upper limit and the lower limit of a sequence of Choquet integrably bounded closed set-valued functions. In this presentation, we consider fuzzy number-valued functions and define Choquet integrals of fuzzy number-valued functions. But these concepts of fuzzy number-valued Choquet inetgrals are all based on the corresponding results of interval-valued Choquet integrals. We also discuss their properties which are positively homogeneous and monotonicity of fuzzy number-valued Choquet integrals. Furthermore, we will prove convergence theorems for fuzzy number-valued Choquet integrals. They will be used in the following applications : (1) Subjectively probability and expectation utility without additivity associated with fuzzy events as in Choquet integrable fuzzy number-valued functions, (2) Capacity measure which are presented by comonotonically additive fuzzy number-valued functionals, and (3) Ambiguity measure related with fuzzy number-valued fuzzy inference.

• 대한수학회논문집
• /
• 제25권1호
• /
• pp.37-49
• /
• 2010

In this paper we introduce the integration of scalar valued functions with respect to a generalized fuzzy number measure which we call the generalized fuzzy number valued Bartle integral. We first establish some properties of the generalized fuzzy number measures and then study the generalized fuzzy number valued Bartle integrals.

• Annals of Fuzzy Mathematics and Informatics
• /
• 제16권3호
• /
• pp.301-316
• /
• 2018

In this paper, the concept of connected geodesic number, $gn_c(G)$, of a fuzzy graph G is introduced and its limiting bounds are identified. It is proved that all extreme nodes of G and all cut-nodes of the underlying crisp graph $G^*$ belong to every connected geodesic cover of G. The connected geodesic number of complete fuzzy graphs, fuzzy cycles, fuzzy trees and of complete bipartite fuzzy graphs are obtained. It is proved that for any pair k, n of integers with $3{\leq}k{\leq}n$, there exists a connected fuzzy graph G : (V, ${\sigma}$, ${\mu}$) on n nodes such that $gn_c(G)=k$. Also, for any positive integers $2{\leq}a<b{\leq}c$, it is proved that there exists a connected fuzzy graph G : (V, ${\sigma}$, ${\mu}$) such that the geodesic number gn(G) = a and the connected geodesic number $gn_c(G)=b$.

• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.1169-1183
• /
• 2008

In this paper, a method to find the weighted possibilistic variance and moments about the mean value of fuzzy numbers via applying a difuzzification using minimizer of the weighted distance between two fuzzy numbers is introduced. In this way, we obtain the nearest weighted point with respect to a fuzzy number, this main result is a new and interesting alternative justification to define of weighted mean of a fuzzy number. Considering this point and the weighted distance quantity, we introduce the weighted possibilistic mean (WPM) value and the weighted possibilistic variance(WPV) of fuzzy numbers. This paper shows that WPM is the nearest weighted point to fuzzy number and the WPV of fuzzy number is preserved more properties of variance in probability theory so that it can simply introduce the possibilistic moments about the mean of fuzzy numbers without problem. The moments of fuzzy numbers play an important role to estimate of parameters, skewness, kurtosis in many of fuzzy times series models.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
• /
• pp.1270-1273
• /
• 1993

Fuzzy optimal control is considered. An optimal sequence of controls is sought best satisfying fuzzy constraints on the controls and fuzzy goals on the states (outputs), with a fuzzy system under control Control over a fixed and specified, implicitly specified, fuzzy, and infinite termination time is discussed. For computational efficiency a small number of reference fuzzy staters and controls is to be assumed by which fuzzy controls and stated are approximated. Optimal control policies reference fuzzy states are determined as a fuzzy relation used, via the compositional rule of inference, to derive an optimal control. Since this requires a large number of overlapping reference fuzzy controls and states implying a low computational efficiency, a small number of nonoverlapping reference fuzzy states and controls is assumed, and then interpolative reasoning is used to infer an optimal fuzzy control for a current fuzzy state.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.353-356
• /
• 2001

In this paper, we study the existence of fuzzy solution for the following differential system with fuzzy coefficient using the different two methods: (equation omitted), where a, b is the fuzzy natural number generated by fuzzy number l . The a-level set of the fuzzy number (equation omitted). The -level set of a is (equation omitted) and -level set of b is (equation omitted).

• 한국멀티미디어학회논문지
• /
• 제7권6호
• /
• pp.841-850
• /
• 2004

This paper proposes a GA and GDM-based method for removing unnecessary rules and generating relevant rules from the fuzzy rules corresponding to several fuzzy partitions. The aim of proposed method is to find a minimum set of fuzzy rules that can correctly classify all the training patterns. When the fine fuzzy partition is used with conventional methods, the number of fuzzy rules has been enormous and the performance of fuzzy inference system became low. This paper presents the application of GA as a means of finding optimal solutions over fuzzy partitions. In each rule, the antecedent part is made up the membership functions of a fuzzy set, and the consequent part is made up of a real number. The membership functions and the number of fuzzy inference rules are tuned by means of the GA, while the real numbers in the consequent parts of the rules are tuned by means of the gradient descent method. It is shown that the proposed method has improved than the performance of conventional method in formulating and solving a combinatorial optimization problem that has two objectives: to maximize the number of correctly classified patterns and to minimize the number of fuzzy rules.