Association rule hiding using enhanced elephant herding optimization algorithm
| Autor: | M. Rajasekaran, M.S. Thanabal, A. Meenakshi |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2024 |
| Předmět: | |
| Zdroj: | Automatika, Vol 65, Iss 1, Pp 98-107 (2024) |
| Druh dokumentu: | article |
| ISSN: | 00051144 1848-3380 0005-1144 |
| DOI: | 10.1080/00051144.2023.2277998 |
| Popis: | Association rule hiding is an efficient solution that helps organizations to avoid the risk caused by sensitive knowledge leakage when sharing data in their collaborations. Cuckoo Optimization Algorithm (COA) sanitizes the transaction database but this method has limitation due to its slow convergence and exploitation capabilities. Hence in this paper, Enhanced Elephant Herding Optimization Algorithm for Association Rule Hiding (EEHOA4ARH) is proposed for association rule hiding. In EEHOA, two core functions such as clan updating operator and separating operator are used for association rule hiding that also realizes the fast convergence and exploitation capabilities. Moreover, the searching strategy in COA4ARH for the selection of best solution is highly time consuming. To reduce the time consumption for the selection of best solution, a Crowding Distance (CD) concept is combined with EEHOA4ARH. By continuously updating the best elephant and replacing the worst elephant in the population, EEHOA4ARH-CD sanitizes the transaction database effectively. Thus the proposed EEHOA4ARH achieves the less computation time, fast convergence and better exploitation capabilities by using crowding distance. The experimental results prove the effectiveness of the proposed EEHOA4ARH–CD method in terms of hiding failure, lost rule and execution time with 44.66 s. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|