Volume 7, Issue 4 (12-2015)                   2015, 7(4): 65-80 | Back to browse issues page

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Behbahani O S, Pedram M M, Badie K, Rahbarinia B. EMOSS: An Efficient Algorithm to Hide Sequential Patterns . International Journal of Information and Communication Technology Research 2015; 7 (4) :65-80
URL: http://ijict.itrc.ac.ir/article-1-84-en.html
Abstract:   (2521 Views)
Nowadays data mining is the way of extracting hidden knowledge from raw data whereas sequence mining aims to find sequential patterns that are frequent in the database, so publishing these data may lead to the disclosure of private information about organizations or individuals. Knowledge hiding is the process of hiding sensitive knowledge extracted previously from the database, to ensure that no abuse will be caused. This paper addresses the problem of sequential pattern hiding and proposes an efficient algorithm which uses a multi-objective approach to overcome the problem of sequence hiding as well as maintaining database fidelity as much as possible. It also shows that the proposed algorithm outperforms existing methods in terms of both speed and memory usage.
Full-Text [PDF 1458 kb]   (1317 Downloads)    
Type of Study: Research | Subject: Information Technology

Add your comments about this article : Your username or Email:
CAPTCHA

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.