期刊文献+

基于滑动窗口的数据流高效用模糊项集挖掘

High Utility Fuzzy Itemsets Mining Over Data Stream Based on Sliding Window Model
下载PDF
导出
摘要 高效用项集挖掘可以提供有趣的结果集,但并不能提供单个项的数量,因此,本文提出了高效用模糊项集.但是,现实世界的数据是不断出现的,需要实时处理新到来的数据.为解决当前高效用模糊项集不能处理数据流的问题,又提出了模糊效用列表(fuzzy utility list,FUL)结构用于存储当前窗口中项的批次号、项在事务中的事务标识符、项的模糊效用以及项的剩余模糊效用,该结构能有效的对批次进行插入和删除操作.最后,基于FUL提出了数据流高效用模糊项集挖掘算法.对真实数据集和合成数据集进行了广泛的实验,结果证实了算法的效率及可行性. High-utility itemsets mining(HUI)can provide interesting itemsets,but cannot provide information on the number of items.Therefore,high utility fuzzy itemsets are proposed.However,real-world data is constantly emerging.Thus,new incoming data needs to be processed in real time.To solve the problem that the current high utility fuzzy itemsets cannot handle the data stream,a fuzzy utility list(FUL)structure is proposed to store the information of items,including batch number of items,the transaction identifier of the items,the fuzzy utility of items,and the reminding fuzzy utility of items.FUL can effectively insert and delete batches.Finally,based on FUL,a high utility fuzzy itemset mining algorithm on data stream is proposed,extensive experiments on real and synthetic datasets show the efficiency and feasibility of the algorithm.
作者 单芝慧 韩萌 韩强 Shan Zhihui;Han Meng;Han Qiang(School of Computer Science and Engineering,North Minzu University,Yinchuan 750021,China;The Key Laboratory of Images&Graphics Intelligent Processing of State Ethnic Affairs Commission,North Minzu University,Yinchuan 750021,China)
出处 《南京师大学报(自然科学版)》 CAS 北大核心 2023年第1期120-129,共10页 Journal of Nanjing Normal University(Natural Science Edition)
基金 国家自然科学基金项目(62062004、61862001) 宁夏自然科学基金项目(2020AAC03216)。
关键词 数据流挖掘 滑动窗口 高效用项集挖掘 模糊效用 效用列表 data stream mining sliding window high utility itemsets mining fuzzy utility utility list
  • 相关文献

参考文献6

二级参考文献68

  • 1Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases. In: Bocca J B, Jarke M, Zaniolo C. The 20th International Conference on Very Large Data Bases. San Francisco: Morgan Kaufmann, 1994: 487-499.
  • 2Liu Y, Liao W K, Choudhary A N. A two-phase algorithm for fast discovery of high utility itemsets. In: Ho T B, Cheung D W L, Liu H. The 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining. Berlin: Springer, 2005: 689-695.
  • 3Lan G C, Hong T P, Tseng V S. An efficient projection-based indexing approach for mining high utility itemsets. Knowledge and Information Systems, 2014, 38(1): 85-107.
  • 4Yao H, Hamilton H J, Butz C J. A foundational approach to mining itemset utilities from databases. In: Berry M W, Dayal U, Kamath C, et al. The 4th SIAM International Conference on Data Mining. Philadelphia: SIAM Press, 2004, 482-486.
  • 5Yao H, Hamilton H J. Mining itemset utilities from transaction databases. Data & Knowledge Engineering, 2006, 59(3): 603-626.
  • 6Li Y C, Yeh J S, Chang C C. Isolated items discarding strategy for discovering high utility itemsets. Data & Knowledge Engineering, 2008, 64(1): 198-217.
  • 7Han J, Pei J, Yin Y, et al. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 2004, 8(1): 53-87.
  • 8Tseng V S, Wu CW, Shie BE, et al. UP-growth: An efficient algorithm for high utility itemset mining. In: Rao B, Krishnapuram B, Tomkins A, et al. The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM Press, 2010, 253-262.
  • 9Tseng V S, Shie B E, Wu C W, et al. Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Transactions on Knowledge and Data Engineering, 2013, 25(8): 1772-1786.
  • 10Ahmed C F, Tanbeer S K, Jeong B-S, et al. Efficient tree structures for high utility pattern mining in incremental databases. IEEE Transactions on Knowledge and Data Engineering, 2009, 21(12): 1708-1721.

共引文献56

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部