1 Chapter 2 Imprecise Categories, Approximations and Rough Sets #6 ChenKuang(Andy) Yang.

Slides:



Advertisements
Similar presentations
1 Predicates and Propositions Hugh Darwen CS252.HACD: Fundamentals of Relational Databases Section 3:
Advertisements

Introduction to Set Theory
Fuzzy Sets and Fuzzy Logic
_ Rough Sets. Basic Concepts of Rough Sets _ Information/Decision Systems (Tables) _ Indiscernibility _ Set Approximation _ Reducts and Core _ Rough Membership.
22 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Chapter 6 Eigenvalues and Eigenvectors
Rulebase Expert System and Uncertainty. Rule-based ES Rules as a knowledge representation technique Type of rules :- relation, recommendation, directive,
Instructor: Hayk Melikya
Fuzzy Sets and Fuzzy Logic Theory and Applications
Rough Set Strategies to Data with Missing Attribute Values Jerzy W. Grzymala-Busse Department of Electrical Engineering and Computer Science University.
Rough Sets Theory Speaker:Kun Hsiang.
Chap3 Reduction of Knowledge - Dongyi Jia - CS267 ID:104 - Fall 2008.
August 2005RSFDGrC 2005, Regina, Canada 1 Feature Selection Based on Relative Attribute Dependency: An Experimental Study Jianchao Han 1, Ricardo Sanchez.
PART 1 From classical sets to fuzzy sets 1. Introduction 2. Crisp sets: an overview 3. Fuzzy sets: basic types 4. Fuzzy sets: basic concepts FUZZY SETS.
Uncertainty Measure and Reduction in Intuitionistic Fuzzy Covering Approximation Space Feng Tao Mi Ju-Sheng.
August 12, 2003II. BASICS: Math Clinic Fall II. BASICS – Lecture 2 OBJECTIVES 1. To define the basic ideas and entities in fuzzy set theory 2. To.
1 Foundations of Interval Computation Trong Wu Phone: Department of Computer Science Southern Illinois University Edwardsville.
MTH-471 Integral Equations Sheikh Irfan Ullah Khan Assistant Professor Department of Mathematics COMSTAS Institute of Information Technology.
Fussy Set Theory Definition A fuzzy subset A of a universe of discourse U is characterized by a membership function which associate with each element.
Machine Learning -Ramya Karri -Rushin Barot. Machine learning Rough Set Theory in Machine Learning? Knower’s knowledge – Closed World Assumption – Open.
Software Testing and QA Theory and Practice (Chapter 6: Domain Testing) © Naik & Tripathy 1 Software Testing and Quality Assurance Theory and Practice.
Chapter 7 Section 1. Copyright © 2012, 2008, 2004 Pearson Education, Inc. Objectives 1 The Fundamental Property of Rational Expressions Find the numerical.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
6.1 The Fundamental Property of Rational Expressions.
Sets.
Chapter 7 Section 1 Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
On Applications of Rough Sets theory to Knowledge Discovery Frida Coaquira UNIVERSITY OF PUERTO RICO MAYAGÜEZ CAMPUS
The Integral chapter 5 The Indefinite Integral Substitution The Definite Integral As a Sum The Definite Integral As Area The Definite Integral: The Fundamental.
Statistical Decision Theory
CSE & CSE6002E - Soft Computing Winter Semester, 2011 More Rough Sets.
Basic Concepts of Discrete Probability (Theory of Sets: Continuation) 1.
Chapter 3 – Set Theory  .
3. Rough set extensions  In the rough set literature, several extensions have been developed that attempt to handle better the uncertainty present in.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/21/2008.
From Rough Set Theory to Evidence Theory Roman Słowiński Laboratory of Intelligent Decision Support Systems Institute of Computing Science Poznań University.
Chapter 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs BY: MISS FARAH ADIBAH ADNAN IMK.
Chapter 2 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © Cengage Learning. All rights reserved.
Database System Concepts, 6 th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com Chapter 2: Introduction.
In this section, we investigate convergence of series that are not made up of only non- negative terms.
PROBABILITY, PROBABILITY RULES, AND CONDITIONAL PROBABILITY
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
1 Introduction to Abstract Mathematics Sets Section 2.1 Basic Notions of Sets Section 2.2 Operations with sets Section 2.3 Indexed Sets Instructor: Hayk.
Topic 2 Fuzzy Logic Control. Ming-Feng Yeh2-2 Outlines Basic concepts of fuzzy set theory Fuzzy relations Fuzzy logic control General Fuzzy System R.R.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/19/2008.
Chapter 2 With Question/Answer Animations. Section 2.1.
Properties of Real Numbers
Data Mining By Farzana Forhad CS 157B. Agenda Decision Tree and ID3 Rough Set Theory Clustering.
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
D EPENDENCIES IN K NOWLEDGE B ASE By: Akhil Kapoor Manandeep Singh Bedi.
4.2 Area Definition of Sigma Notation = 14.
1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.
Sets and Basic Operations on Sets Notation A set will usually be denoted by a capital letter, such as, A,B,X, Y,..., whereas lower-case letters, a, b,
Chapter 7 Sets and Probability Section 7.1 Sets What is a Set? A set is a well-defined collection of objects in which it is possible to determine whether.
1 You Never Escape Your… Relations EQUIVALENCE RELATION Presented by K.Senguttuvan, PGT Kendriya Vidyalaya, Gachibowli, Hyderabad. 2.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Department of Mathematics
Rough Set Theory and Databases Senior Lecturer: Laurie Webster II, M.S.S.E.,M.S.E.E., M.S.BME, Ph.D., P.E. Lecture 28 A First Course in Database Systems.
Rough Sets, Their Extensions and Applications 1.Introduction  Rough set theory offers one of the most distinct and recent approaches for dealing with.
More Rough Sets.
Department of Mathematics
Chapter 7: Introduction to Data Communications and Networking
Distributive Property
II. BASICS: Math Clinic Fall 2003
Set Operations Section 2.2.
Chapter 1: Introduction
Dependencies in Structures of Decision Tables
Rough Sets (Theoretical Aspects of Reasoning about Data)
Set Concepts & Subsets Sections 2.1 & 2.2.
FUZZY SETS AND CRISP SETS PPTS
Presentation transcript:

1 Chapter 2 Imprecise Categories, Approximations and Rough Sets #6 ChenKuang(Andy) Yang

2 Introduction Rough Sets Approximations of Set Properties of Approximations Approximations and Membership Relation

3 Introduction Fundamental concepts of the theory of knowledge – Classifications – Categories. Categories are subsets which can be derived using knowledge from a given knowledge base.

4 Some categories can be definable in one knowledge base but is undefinable in another knowledge base. If a category is not definable in a given knowledge base, can it be defined “approximately” in the given knowledge base?  The vague categories.

5 Rough Sets Let, and R be an equivalence relation. – X is R-definable if X is the union of some R-basic categories. – X is R-undefinable otherwise. R-definable sets will be also called R-exact sets R-undefinable sets will be also called R-inexact or R- rough. Set is said to be rough in K, if X is R-rough for any. Rough sets can be defined approximately: upper and lower approximation.

6 Approximations of Set Some subsets cannot be expressed exactly by employing available knowledge  Approximation of a set by other sets. R-lower and R-upper approximation of X –

7 The lower and upper approximations can be also presented in an equivalent form – Is the set of all elements of U which can be certainly classified as elements of X; is the set of elements of U which can be possibly classified as elements of X.

8

9 Proposition – X is R-definable if and only if – X is rough with respect to R if and only if

10 Properties of Approximations

11

12 Example Given a knowledge base K=(U,R), where U={x 1,x 2,…,x 8 }, and an equivalence relation with the following equivalence classes:

13 i.e. Let X 1 ={x 1,x 4,x 7 } and X 2 ={x 2,x 8 } – =

14 Approximations and Membership Relation Definition of a set is associated with knowledge about the set, thus a membership relation must be related to the knowledge. – Lower membership relation – Upper membership relation Both membership relations are referring to our knowledge and is not absolute.

15 Properties of Membership Relations

16 Q&A