International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 39 - Number 13 |
Year of Publication: 2012 |
Authors: N. V. Muthu Lakshmi, K. Sandhya Rani |
10.5120/4883-7321 |
N. V. Muthu Lakshmi, K. Sandhya Rani . Privacy Preserving Association Rule Mining in Vertically Partitioned Databases. International Journal of Computer Applications. 39, 13 ( February 2012), 29-35. DOI=10.5120/4883-7321
Data mining techniques are useful to discover hidden patterns from the large databases. Association rule mining is one of the important data mining techniques to discover relationships between items or item sets. In many organizations the database may exist in centralized or in distributed environment. In distributed environment, database may be partitioned in different ways such as horizontally partitioned, vertically partitioned and mixed mode which consists of both horizontal and vertical partitioning methods. The sites in the distributed environment interested to find association rules by participating themselves in the mining process without disclosing their individual private data/information. In this paper, a new model is proposed to find association rules by satisfying the privacy constraints for vertically partitioned databases at n number of sites along with data miner. This model adopts cryptography techniques such as encryption, decryption techniques and scalar product technique to find association rules efficiently and securely for vertically partitioned databases.