Frequent Subtree Mining Based on Projected Branch

Zhao Chuanshen, Sun Zhihui, and Zhang Jing

Journal of Computer Research and Development > 2006 > 43(3): 456-462.

Zhao Chuanshen, Sun Zhihui, and Zhang Jing. Frequent Subtree Mining Based on Projected Branch[J]. Journal of Computer Research and Development, 2006, 43(3): 456-462.

Citation:

Zhao Chuanshen, Sun Zhihui, and Zhang Jing. Frequent Subtree Mining Based on Projected Branch[J]. Journal of Computer Research and Development, 2006, 43(3): 456-462.

Citation:

Zhao Chuanshen, Sun Zhihui, and Zhang Jing. Frequent Subtree Mining Based on Projected Branch[J]. Journal of Computer Research and Development, 2006, 43(3): 456-462.

PDF (390 KB)

Frequent Subtree Mining Based on Projected Branch

Zhao Chuanshen, Sun Zhihui, and Zhang Jing

(Department of Computer Science and Engineering, Southeast University, Nanjing 210096)

More Information

Published Date: March 14, 2006

Graphical Abstract

Abstract

Abstract

Discovering frequent subtrees from ordered labeled trees is an important research problem in data mining with broad applications in bioinformatics, web log, XML documents and so on. In this paper, A new concept of projected branch is introduced, and a new algorithm FTPB (frequent subtrees mining based on projected branch) is proposed. This algorithm does the work of distinguishing isomorphism while computing projected branch, which decreases the complexity of algorithm, improving the efficiency of the algorithm. Theoretical analysis and experimental results show that the FTPB algorithm is efficient and effective.
- data mining,
- frequent subtrees,
- projected branch,
- enumeration tree

FullText(HTML)

References (0)

[1]	Liu Yang, Jin Peiquan. ZB⁺-tree: A Novel ZNS SSD-Aware Index Structure[J]. Journal of Computer Research and Development, 2023, 60(3): 509-524. DOI: 10.7544/issn1000-1239.202220502
[2]	Ouyang Dantong, Zhi Huayun, Liu Bowen, Zhang Liming, Zhang Yonggang. A Method of Computing Minimal Diagnoses Based on Pseudo-Failure-Degree to Create New Enumeration Tree[J]. Journal of Computer Research and Development, 2018, 55(4): 782-790. DOI: 10.7544/issn1000-1239.2018.20170016
[3]	Liu Siguang, Ouyang Dantong, Wang Yiyuan, Jia Fengyu, Zhang Liming. Algorithm of Computing Minimal Hitting Set Based on the Structural Feature of SE-Tree[J]. Journal of Computer Research and Development, 2016, 53(11): 2556-2566. DOI: 10.7544/issn1000-1239.2016.20150396
[4]	Wang Fang, Wang Peiqun, Zhu Chunjie. Study and Implementation of Frequent Sequences Mining Based Prefetching Algorithm[J]. Journal of Computer Research and Development, 2016, 53(2): 443-448. DOI: 10.7544/issn1000-1239.2016.20148040
[5]	Fan Haixiong, Liu Fuxian, and Xia Lu. Research on Case Index BCS-Tree and Its Constructing Method[J]. Journal of Computer Research and Development, 2013, 50(12): 2629-2641.
[6]	Shen Yan, Song Shunlin, Zhu Yuquan. Mining Algorithm of Association Rules Based on Disk Table Resident FP-TREE[J]. Journal of Computer Research and Development, 2012, 49(6): 1313-1322.
[7]	Wang Liming and Zhao Hui. Algorithms of Mining Global Maximum Frequent Itemsets Based on FP-Tree[J]. Journal of Computer Research and Development, 2007, 44(3).
[8]	Zhang Kun and Zhu Yangyong. Sequence Pattern Mining Without Duplicate Project Database Scan[J]. Journal of Computer Research and Development, 2007, 44(1): 126-132.
[9]	Ren Jinping and Lü Shuwang. Enumerations and Counting of Orthomorphic Permutations[J]. Journal of Computer Research and Development, 2006, 43(6): 1071-1075.
[10]	Ma Haibing, Zhang Chenghong, Zhang Jin, and Hu Yunfa. Mining Frequent Patterns Based on IS\++-Tree Model[J]. Journal of Computer Research and Development, 2005, 42(4): 588-593.