EUVIMEDEUVIMED entdecken
Crossref

T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph

Lyuheng Yuan, Da Yan, Wenwen Qu, Saugat Adhikari, Jalal Khalil, Cheng Long, Xiaoling Wang

Proceedings of the ACM on Management of Data · 26.05.2023 · 1 (1) · 1-26

DOI: 10.1145/3588928 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Management of Data, online erschienen am 30.05.2023. Verfasst von Lyuheng Yuan und 6 weiteren Autor:innen. Die Arbeit wurde bisher 21-mal zitiert (Crossref) und nennt 39 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Finding frequent subgraph patterns in a big graph is an important problem with many applications such as classifying chemical compounds and building indexes to speed up graph queries. Since this problem is NP-hard, some recent parallel systems have been developed to accelerate the mining. However, they often have a huge memory cost, very long running time, suboptimal load balancing, and possibly inaccurate results. In this paper, we propose an efficient system called T-FSM for parallel mining of frequent subgraph patterns in a big graph. T-FSM adopts a novel task-based execution engine design to ensure high concurrency, bounded memory consumption, and effective load balancing. It also supports a new anti-monotonic frequentness measure called Fraction-Score, which is more accurate than the widely used MNI measure. Our experiments show that T-FSM is orders of magnitude faster than SOTA systems for frequent subgraph pattern mining. Our system code has been released at https://github.com/lyuheng/T-FSM.

Zitieren

APA

Yuan, L., Yan, D., Qu, W., Adhikari, S., Khalil, J., Long, C., & Wang, X. (2023). T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph. Proceedings of the ACM on Management of Data, 1(1), 1-26. https://doi.org/10.1145/3588928

Vancouver

Yuan L, Yan D, Qu W, Adhikari S, Khalil J, Long C, et al. T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph. Proceedings of the ACM on Management of Data. 2023;1(1):1-26. doi:10.1145/3588928

BibTeX
@article{Yuan2023,
  author = {Yuan, Lyuheng and Yan, Da and Qu, Wenwen and Adhikari, Saugat and Khalil, Jalal and Long, Cheng and Wang, Xiaoling},
  title = {T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph},
  journal = {Proceedings of the ACM on Management of Data},
  year = {2023},
  volume = {1},
  number = {1},
  pages = {1--26},
  doi = {10.1145/3588928}
}
Kostenlos starten →