Abstract:

Both incremental and negative incremental field are discussed aiming at the problem of mining association rules effectively.It is suggested that the problem of change of minimum support can be transformed to the problem of updating database.The crossing lists are used to storage all frequent items and their supports in both the original and the changed database.After analyzing the relation between s₁,s₂ and s₀,whether an item is frequent or not can be figured out.By this method,the I＼O time is largely reduced,and the efficiency of mining association rules has been improved.Finally,the emulation experiment verifies its effectiveness.

Key words: mining association rules;updating effectively;crossing list;frequent item