AN INCREMENTAL ALGORITHM FOR MAINTAINING CONSTRAINED ASSOCIATION RULES

Mining of the association rules is an important issue in the data mining field.In the process of mining association rules,users may add constraints.In fact this has been a way for users to interact with mining process, During this process,constraints may be changed constantly and users always demand the update of the mining result according to the changed constraints. Aimed at this problem, an incremental algorithm, named Separate M , for maintaining constrained association rules is presented. It can use information from the last mining process and avoid running the Separate algorithm over again. In this way, the time can be shortened and the efficiency of data mining process can be improved.