Frequent Patterns Mining Algorithm Based on IRST

An important subject of data mining is association rules mining, of which the first step is to generate frequent patterns. A lot of traditional algorithms need candidate items to generate frequent patterns, so they are inefficient. In this paper, a mining algorithm which does not generate candidate items is put forward. It is based on inter-relevant successive trees. Experiments show it is efficient.