Author(s)

Khalid Iqbal, Dr. Sohail Asghar, Dr. Abdulrehman Mirza

.

In the privacy preservation of association rules, sensitivity analysis should be reported after the quantification of items in terms of their occurrence. The traditional methodologies, used for preserving confidentiality of association rules, are based on the assumptions while safeguarding susceptible information rather than recognition of insightful items. Therefore, it is time to go one step ahead in order to remove such assumptions in the protection of responsive information especially in XML association rule mining. Thus, we focus on this central and highly researched area in terms of generating XML association rule mining without arguing on the disclosure risks involvement in such mining process. Hence, we described the identification of susceptible items in order to hide the confidential information through a supervised learning technique. These susceptible items show the high dependency on other items that are measured in terms of statistical significance with Bayesian Network. Thus, we proposed two methodologies based on items probabilistic occurrence and mode of items. Additionally, all this information is modeled and named PPDM (Privacy Preservation in Data Mining) model for XARs. Furthermore, the PPDM model is helpful for sharing markets information among competitors with a lower chance of generating monopoly. Finally, PPDM model introduces great accuracy in computing sensitivity of items and opens new dimensions to the academia for the standardization of such NP-hard problems.

XML Document, Association Rules, Bayesian Network, PPDM Model, NP-Hard, K2 Algorithm

K. Iqbal, D. Asghar and D. Mirza, "Hiding Sensitive XML Association Rules With Supervised Learning Technique," Intelligent Information Management, Vol. 3 No. 6, 2011, pp. 219-229. doi: 10.4236/iim.2011.36027.