| 基本概念格的关联规则挖掘算法 |
| |
| 引用本文： | 王旭,马垣.基本概念格的关联规则挖掘算法[J].鞍山科技大学学报,2006,29(1):50-53. |
| |
| 作者姓名： | 王旭 马垣 |
| |
| 作者单位： | 鞍山科技大学计算机科学与工程学院,辽宁鞍山114044 |
| |
| 摘 要： | 在已有的基于概念格的关联规则挖掘算法中，搜索频繁结点的范围太大，从而导致花费大量的时间来产生关联规则。针对这一不足，利用“索引链表”数据结构来辅助快速地找到所有的频繁结点，缩小了结点的搜索范围，降低了概念格中挖掘关联规则算法的复杂度。
|
| 关 键 词： | 形式背景 概念格 关联规则 |
| 文章编号： | 1672-4410（2006）01-0050-04 |
| 收稿时间： | 2005-05-11 |
| 修稿时间： | 2005年5月11日 |
Algorithm for tapping association rule based on concept lattice |
| |
| WANG Xu , MA Yuan.Algorithm for tapping association rule based on concept lattice[J].Journal of Anshan University of Science and Technology,2006,29(1):50-53. |
| |
| Authors: | WANG Xu MA Yuan |
| |
| Institution: | School of Computer Science and Engineering, Anshan University of Science and Technology, Anshan 114044, China |
| |
| Abstract: | Aimed at the deficiency of the algotithm for extracting association rule,"index linked list" was advanced and this new data structure was used to search for all frequent node fast,thus the range of searching for frequent node is reduced,and the computing complexity of the algorithm for extracting association rule based on concept lattice is reduced. |
| |
| Keywords: | formal context concept lattice association rule |
| 本文献已被 CNKI 维普 等数据库收录！ |
