The SEuS Project
- Description: In the SEuS project, We are
investigating methods for 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. Our initial implementation tries to
overcome the inherent computational complexity of the problem by using
a summary data structure to prune the search space and to provide
interactive feedback. For details, please refer to the publications
- Download SEuS: The
source code (gzipped tar file, java) for the SEuS system is being
released under the terms of the GNU General Public
License. SEuS needs some libraries that have been packaged with
the source code.
- SEuS: Structure Extraction using Summaries.
Shayan Ghazizadeh and Sudarshan Chawathe. In Proceedings of the
The 5th International Conference on Discovery Science.
Germany, November 2002.
Paper in PostScript;
- Discovering Frequent Structures using Summaries.
Shayan Ghazizadeh and Sudarshan Chawathe. Technical Report CS-TR-4364.
Computer Science Department, University of Maryland, College Park,
Maryland 20742. November 2001. Paper in
[University of Maryland|
Computer Science Department|
Unless otherwise noted, all documents in the
http://www.cs.umd.edu/projects/seus/ hierarchy are
Copyright © 2001 Sudarshan S. Chawathe.
Sudarshan S. Chawathe