首页> 外文会议>International conference on information knowledge engineering >An Attribute-Oriented Induction Approach for Knowledge Discovery from Relational Databases
【24h】

An Attribute-Oriented Induction Approach for Knowledge Discovery from Relational Databases

机译:面向属性的关系数据库知识发现方法

获取原文

摘要

Attribute-Oriented Induction (AOI) is one of the most important algorithms for Data Mining, which contains a relational database and a concept hierarchy (concept tree) for each attribute, and its outputs are small relations that summarize the generalized characteristics of the task-relevant data. However the concept trees will vary in different classification standards, not to mention AOI can only deal with data types of single-valued attributes, therefore the requirement arises immediately- that is how to design a new classification algorithm to classify the multi-valued attributes. In addition, it would be time-consuming in processing data mining and data warehousing manually. In view of these weaknesses, this paper proposes a Modified AOI (MAOI) algorithm that converts the data to Boolean bit, uses K-map to converge the attributes, and finally, enables us to discover the generalized knowledge from Relational Databases.
机译:面向属性的归纳(AOI)是数据挖掘中最重要的算法之一,它包含一个关系数据库和每个属性的概念层次结构(概念树),其输出是小的关系,总结了任务的一般特征-相关数据。但是,概念树在不同的分类标准中会有所不同,更不用说AOI只能处理单值属性的数据类型,因此要求立即出现-即如何设计一种新的分类算法来对多值属性进行分类。另外,在手动处理数据挖掘和数据仓库方面将很耗时。鉴于这些缺点,本文提出了一种改进的AOI(MAOI)算法,该算法将数据转换为布尔位,使用K-map收敛属性,最后使我们能够从关系数据库中发现广义知识。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号