Everything about Frequent subtree mining

🧭 Start here: a 6-step reading path

1. Read the overview: Frequent subtree miningA 5-minute orientation
2. Pick up a classic book: Applied data miningThe most-reprinted book on the subject
3. Read the landmark paper: Canonical forms for labelled trees and their applications in frequent subtree miningCited 57 times
4. Go sideways: BK-treeA closely related topic
5. Go sideways: Radix treeA closely related topic

🏆 Landmark papers (most cited)

• Canonical forms for labelled trees and their applications in frequent subtree mining

  Yun Chi, Yirong Yang, Richard R. Muntz · 2005 · Knowledge and Information Systems · 57 citations

• EvoMiner: frequent subtree mining in phylogenetic databases

  Akshay Deepak, David Fernández-Baca, Srikanta Tirthapura · 2013 · Knowledge and Information Systems · 18 citations

• Probabilistic and exact frequent subtree mining in graphs beyond forests

  Pascal Welke, Tamás Horváth, Stefan Wrobel · 2019 · Machine Learning · 4 citations

• Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing

  Zhi-Hong Deng, Ning Gao, Xiao-Ran Xu · 2011 · Fundamenta Informaticae · 3 citations

• Frequent Subtree Mining Based on Projected Branch

  Chuanshen Zhao · 2006 · Journal of Computer Research and Development · 2 citations

• Frequent Subtree Mining Algorithm for Ribonucleic Acid Topological Pattern

  Zhiqiang Li, Chengjie Xu, Chen Liu · 2019 · Revue d'Intelligence Artificielle · 1 citations

• Automatic Repair Method for Dockerfile Build Errors: Extracting Dependencies between Build Error-Inducing Instructions Based on Frequent Subtree Mining

  Renya SAKAMOTO, Masao OHIRA · 2026 · IEICE Transactions on Information and Systems · 1 citations

• Mining compressed frequent subtrees set

  Chuanshen Zhao, Xianyong Wang, Zhihui Sun · 2009 · Wuhan University Journal of Natural Sciences · 1 citations

📚 Books worth reading

• 📕Applied data miningGuandong Xu · 2013
• 📕Efficient Frequent Subtree Mining Beyond ForestsP. Welke · 2020
• Intelligent Information and Database SystemsAli Selamat · 2013

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• BK-tree A BK-tree (short for Burkhard-Keller tree) is a metric tree suggested by Walter Austin Burkhard and Robert M. Keller[1] specifically adapted to discrete…
• Radix tree In computer science, a radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimized trie…
• Suffix tree In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the…
• M-ary tree In graph theory, an m-ary tree (for nonnegative integers m) (also known as n-ary, k-ary, k-way or generic tree) is an arborescence (or, for some authors…
• Rope (data structure) In computer programming, a rope, or cord, is a data structure composed of smaller strings that is used to efficiently store and manipulate longer strings…
• Red–black tree In computer science, a red–black tree is a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information…
• Prefix sum In computer science, the prefix sum, cumulative sum, inclusive scan, or simply scan of a sequence of numbers x0, x1, x2, ... is a second sequence of numbers…
• Fenwick tree A Fenwick tree or binary indexed tree (BIT) is a data structure that stores an array of values and can efficiently compute prefix sums of the values and…