Algorithm for Hiding High Utility Sensitive Association Rule Based on Intersection Lattice
| Autor: | Hai Le Quoc, Vy Huynh Trieu, Nguyen Nguyen Si, Chau Truong Ngoc |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Association rule learning
Computer science business.industry 020204 information systems Lattice (order) 0202 electrical engineering electronic engineering information engineering Information technology 020201 artificial intelligence & image processing 02 engineering and technology business Database transaction Algorithm |
| Zdroj: | MAPR |
| Popis: | Hiding high utility sensitive association rule is an essential problem for preserving privacy knowledge from being revealed while sharing data outside the parties. However, this problem has not been considered thoughtfully. This paper aims to propose a novel strategy for hiding high utility sensitive association rules based on intersection lattice. The strategy includes two steps: (i) The transactions containing the sensitive rule and having the least utility are selected as victim transactions; (ii) The victim items are specified based on a heuristic in such a way that modifying them causes the least impact on lattice of high transaction weighted utility itemsets. Relying on those steps, the algorithm named HHUARL for hiding high utility sensitive association rules is proposed. The expriment shows that side effects caused by HHUARL algorithm is acceptable. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|