Constraint programming for perfect matching of item set mining

We show that how mining pattern can be used in constraint satisfaction environments. Incorporation ofmatching mining with constraint satisfaction is very flexible and causes optimum use and economy in modern systems.Thenew type of mining is compatible with the base constraint satisfaction algorithm (backtracking algorithm).Because theconstraint satisfaction’s problem are the framework with algorithms for solving of various problems ,so with convertingto constraint satisfaction problem’s framework, we have solved problems. The perfect matching of item set mining isthe type of mining that is combined graph theory with data mining systems and is very flexible with these systems.

کلیدواژه ها:

Mining ، Transaction ، BackTracking algorithms ، Bipartite Graph ، constraint Programming