• 沒有找到結果。

模糊統計資料之推論程序與應用(2/2)

N/A
N/A
Protected

Academic year: 2021

Share "模糊統計資料之推論程序與應用(2/2)"

Copied!
5
0
0

加載中.... (立即查看全文)

全文

(1)

行政院國家科學委員會專題研究計畫成果報告

In traditional statistical methods, data obtained through questionnaires will be a collection of many single values or some specified interval. However, these data could not totally be represented for person’s opinions or feelings. What if respondents could answer questions subjectively by use of membership or the intermediate number of a given interval on the survey? When we are making In fuzzy representation, compared to binary logic, we can feel free to represent our feelings. It must be closer to our real feelings. In the investigation of social science, it would be more realistic and reasonable to use fuzzy modes than one stable unique point, when we are considering problems with ambiguity.

In order to study the patterns of inference when using “statements” which could not be regarded as either true or false, we review in this section the Boolean logic and an example of multi-valued logic, namely the so-called probability logic which is used in artificial intelligence.

If u,v ∈ν then u′,uv,uv are formulas. Note that no meaning has been attached to anything yet. Since variables (or proposition) are either true or false, we considered the truth value space {0,1}. For each map t:ν→{0,1}, we extend is to

: ~t

{0,1}n a nature way. For example, ) ( ) ( ) ( ~t ab =t a t b

, once we specify truth tables. For the connective, i.e. define,

, ' , ,∧

∨ on {0,1}. Below are the truth tables of connectives in classical two-valued logic.

0 10 1 '

0 0 1 0 0 0 0 1

1 1 1 1 0 1 1 0

Each map ~t : →{0,1} is called a truth evaluation. A formula A is called a tautology if~t(A)=1for any t:ν→{0,1}.

For example, if a∈ν,then aa′ is a tautology.

A formula A logically implies formula B if t

~

∀ such that ~t(A)=1, then ~t(B)=1. This important concept can be expressed in terms of a (material) implication operator

B

A⇒ , which is defined as A′∨B, i.e. with truth table

A B AB

1 1 1

0 1 1

1 0 0

0 0 1

Thus, A logically implies B if and only if B

A⇒ is a tautology. Two formulas A and B are logically equivalent when

) ( ~ ) ( ~t A =t B , ∀t:ν→{0,1}. This is the same as saying that AB is a tautology, where by AB we mean AB and

A B⇒ .

It is natural to regarded two logically equivalent formulas as equal. The logical equivalence relation is in fact an equivalence relation, and as such it partitions. The space

(2)

⇔ is the set of all equivalence classes. If we denoted by [a] the equivalence class containing the formula a, and set

] [ ] [ ] [ab = ab , [a]∧[b]=[ab] , ] ' [ ]'

