PRIVACY PRESERVING BIG DATA MINING: ASSOCIATION RULE HIDING

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

AFZALI GOLNAR ASSADAT; MOHAMMADI SHAHRIAR

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Information Systems and Telecommunication Year:2016 | Volume:4 | Issue:2 Page(s): 70-77

Download Full-Text

View:

565

Download:

238

Cites:

Information Journal Paper

Title

PRIVACY PRESERVING BIG DATA MINING: ASSOCIATION RULE HIDING

Author(s)

AFZALI GOLNAR ASSADAT | MOHAMMADI SHAHRIAR | Issue Writer Certificate

Keywords

BIG DATA

ASSOCIATION RULE

PRIVACY PRESERVING

ANONYMIZATION

DATA MINING

Abstract

Data repositories contain sensitive information which must be protected from unauthorized access. Existing DATA MINING techniques can be considered as a privacy threat to sensitive data. ASSOCIATION RULE mining is one of the utmost DATA MINING techniques which tries to cover relationships between seemingly unrelated data in a data base.. ASSOCIATION RULE hiding is a research area in PRIVACY PRESERVING DATA MINING (PPDM) which addresses a solution for hiding sensitive rules within the data problem. Many researches have be done in this area, but most of them focus on reducing undesired side effect of deleting sensitive ASSOCIATION RULEs in static databases. However, in the age of BIG DATA, we confront with dynamic data bases with new data entrance at any time. So, most of existing techniques would not be practical and must be updated in order to be appropriate for these huge volume data bases. In this paper, data ANONYMIZATION technique is used for ASSOCIATION RULE hiding, while parallelization and scalability features are also embedded in the proposed model, in order to speed up BIG DATA mining process. In this way, instead of removing some instances of an existing important ASSOCIATION RULE, generalization is used to anonymize items in appropriate level. So, if necessary, we can update important ASSOCIATION RULEs based on the new data entrances. We have conducted some experiments using three datasets in order to evaluate performance of the proposed model in comparison with Max-Min2 and HSCRIL. Experimental results show that the information loss of the proposed model is less than existing researches in this area and this model can be executed in a parallel manner for less execution time.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

AFZALI, GOLNAR ASSADAT, & MOHAMMADI, SHAHRIAR. (2016). PRIVACY PRESERVING BIG DATA MINING: ASSOCIATION RULE HIDING. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), 4(2), 70-77. SID. https://sid.ir/paper/332703/en

Vancouver: Copy

AFZALI GOLNAR ASSADAT, MOHAMMADI SHAHRIAR. PRIVACY PRESERVING BIG DATA MINING: ASSOCIATION RULE HIDING. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST)[Internet]. 2016;4(2):70-77. Available from: https://sid.ir/paper/332703/en

IEEE: Copy

GOLNAR ASSADAT AFZALI, and SHAHRIAR MOHAMMADI, “PRIVACY PRESERVING BIG DATA MINING: ASSOCIATION RULE HIDING,” JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), vol. 4, no. 2, pp. 70–77, 2016, [Online]. Available: https://sid.ir/paper/332703/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops