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

计算机工程 ›› 2006, Vol. 32 ›› Issue (21): 12-14,5. doi: 10.3969/j.issn.1000-3428.2006.21.005

• 博士论文 • 上一篇    下一篇

一种基于关联规则挖掘的组织数据方法

孔令富,王 晗,练秋生   

  1. (燕山大学信息科学与工程学院,秦皇岛 066004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-11-05 发布日期:2006-11-05

Approach of Organization Data Based on Mining of Association Rules

KONG Lingfu, WANG Han, LIAN Qiusheng   

  1. (School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-11-05 Published:2006-11-05

摘要: 针对在数据挖掘中采用二进制转换的方法,定义了二进制序列集的相关概念并为此提供依据。分析了事务与关联规则在二进制序列集中的表示方法及其在空间、时间上的复杂度。通过实验验证,在关联规则数据挖掘中采用二进制序列集这一组织数据方法是有效且可行的。

关键词: 数据挖掘, 关联规则, 二进制序列集, 组织数据

Abstract: Aiming at the method of binary system conversion in data mining, this paper defines binary system sequences set and its related concepts. It analyzes the express method of affair and association rule in the binary system sequences set and complexity in space and time. And making an experiment on it, it proves that binary system sequences set is efficient and feasible as an approach of organization data based on mining of association rules.

Key words: Data mining, Association rules, Binary system sequences set, Organization data

中图分类号: