An Efficient Method for Hiding High Utility Itemsets

被引：1

作者：

Bay Vo ^{[1
]}

Lin, Chun-Wei ^{[2
]}

Hong, Tzung-Pei ^{[3
]}

Vu, Vinh V. ^{[4
]}

Minh Nguyen ^{[5
]}

Bac Le ^{[6
]}

机构：

[1] Informat Technol Coll, 12 Trinh Dinh Thao, Tan Phu, Ho Chi Minh, Vietnam

[2] Harbin Inst Technol, Shenzhen Grad Sch, Sch Comp Sci & Technol, Innovat Informat Ind Res Ctr, Harbin, Peoples R China

[3] Natl Univ Kaohsiung, Dept CSIE, Kaohsiung, Taiwan

[4] Univ Food Ind, Ho Chi Minh City, Vietnam

[5] Inst Informat Technol, Ho Chi Minh City, Vietnam

[6] Univ Sci, Ho Chi Minh City, Vietnam

来源：

ADVANCED METHODS AND TECHNOLOGIES FOR AGENT AND MULTI-AGENT SYSTEMS | 2013年 / 252卷

关键词：

data mining; high utility itemset; privacy preserving; utility; DISCOVERY;

D O I：

10.3233/978-1-61499-254-7-356

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper proposes an algorithm to hide quickly high utility sensitive itemsets. To reduce the execution time, when an item from the sensitive itemset is selected, the rated value is calculated from each transaction containing this item and all values which need be hidden are modified at the same time. Experimental results show that the proposed algorithm improves significantly the runtime.

引用

页码：356 / 363

页数：8

共 50 条

[41] An efficient biobjective evolutionary algorithm for mining frequent and high utility itemsets
Fang, Wei
Li, Chongyang
Zhang, Qiang
Zhang, Xin
Lin, Jerry Chun-Wei
APPLIED SOFT COMPUTING, 2023, 140
[42] An efficient fast algorithm for discovering closed+ high utility itemsets
Sahoo, Jayakrushna
Das, Ashok Kumar
Goswami, A.
APPLIED INTELLIGENCE, 2016, 45 (01) : 44 - 74
[43] Efficient Algorithms for Mining Top-K High Utility Itemsets
Tseng, Vincent S.
Wu, Cheng-Wei
Fournier-Viger, Philippe
Yu, Philip S.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (01) : 54 - 67
[44] HIGH UTILITY ITEMSETS MINING
Liu, Ying
Li, Jianwei
Liao, Wei-Keng
Choudhary, Alok
Shi, Yong
INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MAKING, 2010, 9 (06) : 905 - 934
[45] Efficient Algorithms for Mining the Concise and Lossless Representation of High Utility Itemsets
Tseng, Vincent S.
Wu, Cheng-Wei
Fournier-Viger, Philippe
Yu, Philip S.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (03) : 726 - 739
[46] An Efficient Algorithm for Extracting High Utility Itemsets from Weblog Data
Bakariya, Brijesh
Thakur, G. S.
IETE TECHNICAL REVIEW, 2015, 32 (02) : 151 - 160
[47] An efficient fast algorithm for discovering closed+ high utility itemsets
Jayakrushna Sahoo
Ashok Kumar Das
A. Goswami
Applied Intelligence, 2016, 45 : 44 - 74
[48] EHNL: An efficient algorithm for mining high utility itemsets with negative utility value and length constraints
Singh, Kuldeep
Kumar, Ajay
Singh, Shashank Sheshar
Shakya, Harish Kumar
Biswas, Bhaskar
INFORMATION SCIENCES, 2019, 484 : 44 - 70
[49] More Efficient Algorithms for Mining High-Utility Itemsets with Multiple Minimum Utility Thresholds
Gan, Wensheng
Lin, Jerry Chun-Wei
Fournier-Viger, Philippe
Chao, Han-Chieh
DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2016, PT I, 2016, 9827 : 71 - 87
[50] Binary partition for itemsets expansion in mining high utility itemsets
Song, Wei
Wang, Chunhua
Li, Jinhong
INTELLIGENT DATA ANALYSIS, 2016, 20 (04) : 915 - 931

← 1 2 3 4 5 →