Parallel Frequent Subtrees Mining Method by an Effective Edge Division Strategy
Most data with a complicated structure can be represented by a tree structure. Parallel processing is essential to mining frequent subtrees from massive data in a timely manner. However, only a few algorithms could be transplanted to a parallel framework. A new parallel algorithm is proposed to mine...
Main Authors: | Jing Wang, Xiongfei Li |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-05-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/12/9/4778 |
Similar Items
-
A scalable method for identifying frequent subtrees in sets of large phylogenetic trees
by: Ramu Avinash, et al.
Published: (2012-10-01) -
Entropy and Enumeration of Subtrees in a Cactus Network
by: Lixin Dong, et al.
Published: (2020-10-01) -
Trees with Unique Least Central Subtrees
by: Kang Liying, et al.
Published: (2018-08-01) -
On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs under Dynamic Evolution
by: Yu Yang, et al.
Published: (2019-05-01) -
On BC-Subtrees in Multi-Fan and Multi-Wheel Graphs
by: Yu Yang, et al.
Published: (2020-12-01)