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

›› 2005, Vol. 31 ›› Issue (07): 102-104.

• 论文 • 上一篇    下一篇

一种可伸缩的空间决策树分类挖掘算法

赵秦怡,王丽珍,顾应龙   

  1. 云南大学信息学院计算机科学与工程系,云南大学信息学院计算机科学与工程系,云南大学信息学院计算机科学与工程系 昆明 650091
  • 发布日期:2005-04-15

Flexible Algorithm About Spatial Decision Tree Classification

ZHAO Qinyi, WANG Lizhen, GU Yinglong   

  1. (Department of Computer Science and Engineering,College of Information,Yunnan University,Kunming 650091)
  • Published:2005-04-15

摘要: 提出了一个伸缩性好的空间决策树分类算法,在分类时既考虑待分类对象的非空间属性,又考虑其空间邻接对象的属性对其分类的影响。该算法没有训练数据库需存储于内存的限制,对训练库也没有记录个数及属性个数的限制,能生成简练、精确的决策树。

关键词: 空间分类挖掘, 算法的可伸缩性, 属性列表, 决策树分类

Abstract: A flexible spatial decision tree classification algorithm is proposed. This algorithm takes not only attributes of classifying object but also attributes of their neighbor objects into account whileclassifying spatial objects. Having no restriction of main memory and record number and attribute number of training database, the algorithm can output practice and accurate decision tree.

中图分类号: