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
关键词
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 条
  • [21] Efficient Mining of Short Periodic High-Utility Itemsets
    Lin, Jerry Chun-Wei
    Zhang, Jiexiong
    Fournier-Viger, Philippe
    Hong, Tzung-Pei
    Chen, Chien-Ming
    Su, Ja-Hwung
    2016 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2016, : 3083 - 3088
  • [22] Efficient Mining of Uncertain Data for High-Utility Itemsets
    Lin, Jerry Chun-Wei
    Gan, Wensheng
    Fournier-Viger, Philippe
    Hong, Tzung-Pei
    Tseng, Vincent S.
    WEB-AGE INFORMATION MANAGEMENT, PT I, 2016, 9658 : 17 - 30
  • [23] Efficient mining of high utility itemsets from large datasets
    Erwin, Alva
    Gopalan, Raj P.
    Achuthan, N. R.
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 2008, 5012 : 554 - +
  • [24] Efficient algorithms for mining closed and maximal high utility itemsets
    Duong, Hai
    Hoang, Tien
    Tran, Thong
    Truong, Tin
    Le, Bac
    Fournier-Viger, Philippe
    KNOWLEDGE-BASED SYSTEMS, 2022, 257
  • [25] FTKHUIM: A Fast and Efficient Method for Mining Top-K High-Utility Itemsets
    Vu, Vinh V.
    Lam, Mi T. H.
    Duong, Thuy T. M.
    Manh, Ly T.
    Nguyen, Thuy T. T.
    Nguyen, Le V.
    Yun, Unil
    Snasel, Vaclav
    Vo, Bay
    IEEE ACCESS, 2023, 11 : 104789 - 104805
  • [26] An efficient algorithm to mine high average-utility itemsets
    Lin, Jerry Chun-Wei
    Li, Ting
    Fournier-Viger, Philippe
    Hong, Tzung-Pei
    Zhan, Justin
    Voznak, Miroslav
    ADVANCED ENGINEERING INFORMATICS, 2016, 30 (02) : 233 - 243
  • [27] An efficient method for mining High-Utility itemsets from unstable negative profit databases
    Tung, N. T.
    Nguyen, Trinh D. D.
    Nguyen, Loan T. T.
    Vo, Bay
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 237
  • [28] An efficient algorithm for Hiding High Utility Sequential Patterns
    Le, Bac (lhbac@fit.hcmus.edu.vn), 1600, Elsevier Inc. (95):
  • [29] An efficient algorithm for Hiding High Utility Sequential Patterns
    Bac Le
    Duy-Tai Dinh
    Van-Nam Huynh
    Quang-Minh Nguyen
    Fournier-Viger, Philippe
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2018, 95 : 77 - 92
  • [30] Efficient mining of high-utility itemsets using multiple minimum utility thresholds
    Lin, Jerry Chun-Wei
    Gan, Wensheng
    Fournier-Viger, Philippe
    Hong, Tzung-Pei
    Zhan, Justin
    KNOWLEDGE-BASED SYSTEMS, 2016, 113 : 100 - 115