Thu, 21 Aug 2008 15:28:43 BST CiteULike: bigbossman's Asai http://www.citeulike.org/user/bigbossman/author/Asai CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/bigbossman/article/962744 <i>(2003)</i><br /><br />this paper, we study a data mining problem of discovering frequent substructures in a large collection of semi-structured data, where both of the patterns and the data are modeled by labeled unordered trees. An unordered tree is a directed acyclic graph with a specified node called the root, and all nodes but the root have at most one parent. Each node is labeled by a symbol drawn from an alphabet. Such unordered trees can be seen as either a generalization of itemsets in relational... Discovering Frequent Substructures in Large Unordered Trees T Asai H Arimura T Uno S Nakano (2003) 2006-11-27T08:54:26-00:00 2003 frequent graph mining trees