作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (14): 41-42,4. doi: 10.3969/j.issn.1000-3428.2007.14.014

• 软件技术与数据库 • 上一篇    下一篇

数据分类中的粒度计算

高平安1,3,蔡自兴3,蒙祖强2   

  1. (1. 湘潭大学计算机科学系,湘潭 411105;2. 广西大学计算机与电子信息学院,南宁 530004; 3. 中南大学信息科学与工程学院,长沙 410083)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-07-20 发布日期:2007-07-20

Granularity Computation in Data Classification

GAO Ping′an1,3, CAI Zixing3, MENG Zuqiang2   

  1. (1. Department of Computer Science, Xiangtan University, Xiangtan 411105; 2. College of Computer & Electronics Information, Guangxi University, Nanning 530004; 3. School of Information Science & Engineering, Central South University, Changsha 410083)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-07-20 Published:2007-07-20

摘要: 粒度计算理论为知识发现的研究提供了新的理论工具,通过引入全粒度空间的概念,对信息系统的论域空间进行等价划分,给出了论域子空间可精确粒度表示的充分条件,建立了目标概念的外延和内涵的粒度计算关系,揭示了目标概念学习中的粒度计算过程,提出了一种新的数据分类模型。

关键词: 粒度计算, 全粒度空间, 数据分类, 目标概念

Abstract: The problem of dada classification is a fundamental issue in KDD. There are still many open theoretical problems such as modeling for data classification. Granular computation theory offers a proper new theoretical basis for KDD. In fact, the process of constructing the connotation of a concept from its extension can be considered as a granularity computation process. This paper proposes a novel granularity representation method to study the problem of data classification in KDD and a novel data classification model.

Key words: granularity computation, complete granularity space, data classification, object concept

中图分类号: