FUZZY PARTITIONS II: BELIEF FUNCTIONS A Probabilistic View T. Y. Lin

Size: px
Start display at page:

Download "FUZZY PARTITIONS II: BELIEF FUNCTIONS A Probabilistic View T. Y. Lin"

Transcription

1 FUZZY PARTITIONS II: BELIEF FUNCTIONS A Probabilistic View T. Y. Lin Department of Mathematics and Computer Science, San Jose State University, San Jose, California 95192, USA tylin@cs.sjsu.edu 1 Introduction One of the very first counter intuitive parts of belief function is its definition, it takes a simple minded "direct" sum of the measures of focal elements. In this computation the measures of the intersections are ignored. As a consequence atomic intersections of focal elements (the intersection contains no other focal elements) have zero belief measure. One may wander: Is belief function a reasonable and mathematically sound measure? Our answer is yes. functions can be viewed as a generalization of random variables, however, the generalization sounds too "naïve" in the first impression: In classical theory, the inner probability is the least upper bound of the direct sum of the probabilities of all masses. functions adopt the same definition; it is, the least upper bound of the direct sum of the basic probabilities of all focal elements. Indeed, they are the same, however, in classical theory all masses are disjoints, while focal elements may not. The goal of this paper is to show that in spite of these, belief functions are sound measures. Since [7], we have been searching for a "correct" view of belief functions. In that paper, we successfully express the belief functions in terms of probabilistic multivalued random variables. In [6], we also examine the belief function from the point of view of information granulation. We show belief functions are granular in the sense that they are functions on the level of granules (focal elements); a belief function is a pullback of a classical probability on the ring of power set that consists of those names of focal elements. Implicitly however the theory does assume that the names of focal elements are semantically independent. In the present paper, we explicitly express such an assumption in terms of granular fuzzy sets [3], [4]. A granular fuzzy set has a crisp set representations. So the disjoint-ness becomes an unambiguous notion. In terms of such notion "semantic independent" can be expressed precisely and formally. In this paper, we view the basic probability assignments of focal elements as assignments to some fuzzy sets; focal elements are merely their supports. Furthermore these fuzzy sets are mutually disjoint, even though their supports may intersects. This new view, we believe, provides a welldefined theory of belief functions. If one treats membership functions and fuzzy sets as synonyms [11], then the belief function on fuzzy sets are distributions (generalized functions) This research is partially supported by Electric Power Research Institute, Palo Alto, California, San Jose State University, Amdhal Corporation, NASA Grant NCC2-275, ONR Grant N , LLNL Grant , ARO Grant DAAH , and BISC Program of UC Berkeley

2 2 Discrete Random Variables Mathematically a random variable is a real valued function whose numerical values is determined by chance. In this section, we will examine the classical random variables from the point of view of belief functions. Let (C, Θ, Pr) be a probability space, where C is the universe, Θ is a σ-algebra, and Pr is a probability measure [2]; we will be interested in the case C is a finite set Suppose C is a finite set. A real-valued function X: C R, is a measurable function, if all its inverse images are measurable (this definition is equivalent to that of [2] only when C is finite). Let the set of distinct values be S = {a 1, a 2,, a n }. We will be interested in the inverse image X -1 (ai) of ai under X; for convenience we will write X i = X -1 (a i )={c c C and X(c)= a i } By abuse of notation, we also use X to denote the collection of inverse images X = {X i : i = 1, 2,, n} So X is a random variable as well as the collection of inverse images, which forms a partition on U. The collection X generates a σ-algebra Θ(X) Θ A new probability P X can thus be defined by setting P X (X i ) = Pr(X i ), and extending it to Θ(X) additively, namely, for Y = jx j, P X (Y) = j P X (X j ), where j varies through a finite subset of {1, 2,.., n}. In particular, the total sum PX(C) = n i=1 PX(Xi) =1. So (C, Θ(X), PX) is a new probability space The inner probability can be expressed by P X * (A) = SUP{ j P X (Y j ) A Y= jy j and Y j X}, where SUP is the least upper bound So given a random variable, we have (S1) a partition X on C, and (S2) a numerical value, m(xi )=PX(Xi ), i = 1, 2,, n, such that (S3) n i=1 m(xi) =1.

3 and the inner X-probability is the belief function. Bel(A) = P X * (A)= SUP{ j m(y j ) A Y= jy j and Y j X} It is clear Shafer theory is a generalization of random variables, in which (S1) is weaken to a partial covering, yet the theory computes belief functions as if X is disjoint. This observation spells out the precise point of our motivation in reinterpreting Shafer theory. The main goal of this paper is to re-interpret the notion of focal elements: even though they appear to have non-empty intersections, their basic probability assignments are, in fact, "measures" of disjoint fuzzy sets. Focal elements are merely the support of these fuzzy sets Let A be any subset of C. The lower and upper approximation are defined by L[A]= {Y j X: Y j A}; H[A] = {Y j X: Y j, Y j A 0} It is clear that L[A] Θ(X), and we have Proposition Bel X (A) = P X * (A) = P X (L[A]) Similar results, mainly on concrete counting measures, are obtained by many rough setters; e.g. see [9] for references and exposition. There are generalizations: In [10] and [11], we established the results for binary neighborhood systems (generalized rough sets for binary relations), in [6], we established further. The approximations, however, are not in the "usual sense," they are approximated in the level of concepts. We should point out that "direct" generalizations are invalid; see 3.5 in next section. 3 Functions -- Shafer Theory Let Ω be a finite set and 2 Ω be its power set. A unit interval valued function m : 2 Ω [0, 1], is a basic probability assignment (bpa) if m(0) =φ (φ is empty set) and Σ n m(en) =1, where En varies through 2 Ω. A set En is a focal element, if m(en) function Bel can be defined by basic probabilities: Bel (A) = Σ {m(b), B A}, where the summation runs through all subset of A Let C = {1, 2, 3, 4, 5, 6, 7, 8}. Two focal elements and their bpa's are

