DOUBLE CLUSTERING METHOD IN HIDING ASSOCIATION RULES

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.

KIANI ABARI ZAHRA; NADERI DEHKORDI MOHAMMAD

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER RESEARCH Year:2016 | Volume:7 | Issue:1 (23) Page(s): 67-87

Download Full-Text

View:

277

Download:

106

Cites:

Information Journal Paper

Title

DOUBLE CLUSTERING METHOD IN HIDING ASSOCIATION RULES

Author(s)

KIANI ABARI ZAHRA | NADERI DEHKORDI MOHAMMAD | Issue Writer Certificate

Keywords

DATA MINING

ASSOCIATION RULES

FREQUENT ITEM-SETS

PRIVACY PRESERVING DATA MINING

CLUSTERING

Abstract

Association rules are among important techniques in DATA MINING which are used for extracting hidden patterns and knowledge in large volumes of data. ASSOCIATION RULES help individuals and organizations take strategic decisions and improve their business processes. Extracted ASSOCIATION RULES from a database contain important and confidential information that if published, the privacy of individuals may be threatened. Therefore, the process of hiding sensitive ASSOCIATION RULES should be performed prior to sharing the database. This is done through changing the database transactions. These changes must be made in such a way that all sensitive ASSOCIATION RULES are hidden and a maximum number of non-sensitive ASSOCIATION RULES are extractable from the sanitized database. In fact, a balance is to be established between hiding the sensitive rules and extracting the non-sensitive rules. A new algorithm is presented in this paper to create a balance between preserving privacy and extracting knowledge. The items of sensitive rules are clustered in the proposed algorithm, in order to reduce changes. In fact, reduction of changes and CLUSTERING of rules are applied in order to reduce the side effects of the hiding process on non-sensitive rules.

Cites

No record.

References

No record.

Cite

APA: Copy

KIANI ABARI, ZAHRA, & NADERI DEHKORDI, MOHAMMAD. (2016). DOUBLE CLUSTERING METHOD IN HIDING ASSOCIATION RULES. JOURNAL OF ADVANCES IN COMPUTER RESEARCH, 7(1 (23)), 67-87. SID. https://sid.ir/paper/328828/en

Vancouver: Copy

KIANI ABARI ZAHRA, NADERI DEHKORDI MOHAMMAD. DOUBLE CLUSTERING METHOD IN HIDING ASSOCIATION RULES. JOURNAL OF ADVANCES IN COMPUTER RESEARCH[Internet]. 2016;7(1 (23)):67-87. Available from: https://sid.ir/paper/328828/en

IEEE: Copy

ZAHRA KIANI ABARI, and MOHAMMAD NADERI DEHKORDI, “DOUBLE CLUSTERING METHOD IN HIDING ASSOCIATION RULES,” JOURNAL OF ADVANCES IN COMPUTER RESEARCH, vol. 7, no. 1 (23), pp. 67–87, 2016, [Online]. Available: https://sid.ir/paper/328828/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops