EUVIMEDEUVIMED entdecken
Crossref

US-Rule: Discovering Utility-driven Sequential Rules

Gengsen Huang, Wensheng Gan, Jian Weng, Philip S. Yu

ACM Transactions on Knowledge Discovery from Data · 28.02.2023 · 17 (1) · 1-22

DOI: 10.1145/3532613 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Knowledge Discovery from Data, online erschienen am 20.02.2023. Verfasst von Gengsen Huang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 14-mal zitiert (Crossref) und nennt 42 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Guangdong Province of China, Guangzhou Basic and Applied Basic Research Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Utility-driven mining is an important task in data science and has many applications in real life. High-utility sequential pattern mining (HUSPM) is one kind of utility-driven mining. It aims at discovering all sequential patterns with high utility. However, the existing algorithms of HUSPM can not provide a relatively accurate probability to deal with some scenarios for prediction or recommendation. High-utility sequential rule mining (HUSRM) is proposed to discover all sequential rules with high utility and high confidence. There is only one algorithm proposed for HUSRM, which is not efficient enough. In this article, we propose a faster algorithm called US-Rule, to efficiently mine high-utility sequential rules. It utilizes the rule estimated utility co-occurrence pruning strategy (REUCP) to avoid meaningless computations. Moreover, to improve its efficiency on dense and long sequence datasets, four tighter upper bounds (LEEU, REEU, LERSU, and RERSU) and corresponding pruning strategies (LEEUP, REEUP, LERSUP, and RERSUP) are designed. US-Rule also proposes the rule estimated utility recomputing pruning strategy (REURP) to deal with sparse datasets. Finally, a large number of experiments on different datasets compared to the state-of-the-art algorithm demonstrate that US-Rule can achieve better performance in terms of execution time, memory consumption, and scalability.

Förderung

  • National Natural Science Foundation of China
  • Natural Science Foundation of Guangdong Province of China
  • Guangzhou Basic and Applied Basic Research Foundation

Zitieren

APA

Huang, G., Gan, W., Weng, J., & Yu, P. S. (2023). US-Rule: Discovering Utility-driven Sequential Rules. ACM Transactions on Knowledge Discovery from Data, 17(1), 1-22. https://doi.org/10.1145/3532613

Vancouver

Huang G, Gan W, Weng J, Yu PS. US-Rule: Discovering Utility-driven Sequential Rules. ACM Transactions on Knowledge Discovery from Data. 2023;17(1):1-22. doi:10.1145/3532613

BibTeX
@article{Huang2023,
  author = {Huang, Gengsen and Gan, Wensheng and Weng, Jian and Yu, Philip S.},
  title = {US-Rule: Discovering Utility-driven Sequential Rules},
  journal = {ACM Transactions on Knowledge Discovery from Data},
  year = {2023},
  volume = {17},
  number = {1},
  pages = {1--22},
  doi = {10.1145/3532613}
}
Kostenlos starten →