.png){kind=icon}
返回
A new algorithm using integer programming relaxation for privacy-preserving in utility mining
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-023-04913-w.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
High-utility itemset mining (HUIM) is an effective technique for discovering significant information in data. However, data containing sensitive and private information may cause privacy concerns. Therefore, privacy preserving utility mining (PPUM) has recently become a critical research area. PPUM is the process of transforming a quantitative transactional database into a sanitised one, thus ensuring that utility mining algorithms cannot discover sensitive information. The sanitisation process can have several side effects, including the loss of non-sensitive information and the introduction of redundant information. Additionally, the running times of heuristic algorithms for sanitising data are high. To minimise negative effects and lower the execution time of the hiding process, we propose the G-ILP algorithm with a GPU parallel programming method for preprocessing and a new efficient constraint satisfaction problem for hiding data. The experimental evaluations of G-ILP show the algorithm's efficiency in terms of running time and its ability to minimise side effects in large datasets.
Keyword:
Privacy preserving
Data mining
Utility mining
Sanitization
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases动态数据库中基于pre-大型高效模式挖掘的高效事务删除方法
PREAI
分享收藏The effects of water-based insulation paint applied to laminate flooring panels on the thermal conductivity coefficient and adhesion resistance.png)
BioResources
OAAI
BioResourcesIF0
OAAI分享收藏A Multi-Core Approach to Efficiently Mining High-Utility Itemsets in Dynamic Profit DatabasesIEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容