Abstract:
When mining long frequent neighboring class sets to meet user demand in mobile computing,in order to avoid creating redundancy candidate and reduce repeated calculated amount,this paper proposes an algorithm of constraint frequent neighboring class sets mining based on Power set number decreasing,which can extract long frequent neighboring class sets with constraint condition.The algorithm uses Power set decreasing sequence to create candidate frequent neighboring class sets,and deletes efficiently redundancy candidate to not meet user demand,and reduces these calculated amount of repeated scanning spatial instance.The experiment indicates that the algorithm is faster than present algorithm when mining long frequent neighboring class sets to meet user demand.