Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

89

Voted

DIS
2003
Springer

110views Theoretical Computer Science» more DIS 2003»

Discovering Frequent Substructures in Large Unordered Trees

15 years 10 months ago

Discovering Frequent Substructures in Large Unordered Trees

Download www.i.kyushu-u.ac.jp

Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ic

Real-time Traffic

DIS 2003 |

claim paper

Related Content

» FASST Mining Discovering Frequently Changing Semantic Structure from Versions of Unordered...

» Discovering frequently changing structures from historical structural deltas of unordered ...

» Varro An Algorithm and Toolkit for Regular Structure Discovery in Treebanks

» Discovering Frequent Agreement Subtrees from Phylogenetic Data

» Unordered Tree Mining with Applications to Phylogeny

» CMTreeMiner Mining Both Closed and Maximal Frequent Subtrees

» Bonsai Growing Interesting Small Trees

» Graph Indexing A Frequent Structurebased Approach

» A Treebased Approach for Efficiently Mining Approximate Frequent Itemsets

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	DIS
Authors	Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano

Comments (0)