Computer Vision Conference (CVC) 2026
21-22 May 2026
Publication Links
IJACSA
Special Issues
Computer Vision Conference (CVC)
Computing Conference
Intelligent Systems Conference (IntelliSys)
Future Technologies Conference (FTC)
International Journal of Advanced Computer Science and Applications(IJACSA), Volume 16 Issue 11, 2025.
Abstract: Frequent itemset mining is a widely adopted data mining technique. The application of the technique can be found in transaction database analysis, such as exploring a set of purchased items. Presently, the growing concern of privacy protection and security issues in society leads the business parties to be more careful in handling their database, since various information can be extracted from the database including the sensitive information. Therefore, database owner should take measure to minimize sensitive information leak during the data mining process. A hiding sensitive frequent itemset algorithm can be adopted to achieve that. However, it is remain a challenge to design a data hiding algorithm that not only successfully hiding frequent sensitive itemset but also minimize the side effects such as item loss, the appearance of artificial frequent itemset and misses cost. In this paper, a method namely D-LSwap that based on item swapping technique is proposed to cope the issue while minimizing those side effects. Initially D-LSwap inspect each transaction in the database to determine whether a transaction is sensitive. Following that, it select a sensitive transaction from the previous process and create a pair of transactions from them. The pair is formed by incorporating Damerau-levensthein string similarity. The next step is selecting items from this pair for the swapping process. Experiment results indicate that the proposed method outperforms several existing algorithms by increasing data utility up to 10%, while minimizing the number of item loss more than 10 times lower than that of the baseline methods.
Fatah Yasin Al Irsyadi, Dedi Gunawan, Diah Priyawati and Wardah Yuspin. “A String-Similarity-Oriented Item Swapping Algorithm for Protecting Sensitive Frequent Itemsets in Transaction Databases”. International Journal of Advanced Computer Science and Applications (IJACSA) 16.11 (2025). http://dx.doi.org/10.14569/IJACSA.2025.01611100
@article{Irsyadi2025,
title = {A String-Similarity-Oriented Item Swapping Algorithm for Protecting Sensitive Frequent Itemsets in Transaction Databases},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2025.01611100},
url = {http://dx.doi.org/10.14569/IJACSA.2025.01611100},
year = {2025},
publisher = {The Science and Information Organization},
volume = {16},
number = {11},
author = {Fatah Yasin Al Irsyadi and Dedi Gunawan and Diah Priyawati and Wardah Yuspin}
}
Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.