Efficient algorithms for victim item selection in privacy-preserving utility mining
Authors:
- Shalini JangraSJShalini Jangra
- Durga ToshniwalDTDurga Toshniwal
- 1 March 2022
- journal article
- research article
- Published by Elsevier in Future Generation Computer Systems
- Vol. 128, 219-234
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A fast perturbation algorithm using tree structure for privacy preserving utility miningExpert Systems with Applications, 2015
- A GA-Based Approach to Hide Sensitive High Utility ItemsetsThe Scientific World Journal, 2014
- Efficiently Hiding Sensitive Itemsets with Transaction Deletion Based on Genetic AlgorithmsThe Scientific World Journal, 2014
- Reducing Side Effects of Hiding Sensitive Itemsets in Privacy Preserving Data MiningThe Scientific World Journal, 2014
- An efficient method for mining frequent itemsets with double constraintsEngineering Applications of Artificial Intelligence, 2014
- Using TF-IDF to hide sensitive itemsetsApplied Intelligence, 2012
- HHUIF and MSICF: Novel algorithms for privacy preserving utility miningExpert Systems with Applications, 2010
- A MaxMin approach for hiding frequent itemsetsData & Knowledge Engineering, 2008
- Dare to share: Protecting sensitive knowledge with data sanitizationDecision Support Systems, 2007
- Mining frequent patterns without candidate generationACM SIGMOD Record, 2000