期刊名称：International Journal of Computer Science and Network
印刷版ISSN：2277-5420
出版年度：2012
卷号：1
期号：3
出版社：IJCSN publisher
摘要：The security of the large database that contains certain crucialinformation, it will become a serious issue when sharing data to thenetwork against unauthorized access. Association rules hidingalgorithms get strong and efficient performance for protectingconfidential and crucial data. The objective of the proposedAssociation rule hiding algorithm for privacy preserving datamining is to hide certain information so that they cannot bediscovered through association rule mining algorithm. The mainapproached of association rule hiding algorithms to hide somegenerated association rules, by increase or decrease the support orthe confidence of the rules. The association rule items whether inLeft Hand Side (LHS) or Right Hand Side (RHS) of the generatedrule, that cannot be deduced through association rule miningalgorithms. The concept of Increase Support of Left Hand Side(ISL) algorithm is decrease the confidence of rule by increase thesupport value of LHS. It doesn’t work for both side of rule. Itworks only for modification of LHS. In this paper, we propose aheuristic algorithm named ISLRC (Increase Support of L.H.S. itemof Rule Clusters) based on ISL approach to preserve privacy forsensitive association rules in database. Proposed algorithmmodifies fewer transactions and hides many rules at a time. Theefficiency of the proposed algorithm is compared with ISLalgorithms
关键词：Data mining; ISL; Association Rule Hiding;Sensitivity; Clustering
