Welcome to the InfoSci Platform
Reference Hub4
Balanced Approach for Hiding Sensitive Association Rules in Data Sharing Environment

Balanced Approach for Hiding Sensitive Association Rules in Data Sharing Environment

Janakiramaiah Bonam, Ramamohan Reddy
Copyright: © 2014 |Volume: 8 |Issue: 3 |Pages: 24
ISSN: 1930-1650|EISSN: 1930-1669|EISBN13: 9781466655010|DOI: 10.4018/IJISP.2014070103
Cite Article Cite Article

MLA

Bonam, Janakiramaiah, and Ramamohan Reddy. "Balanced Approach for Hiding Sensitive Association Rules in Data Sharing Environment." IJISP vol.8, no.3 2014: pp.39-62. http://doi.org/10.4018/IJISP.2014070103

APA

Bonam, J. & Reddy, R. (2014). Balanced Approach for Hiding Sensitive Association Rules in Data Sharing Environment. International Journal of Information Security and Privacy (IJISP), 8(3), 39-62. http://doi.org/10.4018/IJISP.2014070103

Chicago

Bonam, Janakiramaiah, and Ramamohan Reddy. "Balanced Approach for Hiding Sensitive Association Rules in Data Sharing Environment," International Journal of Information Security and Privacy (IJISP) 8, no.3: 39-62. http://doi.org/10.4018/IJISP.2014070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Privacy preserving association rule mining protects the sensitive association rules specified by the owner of the data by sanitizing the original database so that the sensitive rules are hidden. In this paper, the authors study a problem of hiding sensitive association rules by carefully modifying the transactions in the database. The algorithm BHPSP calculates the impact factor of items in the sensitive association rules. Then it selects a rule which contains an item with minimum impact factor. The algorithm alters the transactions of the database to hide the sensitive association rule by reducing the loss of other non-sensitive association rules. The quality of a database can be well maintained by greedily selecting the alterations in the database with negligible side effects. The BHPSP algorithm is experimentally compared with a HCSRIL algorithm with respect to the performance measures misses cost and difference between original and sanitized databases. Experimental results are also mentioned demonstrating the effectiveness of the proposed approach.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.