4 X={1,2,3,4,5} and Y={2,3,4,5,6}; m(x)= 2/3, m(y)= 1/3, and other bpa's are zero. Then, by definition, Bel(X) = 2/3, Bel(Y) =1/3, and Bel(X Y)=0. The belief measure of atomic intersection is zero; an intersection is called atomic if it does not contains any focal element. Intuitively, it implies that the evidences of any two atomic events are always independent; atomic event is an event that has no sub-events with positive evidences Let C ={1, 2, 3, 4, 5} be the universe. Let B be a binary relation B C C, which is defined by B1= { x (x, 1) B} = {1, 2, 3} B 2 = { x (x, 2) B} = B 3 = { x (x, 3) B}={1, 2, 3, 4} B4={ x (x, 4) B} ={2, 3, 4}, B5= { x (x, 5) B} = Each Bi consists of those points that are B-related to the element i; they are referred to as elementary B-neighborhoods. We will show that "direct" generalizations are invalid: Let Θ(B) be the σ-ring generated by {B 1, B 2, B 3, B 4, B 5 }. Suppose a measure is defined on Θ(B) as follows: Pr B (B1) = Pr B (B4) = 3/10, Pr B (B2) = Pr B (B3) = 2/5, Pr B (B5)= 0. Its inner measure is: Pr B *[{1, 2, 3, 4, 5}] = SUP{Pr B (B1 B4 B 5), Pr B (B2 B 5), Pr B (B3 B 5) = SUP{Pr B (B1 B4), Pr B (B 2), Pr B (B3)}=2/5, since B5=. Next, we take the measure of B i as bpa 's, m B (B i )= Pr B (B i ), i=1, 2, 3, 4, and other bpa's are zero, and we have Bel B ({1, 2, 3, 4, 5}) = m B ({1, 2, 3})+ m B ({2, 3, 4}}+ m B ({1, 2, 3, 4}) = Pr B (B1)+ Pr B (B4)+ Pr B (B1 {4}) = 1 The difference is resulted from that believe value sums up the multiple measures of the overlapping areas; B 1 is measured twice in believe value, only once in the inner probability. The question then is: Is multiple count of common area essential to human belief? Our proposal is that bpa's should not be interpret as measurements of focal elements, they are measurements of fuzzy sets whose supports are focal

5 elements. With such interpretations, belief functions are the inner probabilities of granular fuzzy sets; this is the subject of next section. 4 Functions - A New View 4.1. Suppose we are given a bpa, m : 2 C [0, 1]. Let Y i : i = 1, 2,, s be the focal elements. Let χ i be the characteristic function of Y i. Then we define our target membership functions (fuzzy sets and membership functions are synonyms) by (1) TY i (c)= m(y i )χ i (c), i = 1, 2,.., s. We write n = s+1 and define: TY n (c) = 1 s i=1 TY i (c), or equivalently, (2) n i=1 TY i (c) = 1. It is clear that TYn(c) 0; it is a legitimate membership function. Next we set bpa of TY i, i= 1, 2,, n: (3) m(ty i ) = m (Y i ), i = 1, 2,.., s, and m(ty n ) = 0. (4) n i=1 m(ty i ) = s i=1 m(y i )χ i (c) + m(ty n ) = Let us recall the notion of fuzzy partitions introduced in [1]. A family of fuzzy sets FX i, i = 1, 2,, t is said to be a BH- partition, if t i=1 FX i, (c) =1 Proposition {TY i i = 1, 2,.., n} is a BH-partition Based on the notion of contexts and granular fuzzy sets [3], [4], we introduced the notion partition for granular fuzzy sets. In [5], we show that under a nice context, a BH-partition can be realized by a crisp partition in the context. In this paper, we will construct a very specific crisp partition directly. Let U = C [0, 1] and be called the total space [5]. Consider the natural projection NP: U C. We will show that there is a crisp partition {X i } on U such that TY i (c) = α ([c] X i ) / α([c]) = α ([c] X i ) where [c]= c [0, 1], and α (c S)=α(S) is the Lesbegue measure of S [0,1]. Given a membership function TY i we will define X i as follows: At each point c C, we set c 0 = 0, c n =1. For i = 1, 2,.., n, we define half-open intervals,

6 Ic = [ci, ci+1) such that TYi(c) = ci ci-1, and set X i = c { c [c i-1, c i ) : c C} Such an X i is called a realization of TY i ; it is a crisp set representation of a fuzzy set TYi. The 6-tuple (U, NP, C, α, {TYi: i = 1, 2,.., n}, {Xi:i = 1, 2,.., n}) is called the context of {TY i :i = 1, 2,.., n}. Since n i=1 TY i (c) = 1, I c = {[c i-1, c i ) : i =1, 2,, n} is a crisp partition on [0, 1], and X = {Xi : i = 1, 2,, n} is a crisp partition on U= C [0, 1]. So, we have (S1) a partition X = {X i : i = 1, 2,, n}on U, and (S2) a numerical value, m(xi ) m(tyi) =m(yi), i = 1, 2,, n, such that (S3) n i=1 m(xi) =1 These three conditions clearly say that X can be treated as a random variable on the total space U. Next, we will define a belief function on C by X. BelX(A [0, 1]) = PX* (A [0, 1]) = SUP{ j m(xj) A [0, 1] jxj } Observe that A [0, 1] jx j if and only if A jy j, so, we have P X * (A [0, 1]) = SUP{ j m(x j ) A [0, 1] jx j } = SUP{ j m(yj) A jyj }= BelY(A) So we have define BelY(A) in terms of the probability PX of random variable X. Therefore Bel Y is a well-defined set function. 5 Conclusions The definition of belief functions sounds like a "too naïve" generalization of the probability theory of random variables. In this paper, we show that we can view the bpa of focal elements as probabilities of fuzzy sets that have those focal element as their supports. Using the notion of granular fuzzy sets [3], [4], these fuzzy sets on base space C can be realized by crisp sets on the total space U. Thus we have the setting of classical random variables on the total space. We show that the belief functions of fuzzy sets on C are the inner probabilities of the random variables on U.

7 So belief functions is a sound and well-defined set function. These findings also imply that we can introduce an additive fuzzy measure theory; this will be reported in near future. References 1. Bezdek, J. and Harris, J. (1978) Fuzzy Partitions and Relations: An Axiomatic Basis for Clustering, Fuzzy Sets and Systems 1, , Halmos, P. (1950), Measure Theory, Van Nostrand, Lin, T. Y. (1997), Rough Sets, Fuzzy Sets and Their Interactions. In: Proceedings of Fifth National Conferences on Fuzzy Theory and Applications (Fuzzy 97), Dec 19-20, Tainan, Taiwan, Lin, T. Y. (1998a), Sets with Partial Memberships. In: Proceedings of 1998 IEEE World Congress on Computational Intelligence, Anchorage, Alaska, May 4-9, Lin, T. Y. (1998b) Fuzzy Partitions I: Rough Sets, In : Proceedings of the Seventh Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, July 6-10, Paris, France, Lin, T. Y.(1998c) Granular Computing of Binary relations II: Rough Set Representation and Functions. In: Rough Sets and Knowledge Discovery, Polkowski and Skowron (eds), Springer-Verlag, 1998 (to appear). 7. Lin, T. Y. and Liau, C. J. (1997) Functions Based on Probabilistic Multivalued Random Variables. In: Proceedings of Joint Conference of Information Science, Research Triangle Park, North Carolina, March 1-5, 1997, Lin, T. Y. and Yao, Y. Y., Neighborhoods Systems and Functions Proceedings of The Fourth Workshop on Rough Sets, Fuzzy Sets and Machine Discovery, Tokyo, Japan, November 8-10,1996, Skowron A., and Grzymala-Busse, J.W., (1994), From rough set theory to evidence theory. In: Advances in the Dempster Shafer Theory of Evidence, R.R Yaeger, M. Fedrizzi and J. Kacprzyk (eds.), John Wiley & Sons, Inc., New York, Chichester, Brisbane, Toronto, Singapore, Yao and Lingras (1998, Interpretations of belief functions in the theory of rough sets. Information Sciences, Vol. 104, No. 1-2, pp , 1998) 11..Zadeh, L. A.(1965), Fuzzy sets, Information and Control, 8, , Tsau Young (T. Y.) Lin received his Ph.D from Yale University, and now is a Professor at San Jose State University, also a visiting scholar at BISC, University of California-Berkeley. He is the founding president of international rough set society. He has served as the chairs, co-chairs, and members of program committees in many conferences. He is an editor and a member of editorial board in several international journals. His interests include approximation theory (in database retrievals and reasoning), data mining, data security, data warehouse, fuzzy sets, intelligent control, non classical logic, Petri nets, and rough sets (alphabetical order).

Sets with Partial Memberships A Rough Set View of Fuzzy Sets

Sets with Partial Memberships A Rough Set View of Fuzzy Sets Sets with Partial Memberships A Rough Set View of Fuzzy Sets T. Y. Lin Department of Mathematics and Computer Science San Jose State University San Jose, California 95192-0103 E-mail: tylin@cs.sjsu.edu

More information

Neighborhoods Systems: Measure, Probability and Belief Functions

Neighborhoods Systems: Measure, Probability and Belief Functions 202-207. Neighborhoods Systems: Measure, Probability and Belief Functions T. Y. Lin 1 * tylin@cs.sjsu.edu Y, Y, Yao 2 yyao@flash.lakeheadu.ca 1 Berkeley Initiative in Soft Computing, Department of Electrical

More information

Rough operations on Boolean algebras

Rough operations on Boolean algebras Rough operations on Boolean algebras Guilin Qi and Weiru Liu School of Computer Science, Queen s University Belfast Belfast, BT7 1NN, UK Abstract In this paper, we introduce two pairs of rough operations

More information

Rough Sets, Rough Relations and Rough Functions. Zdzislaw Pawlak. Warsaw University of Technology. ul. Nowowiejska 15/19, Warsaw, Poland.

Rough Sets, Rough Relations and Rough Functions. Zdzislaw Pawlak. Warsaw University of Technology. ul. Nowowiejska 15/19, Warsaw, Poland. Rough Sets, Rough Relations and Rough Functions Zdzislaw Pawlak Institute of Computer Science Warsaw University of Technology ul. Nowowiejska 15/19, 00 665 Warsaw, Poland and Institute of Theoretical and

More information

Drawing Conclusions from Data The Rough Set Way

Drawing Conclusions from Data The Rough Set Way Drawing Conclusions from Data The Rough et Way Zdzisław Pawlak Institute of Theoretical and Applied Informatics, Polish Academy of ciences, ul Bałtycka 5, 44 000 Gliwice, Poland In the rough set theory

More information

Fuzzy Systems. Possibility Theory.

Fuzzy Systems. Possibility Theory. Fuzzy Systems Possibility Theory Rudolf Kruse Christian Moewes {kruse,cmoewes}@iws.cs.uni-magdeburg.de Otto-von-Guericke University of Magdeburg Faculty of Computer Science Department of Knowledge Processing

More information

Modeling the Real World for Data Mining: Granular Computing Approach

Modeling the Real World for Data Mining: Granular Computing Approach Modeling the Real World for Data Mining: Granular Computing Approach T. Y. Lin Department of Mathematics and Computer Science San Jose State University, San Jose, California 95192-0103 and Berkeley Initiative

More information

A Logical Formulation of the Granular Data Model

A Logical Formulation of the Granular Data Model 2008 IEEE International Conference on Data Mining Workshops A Logical Formulation of the Granular Data Model Tuan-Fang Fan Department of Computer Science and Information Engineering National Penghu University

More information

Computational Intelligence, Volume, Number, VAGUENES AND UNCERTAINTY: A ROUGH SET PERSPECTIVE. Zdzislaw Pawlak

Computational Intelligence, Volume, Number, VAGUENES AND UNCERTAINTY: A ROUGH SET PERSPECTIVE. Zdzislaw Pawlak Computational Intelligence, Volume, Number, VAGUENES AND UNCERTAINTY: A ROUGH SET PERSPECTIVE Zdzislaw Pawlak Institute of Computer Science, Warsaw Technical University, ul. Nowowiejska 15/19,00 665 Warsaw,

More information

