Fast Single Pbase Algoritbm for Utility Mining in Big Data
Most of the latest works on utility mining generates a huge number of candidates in dealing with big data,which suffers from the scalability issue.Some work does not generate candidates,but suffers from the efficiency issue due to lack of strong pruning and high computation overhead.A novel algorith...
Saved in:
| Main Authors: | Junqiang Liu, Qingfeng Zhou, Wenhui Wang, Lei Shi |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2015-04-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2015100/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Memory-optimized distributed utility mining for big data
by: Sunil kumar, et al.
Published: (2022-09-01) -
Theoretical Properties of Closed Frequent Itemsets in Frequent Pattern Mining
by: Huina Zhang, et al.
Published: (2025-05-01) -
An Efficient Approach to Mining Maximal Contiguous Frequent Patterns from Large DNA Sequence Databases
by: Md. Rezaul Karim, et al.
Published: (2012-03-01) -
Survey of differential privacy in frequent pattern mining
by: Li-ping DING, et al.
Published: (2014-10-01) -
Local differential privacy-based frequent sequence mining
by: Teng Wang, et al.
Published: (2022-06-01)