Ming sequential associations is becoming increasing essential in many scientific and commercial domains.Developing parallel algorithm becomes quite challenging
Frequent pattern mining plays an essential role in many important data mining tasks. FP-growth is a veryefficient algorithm for frequent pattern mining. However
Data mining in incomplete information systems is a hard problem but inevitable in uncertain decision. In thispaper ,an extended rough set model based on dominan