On the Relation of Probability, Fuzziness, Rough and Evidence Theory

On the Relation of Probability, Fuzziness, Rough and Evidence Theory On the Relation of Probability, Fuzziness, Rough and Evidence Theory Rolly Intan Petra Christian University Department of Informatics Engineering Surabaya, Indonesia rintan@petra.ac.id Abstract. Since

More information

2 T.Y. Lin Acknowledgement This research is partially supported by Electric Power Research Institute, Palo Alto, California, San Jose State University

2 T.Y. Lin Acknowledgement This research is partially supported by Electric Power Research Institute, Palo Alto, California, San Jose State University Granular Computing on Binary Relations II Rough Set Representations and Belief Functions T.Y. Lin Department of Mathematics and Computer Science San Jose State University San Jose, California 95192-0103

More information

Comparison of Rough-set and Interval-set Models for Uncertain Reasoning

Comparison of Rough-set and Interval-set Models for Uncertain Reasoning Yao, Y.Y. and Li, X. Comparison of rough-set and interval-set models for uncertain reasoning Fundamenta Informaticae, Vol. 27, No. 2-3, pp. 289-298, 1996. Comparison of Rough-set and Interval-set Models

More information

A NEW CLASS OF FUSION RULES BASED ON T-CONORM AND T-NORM FUZZY OPERATORS

A NEW CLASS OF FUSION RULES BASED ON T-CONORM AND T-NORM FUZZY OPERATORS A NEW CLASS OF FUSION RULES BASED ON T-CONORM AND T-NORM FUZZY OPERATORS Albena TCHAMOVA, Jean DEZERT and Florentin SMARANDACHE Abstract: In this paper a particular combination rule based on specified

More information

Positional Analysis in Fuzzy Social Networks

Positional Analysis in Fuzzy Social Networks 2007 IEEE International Conference on Granular Computing Positional Analysis in Fuzzy Social Networks Tuan-Fang Fan Institute of Information Management National Chiao-Tung University Hsinchu 300, Taiwan

More information

Rough Approach to Fuzzification and Defuzzification in Probability Theory

Rough Approach to Fuzzification and Defuzzification in Probability Theory Rough Approach to Fuzzification and Defuzzification in Probability Theory G. Cattaneo and D. Ciucci Dipartimento di Informatica, Sistemistica e Comunicazione Università di Milano Bicocca, Via Bicocca degli

More information

The size of decision table can be understood in terms of both cardinality of A, denoted by card (A), and the number of equivalence classes of IND (A),

The size of decision table can be understood in terms of both cardinality of A, denoted by card (A), and the number of equivalence classes of IND (A), Attribute Set Decomposition of Decision Tables Dominik Slezak Warsaw University Banacha 2, 02-097 Warsaw Phone: +48 (22) 658-34-49 Fax: +48 (22) 658-34-48 Email: slezak@alfa.mimuw.edu.pl ABSTRACT: Approach

More information

On rule acquisition in incomplete multi-scale decision tables

On rule acquisition in incomplete multi-scale decision tables *Manuscript (including abstract) Click here to view linked References On rule acquisition in incomplete multi-scale decision tables Wei-Zhi Wu a,b,, Yuhua Qian c, Tong-Jun Li a,b, Shen-Ming Gu a,b a School

More information

Interpreting Low and High Order Rules: A Granular Computing Approach

Interpreting Low and High Order Rules: A Granular Computing Approach Interpreting Low and High Order Rules: A Granular Computing Approach Yiyu Yao, Bing Zhou and Yaohua Chen Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail:

More information

Naive Bayesian Rough Sets

Naive Bayesian Rough Sets Naive Bayesian Rough Sets Yiyu Yao and Bing Zhou Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 {yyao,zhou200b}@cs.uregina.ca Abstract. A naive Bayesian classifier

More information

A unified view of some representations of imprecise probabilities

A unified view of some representations of imprecise probabilities A unified view of some representations of imprecise probabilities S. Destercke and D. Dubois Institut de recherche en informatique de Toulouse (IRIT) Université Paul Sabatier, 118 route de Narbonne, 31062

More information

Rough Set Theory Fundamental Assumption Approximation Space Information Systems Decision Tables (Data Tables)

Rough Set Theory Fundamental Assumption Approximation Space Information Systems Decision Tables (Data Tables) Rough Set Theory Fundamental Assumption Objects from the domain are perceived only through the values of attributes that can be evaluated on these objects. Objects with the same information are indiscernible.

More information

Entropy and Specificity in a Mathematical Theory of Evidence

Entropy and Specificity in a Mathematical Theory of Evidence Entropy and Specificity in a Mathematical Theory of Evidence Ronald R. Yager Abstract. We review Shafer s theory of evidence. We then introduce the concepts of entropy and specificity in the framework

More information

A Comparative Study of Noncontextual and Contextual Dependencies

A Comparative Study of Noncontextual and Contextual Dependencies A Comparative Study of Noncontextual Contextual Dependencies S.K.M. Wong 1 C.J. Butz 2 1 Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: wong@cs.uregina.ca

More information

The Semi-Pascal Triangle of Maximum Deng Entropy

The Semi-Pascal Triangle of Maximum Deng Entropy The Semi-Pascal Triangle of Maximum Deng Entropy Xiaozhuan Gao a, Yong Deng a, a Institute of Fundamental and Frontier Science, University of Electronic Science and Technology of China, Chengdu, 610054,

More information

Issues in Modeling for Data Mining

Issues in Modeling for Data Mining Issues in Modeling for Data Mining Tsau Young (T.Y.) Lin Department of Mathematics and Computer Science San Jose State University San Jose, CA 95192 tylin@cs.sjsu.edu ABSTRACT Modeling in data mining has

More information

Research Article Decision Analysis via Granulation Based on General Binary Relation

Research Article Decision Analysis via Granulation Based on General Binary Relation International Mathematics and Mathematical Sciences Volume 2007, Article ID 12714, 13 pages doi:10.1155/2007/12714 esearch Article Decision Analysis via Granulation Based on General Binary elation M. M.

More information

Hybrid Logic and Uncertain Logic

