Three algorithms using a new GI-dic structure hide all sensitive cross-level high-utility itemsets in taxonomic databases without creating artificial patterns.
Efficient mining of top-k cross-level high utility itemsets, in: International Conference on Future Data and Security Engineering, Springer
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Cross-level Privacy Preserving Utility Mining
Three algorithms using a new GI-dic structure hide all sensitive cross-level high-utility itemsets in taxonomic databases without creating artificial patterns.