Study on A Fast Algorithm for Mining Disorder Tree

DOI

10.2991/nceece-15.2016.39How to use a DOI?

Keywords

Data Mining; Frequent Subtree; Disorderly Tree; Export Subtree; Intron Tree

Abstract

Unordered tree mining has important research value in the field of XML data, bioinformatics, Web structure. In this paper, we propose a disorderly tree mining algorithms-UTMiner (Unordered Trees Miner). Because the tree has a disordered mining property, so in order to avoid digging out the same sub-tree, this paper proposes an efficient method of standardization disorder tree unordered tree into subtrees standardization, reuse rapid proposed ordered tree mining algorithm to get all the standardization sub-tree.

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/).

Download article (PDF)

TY  - CONF
AU  - Xin Guo
PY  - 2015/12
DA  - 2015/12
TI  - Study on A Fast Algorithm for Mining Disorder Tree
BT  - Proceedings of the 2015 4th National Conference on Electrical, Electronics and Computer Engineering
PB  - Atlantis Press
SP  - 194
EP  - 197
SN  - 2352-5401
UR  - https://doi.org/10.2991/nceece-15.2016.39
DO  - 10.2991/nceece-15.2016.39
ID  - Guo2015/12
ER  -