Discovering Frequent Structures using Summaries
| dc.contributor.author | Ghazizadeh, Shayan | en_US |
| dc.contributor.author | Chawathe, Sudarshan | en_US |
| dc.date.accessioned | 2004-05-31T23:18:22Z | |
| dc.date.available | 2004-05-31T23:18:22Z | |
| dc.date.created | 2002-05 | en_US |
| dc.date.issued | 2002-05-22 | en_US |
| dc.description.abstract | We study the problem of finding frequent structures in semistructured data (represented as a directed labeled graph). Frequent structures are graphs that are isomorphic to a large number of subgraphs in the data graph. Frequent structures form building blocks for visual exploration and data mining of semistructured data. We overcome the inherent computational complexity of the problem by using a summary data structure to prune the search space and to provide interactive feedback. We present an experimental study of our methods operating on real datasets. The implementation of our methods (which is freely available) is capable of operating on datasets that are two to three orders of magnitude larger than those described in prior work. (Also UMIACS-TR-2002-44) | en_US |
| dc.format.extent | 579903 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/1199 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4364 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-2002-44 | en_US |
| dc.title | Discovering Frequent Structures using Summaries | en_US |
| dc.type | Technical Report | en_US |