Sciweavers

12 search results - page 1 / 3
» Discovering Frequent Substructures in Large Unordered Trees
Sort
View
DIS
2003
Springer
13 years 10 months ago
Discovering Frequent Substructures in Large Unordered Trees
Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ic...
DASFAA
2005
IEEE
153views Database» more  DASFAA 2005»
13 years 10 months ago
FASST Mining: Discovering Frequently Changing Semantic Structure from Versions of Unordered XML Documents
Abstract. In this paper, we present a FASST mining approach to extract the frequently changing semantic structures (FASSTs), which are a subset of semantic substructures that chang...
Qiankun Zhao, Sourav S. Bhowmick
CIKM
2004
Springer
13 years 10 months ago
Discovering frequently changing structures from historical structural deltas of unordered XML
Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic i...
Qiankun Zhao, Sourav S. Bhowmick, Mukesh K. Mohani...
COLING
2010
12 years 11 months ago
Varro: An Algorithm and Toolkit for Regular Structure Discovery in Treebanks
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
Scott Martens
TKDE
2008
153views more  TKDE 2008»
13 years 4 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang