Razor: Mining distance-constrained embedded subtrees
Our work is focused on the task of mining frequent subtrees from a database of rooted ordered labelled subtrees. Previously we have developed an efficient algorithm, MB3 [12], for mining frequent embedded subtrees from a database of rooted labeled and ordered subtrees. The efficiency comes from the...
| Main Authors: | , , , |
|---|---|
| Format: | Conference Paper |
| Published: |
IEEE
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/5006 |