کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
508907 | 865460 | 2013 | 9 صفحه PDF | دانلود رایگان |

• Introduced the association rule hiding applied in risk management of retail supply chain collaboration.
• Introduced the intersection lattice concepts and their applicability in association rule hiding problem.
• Proposed a new approach for association rule hiding based on intersection lattice of frequent itemsets.
• A new heuristic algorithm was proposed for hiding a specific set of sensitive association rules.
• A real experiment was provided to clarify the performance of the proposed algorithm.
Association rule hiding is an efficient solution that helps enterprises avoid the risk caused by sensitive knowledge leakage when sharing data in their collaborations. This study examines how data sharing has the potential to create risk for enterprises in retail supply chain collaboration and proposes a new algorithm to remove sensitive knowledge from the released database based on the intersection lattice of frequent itemsets. The proposed algorithm specifies the victim item such that the modification of this item causes the least impact on frequent itemsets and the non-sensitive association rule. In the experiment described in this paper, this algorithm is used in risk avoidance for a retailer sharing data in retail supply chain collaboration. The results indicate that our approach is applicable in a real context and outperforms previous mechanisms.
Journal: Computers in Industry - Volume 64, Issue 7, September 2013, Pages 776–784