Discovering Frequent Substructures in Large Unordered Trees
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 47-61
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- TreeFinder: a first step towards XML data mining2003
- Online algorithms for mining semi-structured data stream2003
- Frequent subgraph discovery2002
- Efficient generation of plane treesInformation Processing Letters, 2002
- Optimized Substructure Discovery for Semi-structured Data2002
- Discovery of Frequent Tag Tree Patterns in Semistructured Web Documents2002
- Efficient Substructure Discovery from Large Semi-structured Data2002
- A Fast Algorithm for Enumerating Bipartite Perfect MatchingsLecture Notes in Computer Science, 2001
- An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data2000
- Reverse search for enumerationDiscrete Applied Mathematics, 1996