Hybrid Logic and Uncertain Logic Journal of Uncertain Systems Vol.3, No.2, pp.83-94, 2009 Online at: www.jus.org.uk Hybrid Logic and Uncertain Logic Xiang Li, Baoding Liu Department of Mathematical Sciences, Tsinghua University, Beijing,

More information

Probability of fuzzy events

Probability of fuzzy events Probability of fuzzy events 1 Introduction Ondřej Pavlačka 1, Pavla Rotterová 2 Abstract. In economic practice, we often deal with events that are defined only vaguely. Such indeterminate events can be

More information

A new Approach to Drawing Conclusions from Data A Rough Set Perspective

A new Approach to Drawing Conclusions from Data A Rough Set Perspective Motto: Let the data speak for themselves R.A. Fisher A new Approach to Drawing Conclusions from Data A Rough et Perspective Zdzisław Pawlak Institute for Theoretical and Applied Informatics Polish Academy

More information

The internal conflict of a belief function

The internal conflict of a belief function The internal conflict of a belief function Johan Schubert 1 Abstract In this paper we define and derive an internal conflict of a belief function We decompose the belief function in question into a set

More information

Hierarchical Structures on Multigranulation Spaces

Hierarchical Structures on Multigranulation Spaces Yang XB, Qian YH, Yang JY. Hierarchical structures on multigranulation spaces. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(6): 1169 1183 Nov. 2012. DOI 10.1007/s11390-012-1294-0 Hierarchical Structures

More information

Rough Sets for Uncertainty Reasoning

Rough Sets for Uncertainty Reasoning Rough Sets for Uncertainty Reasoning S.K.M. Wong 1 and C.J. Butz 2 1 Department of Computer Science, University of Regina, Regina, Canada, S4S 0A2, wong@cs.uregina.ca 2 School of Information Technology

More information

Computers and Mathematics with Applications

Computers and Mathematics with Applications Computers and Mathematics with Applications 59 (2010) 431 436 Contents lists available at ScienceDirect Computers and Mathematics with Applications journal homepage: www.elsevier.com/locate/camwa A short

More information

Data Fusion with Imperfect Implication Rules

Data Fusion with Imperfect Implication Rules Data Fusion with Imperfect Implication Rules J. N. Heendeni 1, K. Premaratne 1, M. N. Murthi 1 and M. Scheutz 2 1 Elect. & Comp. Eng., Univ. of Miami, Coral Gables, FL, USA, j.anuja@umiami.edu, kamal@miami.edu,

More information

The Lebesgue Integral

The Lebesgue Integral The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters

More information

Practical implementation of possibilistic probability mass functions

Practical implementation of possibilistic probability mass functions Practical implementation of possibilistic probability mass functions Leen Gilbert Gert de Cooman Etienne E. Kerre October 12, 2000 Abstract Probability assessments of events are often linguistic in nature.

More information

A PRIMER ON ROUGH SETS:

A PRIMER ON ROUGH SETS: A PRIMER ON ROUGH SETS: A NEW APPROACH TO DRAWING CONCLUSIONS FROM DATA Zdzisław Pawlak ABSTRACT Rough set theory is a new mathematical approach to vague and uncertain data analysis. This Article explains

More information

Contradiction Measures and Specificity Degrees of Basic Belief Assignments

Contradiction Measures and Specificity Degrees of Basic Belief Assignments Contradiction Measures and Specificity Degrees of Basic Belief Assignments Florentin Smarandache Arnaud Martin Christophe Osswald Originally published as: Smarandache F., Martin A., Osswald C - Contradiction

More information

Practical implementation of possibilistic probability mass functions

Practical implementation of possibilistic probability mass functions Soft Computing manuscript No. (will be inserted by the editor) Practical implementation of possibilistic probability mass functions Leen Gilbert, Gert de Cooman 1, Etienne E. Kerre 2 1 Universiteit Gent,

More information

Generalization of Belief and Plausibility Functions to Fuzzy Sets

Generalization of Belief and Plausibility Functions to Fuzzy Sets Appl. Math. Inf. Sci. 6, No. 3, 697-703 (202) 697 Applied Mathematics & Information Sciences An International Journal Generalization of Belief and Plausibility Functions to Fuzzy Sets Jianyu Xiao,2, Minming

More information

Some Properties of a Set-valued Homomorphism on Modules

Some Properties of a Set-valued Homomorphism on Modules 2012, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.com Some Properties of a Set-valued Homomorphism on Modules S.B. Hosseini 1, M. Saberifar 2 1 Department

More information

TUNING ROUGH CONTROLLERS BY GENETIC ALGORITHMS

TUNING ROUGH CONTROLLERS BY GENETIC ALGORITHMS TUNING ROUGH CONTROLLERS BY GENETIC ALGORITHMS Teresa Chiu Department of Mathematics and Computer Science Sun Jose State University San Jose, California 95192 T.Y. Lin* Department of Electrical and Computer

More information

Uncertain Logic with Multiple Predicates

Uncertain Logic with Multiple Predicates Uncertain Logic with Multiple Predicates Kai Yao, Zixiong Peng Uncertainty Theory Laboratory, Department of Mathematical Sciences Tsinghua University, Beijing 100084, China yaok09@mails.tsinghua.edu.cn,

More information

Interval based Uncertain Reasoning using Fuzzy and Rough Sets

Interval based Uncertain Reasoning using Fuzzy and Rough Sets Interval based Uncertain Reasoning using Fuzzy and Rough Sets Y.Y. Yao Jian Wang Department of Computer Science Lakehead University Thunder Bay, Ontario Canada P7B 5E1 Abstract This paper examines two

More information

High Frequency Rough Set Model based on Database Systems

High Frequency Rough Set Model based on Database Systems High Frequency Rough Set Model based on Database Systems Kartik Vaithyanathan kvaithya@gmail.com T.Y.Lin Department of Computer Science San Jose State University San Jose, CA 94403, USA tylin@cs.sjsu.edu

More information

Scientific/Technical Approach

Scientific/Technical Approach Network based Hard/Soft Information Fusion: Soft Information and its Fusion Ronald R. Yager, Tel. 212 249 2047, E Mail: yager@panix.com Objectives: Support development of hard/soft information fusion Develop