[a = a then ⇔ is a Boolean algebra, called the (classical) propositional calculus. The connection between propositional calculus and set theory is left as an exercise (exercise 2).

In summary, propositional calculus is a logical atomic proposition. The validity of arguments does not depend on the meaning of these atomic propositions, but rather on the form of the argument. For example, one inference rule in prepositional calculus, known as modus ponens, states that fromaband a, we can deduce b logically, i.e.(ab)∧ab is a tautology.

Traditionally, modes indicate the greatest clustering or concentration of values. It is often used for making manageable, economical, social, educational or political decisions. We will further discuss them later. Fuzzy mode of discrete type is simpler than that of continuous type. Also the computations of discrete type fuzzy mode won’t be so complicated than that of continuous type. When questionnaires are vague and elements in factor set are distinguishable, an agreement of specified subject under consideration could be attained by calculating the fuzzy model of discrete type.

Before defining fuzzy modes of discrete, we should first define the fuzzy samples of discrete type.

Important Definitions:

Fuzzy Samples of Discr ete Type

Let U denote a universal set,

{ }

Lj kj=1be

a set of linguistic variables over U, and

{ }

n i i

P =1 be a fuzzy sample. All combinations of linguistic variables Lj’s and fuzzy samples

Pi’s constitute a fuzzy family of discrete type

over U. The fuzzy samples for a subject X is defined as : } , 1 , , 1 | ) , {(P L i n j k FFMXD = i j = L = L Fuzzy Modes of Discr ete Type

Let U denote a universal set and

D X

FFM be the fuzzy family of subject X over U. For each sample Pi, we assign a

standardized membership mij ( 1 1 = ∑ = k j ij m ) to every corresponding linguistic variable Lj.

Define FIj to be the fuzzy index to linguistic

variable Lj as: k , , 1 ), ( FI n 1 i K = ∑ = = Iij mij j j (3.2) , where    < ≥ = αα ij ij ij ij if m m if m I , 0 , 1 ) ( (3.3) , and α is defined to be a significant α-cut for

level set Λ( D X

FFM ), which is a collection of membership mij. The fuzzy modes for subject

X, FMD is thus defined to be specified Lj

with maximum value of FIj. That is,

* j D X L FM = ,where Lj* satisfies = } { max j j FI FIj*.

From the above definition, we could tell that there might exist more than one fuzzy modes. Under this situation, we could conclude that this subject owns fuzzy modes or it has more than one common opinion.

(3)

It will be more complex to discuss fuzzy modes of continuous type. The membership functions of uniform and symmetric shape. When the data is of continuous type, we will first try to separate them into several intervals with equal length, and let respondents choose one among these intervals. For example, if people are asked “What’s your monthly income?” and investigators designed the following five selections: (1)under NT $20,000 (2)NT $20,000~$40,000 (3)NT $40,000~$60,000 (4)NT $60,000~$80,000 and (5)over NT $80,000. The interval with the largest frequencies is called the modal interval, and the modal interval midpoint is taken as the value of the mode. What if the answers of respondents are multiple choices, or they select the first or the last ones? We may wonder what the truth of respondents is. Therefore, if we use the method of fuzzy modes, we could let respondents choose any possible intervals, and meanwhile they should assign a value to each choice to represent the possibility that it might happen in their real life. We could expect that a reasonable result can be obtained.

Fuzzy Modes of Tr i-Type

Let U be a universal set, α be a significant α-cut. If aj and bj (aj < bj )

are two units of µj1(α) and j= 1,2,… ,n. Consider the fuzzy samples C Tri

X

FFM. Suppose U is partitioned into k distinct area, the degree of fuzziness for each of the fuzzy sets A1,A2,… ,Ak is measured by : i A = ∑∫

(

)

= + ∩ n j TiTi ajbj j X d X 1( , 1) ( , ) ) ( ) ( α µ µ , k i=1 K, , (3.8)

where T1,T2,… ,Tk is a partition of R over U

and (Ti,Ti+ 1)’s are intervals for Ais’. The fuzzy

mode for Tri-type fuzzy samples is defined to be the interval with maximum fuzziness, that is:

{

T T a b j i A A i j k

}

FMCX Tri = ( i, i+1)∩( j, j) ∀ ≠ , i> j, , =1,2,K,

(3.9)

The following Figure 1 illustrates the way that the degree of fuzziness is calculated ) ( 3 X k+ µ µk+1(X) significant µk(X) α -level ) ( 2 X k+ µ ……Ti Ti+1 2 + i T ……

Figure1 Fuzzy memberships of Triangular-shape

Some Pr oper ties of Fuzzy Modes

Statistical parameters are used to represent characteristics of a population. However, there still many characteristics which are difficult to be computed by traditional parameters such as expectation, medium, and mode. Especially when we do research on the public opinions in the social science. The concept of fuzzy mode is developed to overcome the limitation of the conventional statistical technologies. Here, we propose some properties of fuzzy mode

(4)

which can be easily used in the real life. We will also compare these two types of modes with the traditional ones.

Pr oper ty 1. Let U be an universal set,

k j j

L} 1

{ = be a set of linguistic variables over U, and Ll be the

traditional mode. For fuzzy mode of discrete type, if the maximum membership mij for

every sample is greater than specified given significant α-cut and lies on the same linguistic variable Ll, then it must also be

the traditional mode.

Pr oper ty 2. Let U be an universal set,

{ }

n

i i

P =1 be a fuzzy sample over U with size n, and mijs’ are

standardized memberships of sample Pi of linguistic variable

Lj. For the discrete types of fuzzy

mode, the fuzzy mode is also the traditional mode for given significant 0.5-cut, if every Pi

owns only one mij> 0.5.

Pr oper ty 3. For discrete type of fuzzy mode, if there exists a sample Pihaving

same maximum memberships for different linguistic variable Ljs’,

we will conclude that there doesn’t exist mode. But we could find fuzzy modes for given appropriate significant α-cut. Pr oper ty 4. For discrete type of fuzzy mode, we could control the sample size contained in fuzzy mode by changing the signifi

(5)

5

模糊統計資料之推論程序與應用

計畫編號: NSC89-2213-E-004-008

執行期間: 2000/8 – 2002/7

參考文獻

相關文件

First, when the premise variables in the fuzzy plant model are available, an H ∞ fuzzy dynamic output feedback controller, which uses the same premise variables as the T-S

In this paper, by using Takagi and Sugeno (T-S) fuzzy dynamic model, the H 1 output feedback control design problems for nonlinear stochastic systems with state- dependent noise,

We shall show that after finite times of switching, the premise variable of the fuzzy system will remain in the universe of discourse and stability of the adaptive control system

Secondly then propose a Fuzzy ISM method to taking account the Fuzzy linguistic consideration to fit in with real complicated situation, and then compare difference of the order of

This research is to integrate PID type fuzzy controller with the Dynamic Sliding Mode Control (DSMC) to make the system more robust to the dead-band as well as the hysteresis

蔣松原,1998,應用 應用 應用 應用模糊理論 模糊理論 模糊理論

The scenarios fuzzy inference system is developed for effectively manage all the low-level sensors information and inductive high-level context scenarios based

Rivers dredge and gravel extraction through result of study, level divide into for being public construction mode, open bidding mode, joint management mode, and permission mode