Please use this identifier to cite or link to this item:
|Title:||Efficient pattern discovery for semistructured data|
|Source:||Feng, Z.,Hsu, W.,Lee, M.L. (2005). Efficient pattern discovery for semistructured data. Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI 2005 : 294-301. ScholarBank@NUS Repository. https://doi.org/10.1109/ICTAI.2005.63|
|Abstract:||The process of discovering frequent patterns from large semistructured data repositories is one of the hardest categories of tree mining problems, since it involves the discovery of unordered embedded tree patterns. Existing work has focused primarily on the discovery of ordered, induced trees. This work proposes a divide-and-conquer algorithm called WTIMiner to discover the complete set of frequent unordered embedded subtrees. The algorithm successfully reduces the complexity of pattern matching and counting problem that a regular tree mining algorithm faces. Experimental results demonstrate the efficiency and scalability of WTIMiner in terms of both time and space. © 2005 IEEE.|
|Source Title:||Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 11, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.