More information

Great Expectations. Part I: On the Customizability of Generalized Expected Utility*

Great Expectations. Part I: On the Customizability of Generalized Expected Utility* Great Expectations. Part I: On the Customizability of Generalized Expected Utility* Francis C. Chu and Joseph Y. Halpern Department of Computer Science Cornell University Ithaca, NY 14853, U.S.A. Email:

More information

On Conditional Independence in Evidence Theory

On Conditional Independence in Evidence Theory 6th International Symposium on Imprecise Probability: Theories and Applications, Durham, United Kingdom, 2009 On Conditional Independence in Evidence Theory Jiřina Vejnarová Institute of Information Theory

More information

Handling imprecise and uncertain class labels in classification and clustering

Handling imprecise and uncertain class labels in classification and clustering Handling imprecise and uncertain class labels in classification and clustering Thierry Denœux 1 1 Université de Technologie de Compiègne HEUDIASYC (UMR CNRS 6599) COST Action IC 0702 Working group C, Mallorca,

More information

AN INTRODUCTION TO FUZZY SOFT TOPOLOGICAL SPACES

AN INTRODUCTION TO FUZZY SOFT TOPOLOGICAL SPACES Hacettepe Journal of Mathematics and Statistics Volume 43 (2) (2014), 193 204 AN INTRODUCTION TO FUZZY SOFT TOPOLOGICAL SPACES Abdülkadir Aygünoǧlu Vildan Çetkin Halis Aygün Abstract The aim of this study

More information

A class of fusion rules based on the belief redistribution to subsets or complements

A class of fusion rules based on the belief redistribution to subsets or complements Chapter 5 A class of fusion rules based on the belief redistribution to subsets or complements Florentin Smarandache Chair of Math. & Sciences Dept., Univ. of New Mexico, 200 College Road, Gallup, NM 87301,

More information

Research Article Special Approach to Near Set Theory

Research Article Special Approach to Near Set Theory Mathematical Problems in Engineering Volume 2011, Article ID 168501, 10 pages doi:10.1155/2011/168501 Research Article Special Approach to Near Set Theory M. E. Abd El-Monsef, 1 H. M. Abu-Donia, 2 and

More information

(2) E M = E C = X\E M

(2) E M = E C = X\E M 10 RICHARD B. MELROSE 2. Measures and σ-algebras An outer measure such as µ is a rather crude object since, even if the A i are disjoint, there is generally strict inequality in (1.14). It turns out to

More information

Financial Informatics IX: Fuzzy Sets

Financial Informatics IX: Fuzzy Sets Financial Informatics IX: Fuzzy Sets Khurshid Ahmad, Professor of Computer Science, Department of Computer Science Trinity College, Dublin-2, IRELAND November 19th, 2008 https://www.cs.tcd.ie/khurshid.ahmad/teaching.html

More information

On Markov Properties in Evidence Theory

On Markov Properties in Evidence Theory On Markov Properties in Evidence Theory 131 On Markov Properties in Evidence Theory Jiřina Vejnarová Institute of Information Theory and Automation of the ASCR & University of Economics, Prague vejnar@utia.cas.cz

More information

Reasoning with Uncertainty

Reasoning with Uncertainty Reasoning with Uncertainty Representing Uncertainty Manfred Huber 2005 1 Reasoning with Uncertainty The goal of reasoning is usually to: Determine the state of the world Determine what actions to take

More information

Learning Rules from Very Large Databases Using Rough Multisets

Learning Rules from Very Large Databases Using Rough Multisets Learning Rules from Very Large Databases Using Rough Multisets Chien-Chung Chan Department of Computer Science University of Akron Akron, OH 44325-4003 chan@cs.uakron.edu Abstract. This paper presents

More information

Abstract. In this paper we present a query answering system for solving non-standard

Abstract. In this paper we present a query answering system for solving non-standard Answering Non-Standard Queries in Distributed Knowledge-Based Systems Zbigniew W. Ras University of North Carolina Department of Comp. Science Charlotte, N.C. 28223, USA ras@uncc.edu Abstract In this paper

More information

Previous Accomplishments. Focus of Research Iona College. Focus of Research Iona College. Publication List Iona College. Journals

Previous Accomplishments. Focus of Research Iona College. Focus of Research Iona College. Publication List Iona College. Journals Network-based Hard/Soft Information Fusion: Soft Information and its Fusion Ronald R. Yager, Tel. 212 249 2047, E-Mail: yager@panix.com Objectives: Support development of hard/soft information fusion Develop

More information

UPPER AND LOWER SET FORMULAS: RESTRICTION AND MODIFICATION OF THE DEMPSTER-PAWLAK FORMALISM

UPPER AND LOWER SET FORMULAS: RESTRICTION AND MODIFICATION OF THE DEMPSTER-PAWLAK FORMALISM Int. J. Appl. Math. Comput. Sci., 2002, Vol.12, No.3, 359 369 UPPER AND LOWER SET FORMULAS: RESTRICTION AND MODIFICATION OF THE DEMPSTER-PAWLAK FORMALISM ISMAIL BURHAN TÜRKŞEN Knowledge/Intelligence Systems

More information

A Generalized Decision Logic in Interval-set-valued Information Tables

A Generalized Decision Logic in Interval-set-valued Information Tables A Generalized Decision Logic in Interval-set-valued Information Tables Y.Y. Yao 1 and Qing Liu 2 1 Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca

More information

Rough Set Model Selection for Practical Decision Making

Rough Set Model Selection for Practical Decision Making Rough Set Model Selection for Practical Decision Making Joseph P. Herbert JingTao Yao Department of Computer Science University of Regina Regina, Saskatchewan, Canada, S4S 0A2 {herbertj, jtyao}@cs.uregina.ca

More information

Bayes Theorem - the Rough Set Perspective

Bayes Theorem - the Rough Set Perspective Bayes Theorem - the Rough Set Perspective Zdzis law Pawlak Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, ul. Ba ltycka 5, 44 100 Gliwice, Poland MOTTO: I had come to an

More information

Universal Algebra for Logics

