摘要：

提出一种基于位置索引思想的算法，通过IMFI矩阵，在当前候选项集合包含的项中保存其下一次出现时的位置编号，从而实现频繁模式发现的跨越式搜索。实验结果表明，与布尔矩阵挖掘算法相比，该算法极大减少了访问的事务量，具有更高的挖掘效率。

关键词: 数据挖掘, 关联规则, 位置索引矩阵

Abstract:

A new algorithm based on address index called NABOAI is put forward. By using IMFI matrix, it saves the order when the item next appears in the current item which belongs to current candidate item so as to achieve the spanning type search for frequent pattern. Experimental results show that, compared with Boolean matrix algorithm, the new algorithm reduces the access of transaction greatly.

Key words: data mining, association rules, position index matrix

中图分类号: 

• TP311.52