earticle

논문검색

An Association Rule hiding Algorithm for Privacy Preserving Data Mining

초록

영어

Privacy preserving data mining is a research area concerned with the privacy driven from personally identifiable information when considered for data mining. This paper addresses the privacy problem by considering the privacy and algorithmic requirements simultaneously. The objective of this paper is to implement an association rule hiding algorithm for privacy preserving data mining which would be efficient in providing confidentiality and improve the performance at the time when the database stores and retrieves huge amount of data. This paper compares the performance of proposed algorithm with the two existing algorithms namely ISL and DSR.

목차

Abstract
 1. Introduction
 2. Data Blocking Method
 3. Types of Hiding Strategies
 4. Design of Association Rule Hiding Algorithm
 5. Simulation and Results
 6. Conclusion
 References

저자정보

  • K. Srinivasa Rao Department of Computer Science & Engineering, VFSTR University, Guntur, A.P, India
  • Venkata Naresh Mandhala Information Technology Department, VFSTR University, Vadlamudi-522213, Guntur, India
  • Debnath Bhattacharyya Department of Computer Application, RCC Institute of Information Technology, Kolkata-700015, India
  • Tai-hoon Kim Department of Convergence Security, Sungshin Women's University, 249-1, Dongseon-dong 3-ga, Seoul, 136-742, Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.