Discovering Frequent Substructures in Large Unordered Trees

@misc{citeulike:962744, abstract = {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...}, author = {Asai, T. and Arimura, H. and Uno, T. and Nakano, S. }, citeulike-article-id = {962744}, keywords = {frequent, graph, mining, trees}, posted-at = {2006-11-27 08:55:02}, priority = {5}, title = {Discovering Frequent Substructures in Large Unordered Trees}, url = {http://citeseer.ist.psu.edu/asai03discovering.html}, year = {2003} }

TY - GEN ID - citeulike:962744 L3 - citeulike-article-id:962744 TI - Discovering Frequent Substructures in Large Unordered Trees N2 - 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... KW - frequent KW - graph KW - mining KW - trees AU - Asai, T AU - Arimura, H AU - Uno, T AU - Nakano, S PY - 2003/// UR - http://citeseer.ist.psu.edu/asai03discovering.html ER -