摘要： 提出一种基于位处理技术的三维数据挖掘算法——BD-Peeler算法。该算法利用计算机每次处理32位数据的特性，将三维数据集按位存储，最大限度地提高每次运算处理数据集的数据量。实验结果表明，与Data-Peeler算法相比，该算法可以更快速有效地挖掘出三维数据集中的闭频繁项集。
关键词:
数据挖掘,
位运算,
三维,
约束,
闭频繁项集
Abstract: In order to quickly and effectively mine the 3D data set of the closed frequent itemsets, the paper proposes a data mining algorithm based on bitwise-based processing technology for 3D dataset——Bitwise-Data-Peeler(BD-Peeler). The algorithm makes the best use of the computer processing 32-bit data each time. The 3D data sets are stored by bits, so that it can increase the computational data each time in the 3D dataset. Experimental results show that it can quickly and efficiently mine the 3D data set of the closed frequent itemsets.
Key words:
data mining,
bitwise,
3D,
constraint,
closed frequent itemsets
中图分类号:
彭学武, 王黎明. 三维数据集中基于位运算的挖掘算法[J]. 计算机工程, 2011, 37(6): 61-64.
BANG Hua-Wu, WANG Li-Meng. Bitwise-based Mining Algorithm in 3D Dataset[J]. Computer Engineering, 2011, 37(6): 61-64.