Funder
Shenzhen Fundamental Research Program
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Reference49 articles.
1. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. Proc 21th Inter Conf Very Large Data Bases 487–499
2. Ahmed CF, Tanbeer SK, Jeong BS, Lee YK (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Engin 21(12):1708–1721
3. Arthur H (2005) Strategic Database Marketing: The Masterplan for Starting and Managing a Profitable. Customer-based Marketing Program, McGraw-Hill Professional
4. Aryabarzan N, Minaei-Bidgoli B, Teshnehlab M (2018) negfin: An efficient algorithm for fast mining frequent itemsets. Expert Syst Appl 105:129–143
5. Baek Y, Yun U, Kim H, Nam H, Kim H, Lin JC, Vo B, Pedrycz W (2021) RHUPS: Mining recent high utility patterns with sliding window–based arrival time control over data streams. ACM Trans Intell Syst Technol 12(2):16:1–16:27