【摘要】 定义离散化方案之间的偏序关系以及交、并运算,将一个信息表的各种离散化方案组织成一个格空间,称为离散格,分析了离散格与划分格之间的关系,证明了离散格是一个布尔代数,而划分格不是布尔代数,分析了一类离散化算法,指出这类算法的求解过程正是对离散格的搜索过程。更多还原

【Abstract】 This paper analyzes the discretization schemes of a given numeric information table, and constructs a discretization lattice with these schemes. We compare the partition lattice of the object set with the discretization lattice and find that, the latter is a Boolean Algebra while the former is not. Based on the indiscernibility relation on attribute set, we define a function from discretization lattice to the partition lattice. The insight into a class of discretization algorithms shows that they get the final discretized table by searching the discretization lattice.更多还原