基于二进制的挖掘算法在移动计算中的应用

为了减少移动计算中提取空间关系的计算代价,提出一种基于二进制的关联规则挖掘算法,适合于在移动计算中提取包含多个空间对象的关联.该算法采用自顶向下的搜索策略,利用二进制的逻辑运算产生频繁候选项和计算频繁候选项的支持数,大大地提高了算法的效率.该算法能够有效地用在移动计算中提高系统对用户的响应速度,特别是在挖掘长空间关联规则时,实验结果表明,该算法比现有算法更快速而有效.

Application of mining algorithm based on binary in mobile computing

In order to reduce computing cost of extracting spatial association in mobile computing, an algorithm of association rules mining based on binary is presented, which is suitable for extracting association that include more spatial objects. The algorithm adopts top-down search strategy and uses binary logical operation to generate frequent candidate items and compute support of frequent candidate items in order to efficiently improve the efficiency of algorithm. It is very efficient for the algorithm to improve speed of system response to user in mobile computing. Especially, when mining long sptial association rules, the experiment indicates that the algorithm is more fast and efficient than presented these algorithms.