| 基于SQL的决策树算法 |
| |
| 引用本文： | 颜治平,魏红宁.基于SQL的决策树算法[J].计算机与数字工程,2007,35(7):23-26. |
| |
| 作者姓名： | 颜治平 魏红宁 |
| |
| 作者单位： | 1. 西南交通大学校办,成都610031
2. 西南交通大学信息网络中心,成都610031 |
| |
| 摘 要： | 将数据挖掘集成到关系数据库中,可以使数据挖掘技术直接利用关系数据库中的数据生成挖掘模型.以决策树技术为研究实例,通过把决策树算法重新设计为基于SQL的汇总和查询分析操作,提出一种新的基于SQL的决策树算法.同时,通过理论分析表明,在L/O性能方面,文中算法比SPRINT算法要好.
|
| 关 键 词： | 数据挖掘 关系数据库 决策树 SQL |
| 修稿时间： | 2007年1月8日 |
Decision Tree Alorithm Based on Relational Database SQL |
| |
| Yan Zhiping,Wei Hongning.Decision Tree Alorithm Based on Relational Database SQL[J].Computer and Digital Engineering,2007,35(7):23-26. |
| |
| Authors: | Yan Zhiping Wei Hongning |
| |
| Affiliation: | by Yan Zhiping |
| |
| Abstract: | The integration of data mining with relational database systems can make it easy to work directly on relational data. Taking decision tree technique for example, a new decsion tree approach based on SQL was proposed through rephrasing decision tree algorithm as a relational database problem of summarization and query. Based on the theoretic analysis of the I/O complexity of the new way, we can know that the new way is clearly better than SPRINT in terms of I/O performance. |
| |
| Keywords: | data mining relational database decision tree sql |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
