Efficient Dual Space Search Algorithm for Mining Frequents

The paper presents an efficient dual space search algorithm for mining frequents.The algorithm takes full advantage of the duality characteristic in the transaction database via dual space mapping.The items dimension and transaction dimension in the transaction database are combined to increase the efficiency of mining frequents.It proves that dual space search algorithm is very efficient to mining frequents by way of experiment on the computer,new method is not sensitive to scale of data or the length of frequents.