Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Iqbal, Khalida | Yin, Xu-Chenga; * | Hao, Hong-Weib | Ilyas, Qazi Mudassarc | Yin, Xuwanga
Affiliations: [a] Department of Computer Science, School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China | [b] Institute of Automation, Chinese Academy of Sciences, Beijing, China | [c] College of Computer Sciences and Information Technology, King Faisal University, Saudi Arabia
Correspondence: [*] Corresponding author: Xu-Cheng Yin, Department of Computer Science, School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China. E-mail: xuchengyin@ustb.edu.cn.
Abstract: The rationale of XML design is to transfer and store data at different levels. A key feature of these levels in an XML document is to identify its components for additional processing. XML components can expose sensitive information after application of data mining techniques over a shared database. Therefore, privacy preservation of sensitive information must be ensured prior to signify the outcome especially in sensitive XML Association Rules. Privacy issues in XML domain are not exceptionally addressed to determine a solution by the academia in a reliable and precise manner. In this paper, we have proposed a model for identifying sensitive items (nodes) to declare sensitive XML association rules and then to hide them. Bayesian networks-based central tendency measures are applied in declaration of sensitive XML association rules. K2 algorithm is used to generate Bayesian networks to ensure reliability and accuracy in preserving privacy of XML Association Rules. The proposed model is tested and compared using several case studies and large UCI machine learning datasets. The experimental results show improved accuracy and reliability of proposed model without any side effects such as new rules and lost rules. The proposed model uses the same minimum support threshold to find XML Association Rules from the original and transformed data sources. The significance of the proposed model is to minimize an incredible disclosure risk involved in XML association rule mining from external parties in a competitive business environment.
Keywords: Privacy preservation, XML, Bayesian networks, sensitive information, sensitive XML association rules
DOI: 10.3233/IDA-140641
Journal: Intelligent Data Analysis, vol. 18, no. 2, pp. 281-303, 2014
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl