A heuristic algorithm for quick hiding of association rules
سال انتشار: 1393
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 555
فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
این مقاله در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_ACSIJ-4-1_003
تاریخ نمایه سازی: 9 اسفند 1393
چکیده مقاله:
Increasing use of data mining process and extracting of association rules caused the introduction of privacy preserving in data mining. A complete publication of the database isinconsistent with security policies and it would result in disclosure of some sensitive data after performing data mining.Individuals and organizations should secure the database before the publication, because if they neglect this issue they will be harmed. The owners of database consider factors such asdatabase size, precision in immunization and velocity in choosing the right approach in order to hide the associationrules. Besides the large volume of data and precision in immunization, we should optimize the time of operation and this is one of the issues that has received a little attention. Inthis paper, FHA algorithm is introduced for hiding sensitive patterns. In this algorithm, it is being tried to reduce theoverload of ordering transactions by decreasing database scans. Also, we have reduced the side effects by selecting theappropriate item for performing the modifications. Conductedexperiments indicate the execution of this algorithm in appropriate hiding of sensitive association rules.
کلیدواژه ها:
نویسندگان
Maryam Fouladfar
Department of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Iran
Mohammad Naderi Dehkordi
Department of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Iran