【计算机】AAI09-4粗糙集.pptVIP

高级人工智能 史忠植 第九章 知识发现 内容 一、 概述 模糊集 粗糙集的提出 粗糙集的研究 粗糙集的研究 研究现状分析 研究现状分析 二、 知识分类 二、 知识分类 二、 知识分类 二、 知识分类 二、 知识分类 Information Systems/Tables IS is a pair (U, A) U is a non-empty finite set of objects. A is a non-empty finite set of attributes such that for every is called the value set of a. Decision Systems/Tables DS: is the decision attribute (instead of one we can consider more decision attributes). The elements of A are called the condition attributes. Issues in the Decision Table The same or indiscernible objects may be represented several times. Some of the attributes may be superfluous. 难区分性Indiscernibility The equivalence relation A binary relation which is reflexive (xRx for any object x) , symmetric (if xRy then yRx), and transitive (if xRy and yRz then xRz). The equivalence class of an element consists of all objects such that xRy. 难区分性Indiscernibility (2) Let IS = (U, A) be an information system, then with any there is an associated equivalence relation: where is called the B-indiscernibility relation. If then objects x and x’ are indiscernible from each other by attributes from B. The equivalence classes of the B-indiscernibility relation are denoted by 难区分性实例 Indiscernibility The non-empty subsets of the condition attributes are {Age}, {LEMS}, and {Age, LEMS}. IND({Age}) = {{x1,x2,x6}, {x3,x4}, {x5,x7}} IND({LEMS}) = {{x1}, {x2}, {x3,x4}, {x5,x6,x7}} IND({Age,LEMS}) = {{x1}, {x2}, {x3,x4}, {x5,x7}, {x6}}. 概念的边界 粗糙集的基本定义 粗糙集的基本定义 粗糙集的基本定义 上近似、下近似和边界区域 新型的隶属关系 隶属关系 集近似Set Approximation Let T = (U, A) and let and We can approximate X using only the information contained in B by constructing the B-lower and B-upper approximations of X, denoted and respectively, where 集近似Set Approximation (2) B-boundary region of X, consists of those objects that