Universal Algebra for Logics Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic

More information

3 : Representation of Undirected GM

3 : Representation of Undirected GM 10-708: Probabilistic Graphical Models 10-708, Spring 2016 3 : Representation of Undirected GM Lecturer: Eric P. Xing Scribes: Longqi Cai, Man-Chia Chang 1 MRF vs BN There are two types of graphical models:

More information

A Scientometrics Study of Rough Sets in Three Decades

A Scientometrics Study of Rough Sets in Three Decades A Scientometrics Study of Rough Sets in Three Decades JingTao Yao and Yan Zhang Department of Computer Science University of Regina [jtyao, zhang83y]@cs.uregina.ca Oct. 8, 2013 J. T. Yao & Y. Zhang A Scientometrics

More information

Notes on Rough Set Approximations and Associated Measures

Notes on Rough Set Approximations and Associated Measures Notes on Rough Set Approximations and Associated Measures Yiyu Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca URL: http://www.cs.uregina.ca/

More information

ROUGH SET THEORY FOR INTELLIGENT INDUSTRIAL APPLICATIONS

ROUGH SET THEORY FOR INTELLIGENT INDUSTRIAL APPLICATIONS ROUGH SET THEORY FOR INTELLIGENT INDUSTRIAL APPLICATIONS Zdzisław Pawlak Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, Poland, e-mail: zpw@ii.pw.edu.pl ABSTRACT Application

More information

On flexible database querying via extensions to fuzzy sets

On flexible database querying via extensions to fuzzy sets On flexible database querying via extensions to fuzzy sets Guy de Tré, Rita de Caluwe Computer Science Laboratory Ghent University Sint-Pietersnieuwstraat 41, B-9000 Ghent, Belgium {guy.detre,rita.decaluwe}@ugent.be

More information

Why is There a Need for Uncertainty Theory?

Why is There a Need for Uncertainty Theory? Journal of Uncertain Systems Vol6, No1, pp3-10, 2012 Online at: wwwjusorguk Why is There a Need for Uncertainty Theory? Baoding Liu Uncertainty Theory Laboratory Department of Mathematical Sciences Tsinghua

More information

Sequential adaptive combination of unreliable sources of evidence

Sequential adaptive combination of unreliable sources of evidence Sequential adaptive combination of unreliable sources of evidence Zhun-ga Liu, Quan Pan, Yong-mei Cheng School of Automation Northwestern Polytechnical University Xi an, China Email: liuzhunga@gmail.com

More information

Classification Based on Logical Concept Analysis

Classification Based on Logical Concept Analysis Classification Based on Logical Concept Analysis Yan Zhao and Yiyu Yao Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada S4S 0A2 E-mail: {yanzhao, yyao}@cs.uregina.ca Abstract.

More information

Some remarks on conflict analysis

Some remarks on conflict analysis European Journal of Operational Research 166 (2005) 649 654 www.elsevier.com/locate/dsw Some remarks on conflict analysis Zdzisław Pawlak Warsaw School of Information Technology, ul. Newelska 6, 01 447

More information

Placing the Chinese Walls on the Boundary of Conflicts -Analysis of Symmetric Binary Relations

Placing the Chinese Walls on the Boundary of Conflicts -Analysis of Symmetric Binary Relations Placing the hinese Walls on the oundary of onflicts -nalysis of Symmetric inary Relations Tsau Young ( T. Y. )Lin epartment of omputer Science San Jose State University, San Jose, alifornia 95192 e-mail:

More information

ROUGH set methodology has been witnessed great success

ROUGH set methodology has been witnessed great success IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 14, NO. 2, APRIL 2006 191 Fuzzy Probabilistic Approximation Spaces and Their Information Measures Qinghua Hu, Daren Yu, Zongxia Xie, and Jinfu Liu Abstract Rough

More information

TEACHING INDEPENDENCE AND EXCHANGEABILITY

TEACHING INDEPENDENCE AND EXCHANGEABILITY TEACHING INDEPENDENCE AND EXCHANGEABILITY Lisbeth K. Cordani Instituto Mauá de Tecnologia, Brasil Sergio Wechsler Universidade de São Paulo, Brasil lisbeth@maua.br Most part of statistical literature,

More information

Uncertainty and Rules

Uncertainty and Rules Uncertainty and Rules We have already seen that expert systems can operate within the realm of uncertainty. There are several sources of uncertainty in rules: Uncertainty related to individual rules Uncertainty

More information

Towards Formal Theory of Measure on Clans of Fuzzy Sets

Towards Formal Theory of Measure on Clans of Fuzzy Sets Towards Formal Theory of Measure on Clans of Fuzzy Sets Tomáš Kroupa Institute of Information Theory and Automation Academy of Sciences of the Czech Republic Pod vodárenskou věží 4 182 08 Prague 8 Czech

More information

Fuzzy Limits of Functions

Fuzzy Limits of Functions Fuzzy Limits of Functions Mark Burgin Department of Mathematics University of California, Los Angeles 405 Hilgard Ave. Los Angeles, CA 90095 Abstract The goal of this work is to introduce and study fuzzy

More information

Sup-t-norm and inf-residuum are a single type of relational equations

Sup-t-norm and inf-residuum are a single type of relational equations International Journal of General Systems Vol. 00, No. 00, February 2011, 1 12 Sup-t-norm and inf-residuum are a single type of relational equations Eduard Bartl a, Radim Belohlavek b Department of Computer

More information

Knowledge Approximations and Representations in Binary Granular Computing

Knowledge Approximations and Representations in Binary Granular Computing 2012 IEEE International Conference on Granular Computing Knowledge Approximations and Representations in Binary Granular Computing Zehua Chen Department of Automation, Taiyuan Univ. of Technology, Taiyuan,

More information

On the connection of Hypergraph Theory with Formal Concept Analysis and Rough Set Theory 1

On the connection of Hypergraph Theory with Formal Concept Analysis and Rough Set Theory 1 On the connection of Hypergraph Theory with Formal Concept Analysis and Rough Set Theory 1 Gianpiero Cattaneo and Giampiero Chiaselotti o and Davide Ciucci and Tommaso Gentile o Department of Informatics,

