Research on Algorithm of Frequent Subtree Mining
Authors
Xin Guo, ChangGuo Xiang
Corresponding Author
Xin Guo
Available Online December 2015.
- DOI
- 10.2991/nceece-15.2016.37How to use a DOI?
- Keywords
- Data Mine; Frequent Subtree; Frequent Subgraph; Ordered Tree
- Abstract
With the development of computer and information technology, frequent mine become important researching value, from subset mine to structured data mine, it includes frequent sub tree mining and frequent sub graph mining. In this paper, we introduces frequent sub tree mining and describes research status, and analyzes ordered tree mine algorithm and unordered tree mine algorithm. We achieve the algorithm and compare the efficiency of the tree algorithm.
- Copyright
- © 2016, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Xin Guo AU - ChangGuo Xiang PY - 2015/12 DA - 2015/12 TI - Research on Algorithm of Frequent Subtree Mining BT - Proceedings of the 2015 4th National Conference on Electrical, Electronics and Computer Engineering PB - Atlantis Press SP - 183 EP - 188 SN - 2352-5401 UR - https://doi.org/10.2991/nceece-15.2016.37 DO - 10.2991/nceece-15.2016.37 ID - Guo2015/12 ER -