Abstract

Privacy is very important in Data Mining. Association rule mining, is a important technique, has already been applied in a wide range of areas. Large databases cannot be secured by encryption or other techniques because of complexities. These security issues can be divided into two categories: data hiding and knowledge hiding. This paper deals with the problem of association rule mining which preserves the confidentiality of each database i.e. Knowledge hiding. Knowledge hiding is concerned with the sanitization of confidential knowledge from the data. There are many methods to solve this problem. The one, presented in the paper is called support-based and confidence-based blocking schemes. Apriori algorithm is used for mining rule from database. Knowledge hiding is achieved using ISL and DSR. The improvement over sensitive rule hiding is proposed to offer more accuracy and security with smaller negative impact. In ever changing business environment like enterprises e-businesses, the old fashioned disclosure and database inference protection techniques are not capable to ensure complete data privacy. Privacy is important for the on line disclosure of private information Organizations should be able to evaluate the risk of disclosing information and should adopt new more efficient approaches for information disclosure control, in order to maintain their competitive edge in the market. Not only the data but also the hidden knowledge in the data should be made secure. The sensitive information can be extracted in the form of association rules with association rule mining tools. But this can jeopardize the privacy of the customers. Some other rule could be very critical for the company itself such as buying patterns of very rich customers. For example, an Internet based company may give up selling hardware and may concentrate on selling books and videos. Therefore a rule relating the customer buying patterns of hardware may no longer be sensitive for that company. It is desirable to apply a trivial algorithm that hides data by deleting it randomly. Data Mining is the process of discovering new patterns from large data sets involving methods from statistics and artificial intelligence but also database management. Privacy has become an important issue in Data Mining. Many methods have been brought out to solve this problem. This paper focuses on the problem of association rule mining, which hides the knowledge from each database. This paper reviews the major method of knowledge hiding. Association rule mining, as a very important technique, has already been applied in a wide range of areas. Knowledge hiding is concerned with the sanitization of confidential knowledge from the data. As a result of association rule mining, many useful association rules will be discovered, but at the same time, many privacy rules will also be exposed which do not want others to know. To solve this, limit the mining process, in order to keep these sensitive rules being hidden. There are so many methods to solve this problem. The one that is covered in the paper is just one kind of them, called support-based and confidence-based blocking schemes. Algorithm used For Knowledge Hiding is ISL algorithm or DSR algorithm (2). The main disadvantage of a block in algorithm is the fact that the dataset, apart from the blocked values, is not distorted. Thus, an adversary can disclose the hidden rules by identifying those generating item sets that contain question marks and lead to rules with a maximum confidence that lies above the minimum confidence threshold. If the number of these rules is small then the probability of identifying the sensitive ones among them becomes high. To avoid this problem, a method for selectively removing individual values from a database is introduced to prevent the discovery of a set of rules, while preserving the data for other applications. The problem of building privacy preserving algorithms is considered for one category of data mining techniques, the association rule mining. New metrics is introduced in order to demonstrate how security issues can be taken into consideration in the general framework of association rule mining (1).

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call