Frequent Item Mining When Obtaining Support Is Costly

被引:0
|
作者
Lin, Joe Wing-Ho [1 ]
Wong, Raymond Chi-Wing [1 ]
机构
[1] Hong Kong Univ Sci & Technol, Kowloon, Hong Kong, Peoples R China
来源
BIG DATA ANALYTICS AND KNOWLEDGE DISCOVERY, DAWAK 2019 | 2019年 / 11708卷
关键词
Frequent item mining; Random sampling;
D O I
10.1007/978-3-030-27520-4_4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Suppose there are n users and m items, and the preference of each user for the items is revealed only upon probing, which takes time and is therefore costly. How can we quickly discover all the frequent items that are favored individually by at least a given number of users? This new problem not only has strong connections with several well-known problems, such as the frequent item mining problem, it also finds applications in fields such as sponsored search and marketing surveys. Unlike traditional frequent item mining, however, our problem assumes no prior knowledge of users' preferences, and thus obtaining the support of an item becomes costly. Although our problem can be settled naively by probing the preferences of all n users, the number of users is typically enormous, and each probing itself can also incur a prohibitive cost. We present a sampling algorithm that drastically reduces the number of users needed to probe to O(logm)-regardless of the number of users-as long as slight inaccuracy in the output is permitted. For reasonably sized input, our algorithm needs to probe only 0.5% of the users, whereas the naive approach needs to probe all of them.
引用
收藏
页码:37 / 56
页数:20
相关论文
共 50 条
  • [21] OPTIMIZATION AND REALIZATION OF PARALLEL FREQUENT ITEM SET MINING ALGORITHM
    Yuan, Ling
    Li, Dan
    Chen, Yuzhong
    PROCEEDINGS OF 2016 INTERNATIONAL CONFERENCE ON AUDIO, LANGUAGE AND IMAGE PROCESSING (ICALIP), 2016, : 546 - 551
  • [22] Method for Mining Frequent Item Sets Considering Average Utility
    Agarwal, Reshu
    Gautam, Arti
    Saksena, Ayush Kumar
    Rai, Amrita
    Karatangi, Shylaja VinayKumar
    2021 INTERNATIONAL CONFERENCE ON EMERGING SMART COMPUTING AND INFORMATICS (ESCI), 2021, : 275 - 278
  • [23] Design and Implementation of Improved Algorithm for Frequent Item Sets Mining
    Zhang Lin
    Zhang Jianli
    PROCEEDINGS OF 2012 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2012), 2012, : 1696 - 1698
  • [24] Algorithm of Frequent Item Sets Mining Based on Index Table
    Zhang Lin
    Yao Nanzhen
    Zhang Jianli
    MECHATRONICS, ROBOTICS AND AUTOMATION, PTS 1-3, 2013, 373-375 : 1076 - +
  • [25] Mining frequent pattern using item-transformation method
    Chu, TP
    Wu, F
    Chiang, SW
    FOURTH ANNUAL ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE, PROCEEDINGS, 2005, : 698 - 706
  • [26] Efficient Mining of Frequent Item Sets on Large Uncertain Databases
    Wang, Liang
    Cheung, David Wai-Lok
    Cheng, Reynold
    Lee, Sau Dan
    Yang, Xuan S.
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2012, 24 (12) : 2170 - 2183
  • [27] Algorithm for mining frequent itemsets with item constraint based on partition
    Chen, Hui-Ping
    Zhu, Feng
    Wang, Jian-Dong
    Zhou, Xiao-Qin
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2006, 28 (07): : 1082 - 1086
  • [28] Parallel algorithm for mining frequent item sets based on Spark
    Mao Y.
    Wu B.
    Xu C.
    Zhang M.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2023, 29 (04): : 1267 - 1283
  • [29] Mining Frequent Synchronous Patterns based on Item Cover Similarity
    Ezennaya-Gomez, Salatiel
    Borgelt, Christian
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2018, 11 (01) : 525 - 539
  • [30] Bi-directional Partitioning Approach to Frequent Item Mining
    Kadappa, Vijayakumar
    2017 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2017, : 2221 - 2224