Hide Association Rules with Fewer Side Effects
نویسندگان
چکیده
منابع مشابه
Introducing an algorithm for use to hide sensitive association rules through perturb technique
Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. Hiding the as...
متن کاملan algorithm to hide sensitive association rules through perturb technique
due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. association rules mining is one of the data mining techniques to extract useful patterns in the form of association rules. one of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. hiding the as...
متن کاملUse HypE to Hide Association Rules by Adding Items
During business collaboration, partners may benefit through sharing data. People may use data mining tools to discover useful relationships from shared data. However, some relationships are sensitive to the data owners and they hope to conceal them before sharing. In this paper, we address this problem in forms of association rule hiding. A hiding method based on evolutionary multi-objective op...
متن کاملAssociation Rule Hiding by Heuristic Approach to Reduce Side Effects & Hide Multiple R.H.S. Items
Association rule mining is a powerful model of data mining used for finding hidden patterns in large databases. One of the great challenges of data mining is to protect the confidentiality of sensitive patterns when releasing database to third parties. Association rule hiding algorithms sanitize database such that certain sensitive association rules cannot be discovered through association rule...
متن کاملTranslation Rules with Right-Hand Side Lattices
In Corpus-Based Machine Translation, the search space of the translation candidates for a given input sentence is often defined by a set of (cyclefree) context-free grammar rules. This happens naturally in Syntax-Based Machine Translation and Hierarchical Phrase-Based Machine Translation (where the representation will be the set of the target-side half of the synchronous rules used to parse the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2015
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2014edp7345