More information

Measurable Choice Functions

Measurable Choice Functions (January 19, 2013) Measurable Choice Functions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/choice functions.pdf] This note

More information

Chapter 18 Rough Neurons: Petri Net Models and Applications

Chapter 18 Rough Neurons: Petri Net Models and Applications Chapter 18 Rough Neurons: Petri Net Models and Applications James F. Peters, 1 Sheela Ramanna, 1 Zbigniew Suraj, 2 Maciej Borkowski 1 1 University of Manitoba, Winnipeg, Manitoba R3T 5V6, Canada jfpeters,

More information

Fuzzy and Rough Sets Part I

Fuzzy and Rough Sets Part I Fuzzy and Rough Sets Part I Decision Systems Group Brigham and Women s Hospital, Harvard Medical School Harvard-MIT Division of Health Sciences and Technology Aim Present aspects of fuzzy and rough sets.

More information

Outlier Detection Using Rough Set Theory

Outlier Detection Using Rough Set Theory Outlier Detection Using Rough Set Theory Feng Jiang 1,2, Yuefei Sui 1, and Cungen Cao 1 1 Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences,

More information

With Question/Answer Animations. Chapter 2

With Question/Answer Animations. Chapter 2 With Question/Answer Animations Chapter 2 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Sequences and Summations Types of

More information

The maximum Deng entropy

The maximum Deng entropy The maximum Deng entropy Bingyi Kang a, Yong Deng a,b,c, a School of Computer and Information Science, Southwest University, Chongqing, 40075, China b School of Electronics and Information, Northwestern

More information

From Crisp to Fuzzy Constraint Networks

From Crisp to Fuzzy Constraint Networks From Crisp to Fuzzy Constraint Networks Massimiliano Giacomin Università di Brescia Dipartimento di Elettronica per l Automazione Via Branze 38, I-25123 Brescia, Italy giacomin@ing.unibs.it Abstract. Several

More information

Information Refinement and Revision for Medical Expert System Automated Extraction of Hierarchical Rules from Clinical Data

Information Refinement and Revision for Medical Expert System Automated Extraction of Hierarchical Rules from Clinical Data From: AAAI Technical Report SS-02-03. Compilation copyright 2002, AAAI (www.aaai.org). All rights reserved. Information Refinement and Revision for Medical Expert System Automated Extraction of Hierarchical

More information

Data Analysis - the Rough Sets Perspective

Data Analysis - the Rough Sets Perspective Data Analysis - the Rough ets Perspective Zdzisław Pawlak Institute of Computer cience Warsaw University of Technology 00-665 Warsaw, Nowowiejska 15/19 Abstract: Rough set theory is a new mathematical

More information

SYSTEM RELIABILITY AND WEIGHTED LATTICE POLYNOMIALS

SYSTEM RELIABILITY AND WEIGHTED LATTICE POLYNOMIALS SYSTEM RELIABILITY AND WEIGHTED LATTICE POLYNOMIALS arxiv:0712.0707v2 [math.pr] 28 May 2008 Alexander Dukhovny Mathematics Department, San Francisco State University San Francisco, CA 94132, USA dukhovny[at]math.sfsu.edu

More information

A statistical mechanical interpretation of algorithmic information theory

A statistical mechanical interpretation of algorithmic information theory A statistical mechanical interpretation of algorithmic information theory Kohtaro Tadaki Research and Development Initiative, Chuo University 1 13 27 Kasuga, Bunkyo-ku, Tokyo 112-8551, Japan. E-mail: tadaki@kc.chuo-u.ac.jp

More information

Handbook of Logic and Proof Techniques for Computer Science

Handbook of Logic and Proof Techniques for Computer Science Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives

More information

1.9 APPLICATION OF EVIDENCE THEORY TO QUANTIFY UNCERTAINTY IN FORECAST OF HURRICANE PATH

1.9 APPLICATION OF EVIDENCE THEORY TO QUANTIFY UNCERTAINTY IN FORECAST OF HURRICANE PATH 1.9 APPLICATION OF EVIDENCE THEORY TO QUANTIFY UNCERTAINTY IN FORECAST OF HURRICANE PATH Svetlana V. Poroseva, Julie Letschert** and M. Yousuff Hussaini School of Computational Science, Florida State University,

More information

International Journal of Approximate Reasoning

International Journal of Approximate Reasoning International Journal of Approximate Reasoning 52 (2011) 231 239 Contents lists available at ScienceDirect International Journal of Approximate Reasoning journal homepage: www.elsevier.com/locate/ijar

More information

Lecture 4 October 18th

Lecture 4 October 18th Directed and undirected graphical models Fall 2017 Lecture 4 October 18th Lecturer: Guillaume Obozinski Scribe: In this lecture, we will assume that all random variables are discrete, to keep notations

More information

Frank Agnosticism. - Shafer 1976 A Mathematical Theory of Evidence, pp

Frank Agnosticism. - Shafer 1976 A Mathematical Theory of Evidence, pp Frank Agnosticism The rules for belief functions permit us, when we have little evidence bearing on a proposition, to express frank agnosticism by according both that proposition and its negation very

More information

Andrzej Skowron, Zbigniew Suraj (Eds.) To the Memory of Professor Zdzisław Pawlak

Andrzej Skowron, Zbigniew Suraj (Eds.) To the Memory of Professor Zdzisław Pawlak Andrzej Skowron, Zbigniew Suraj (Eds.) ROUGH SETS AND INTELLIGENT SYSTEMS To the Memory of Professor Zdzisław Pawlak Vol. 1 SPIN Springer s internal project number, if known Springer Berlin Heidelberg

More information

ARTICLE IN PRESS. Information Sciences xxx (2016) xxx xxx. Contents lists available at ScienceDirect. Information Sciences

ARTICLE IN PRESS. Information Sciences xxx (2016) xxx xxx. Contents lists available at ScienceDirect. Information Sciences Information Sciences xxx (2016) xxx xxx Contents lists available at ScienceDirect Information Sciences journal homepage: www.elsevier.com/locate/ins Three-way cognitive concept learning via multi-granularity

More information