Abstract
In this paper, we present an effective algorithm for extracting characteristic substructures from graph structured data with geometric information, such as CAD, map data and drawing data. Moreover, as an application of our algorithm, we give a method of lossless compression for such data. First, in order to deal with graph structured data with geometric information, we give a layout graph which has the total order on all vertices. As a knowledge representation, we define a layout term graph with structured variables. Secondly, we present an algorithm for finding frequent connected subgraphs in given data. This algorithm is based on levelwise strategies like Apriori algorithm by focusing on the total order on vertices. Next, we design a method of lossless compression of graph structured data with geometric information by introducing the notion of a substitution in logic programming. In general, analyzing large graph structured data is a time consuming process. If we can reduce the number of vertices without loss of information, we can speed up such a heavy process. Finally, in order to show an effectiveness of our method, we report several experimental results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. Proc. of the 20th VLDB Conference, pages 487–499, 1994.
D. J. Cook and L. B. Holder. Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research, 1:231–255, 1994.
D. J. Cook and L. B. Holder. Graph-based data mining. IEEE Intelligent Systems, 15(2):32–41, 2000.
A. Inokuchi, T. Washio, and H. Motoda. An Apriori-based algorithm for mining frequent substructures from graph data. Proc. PAKDD-2000, Springer-Verlag, LNAI 1805, pages 13–23, 2000.
T. Matsuda, T. Horiuchi, H. Motoda, and T. Washio. Extension of graph-based induction for general graph structured data. Proc. PAKDD-2000, Springer-Verlag, LNAI 1805, pages 420–431, 2000.
T. Miyahara, T. Uchida, T. Shoudai, T. Kuboyama, K. Takahashi, and H. Ueda. Discovering knowledge from graph structured data by using refutably inductive inference of formal graph systems. IEICE Trans. Inf. Syst., E84-D(1):48–56, 2001.
T. Uchida, Y. Itokawa, T. Shoudai, T. Miyahara, and Y. Nakamura. A new framework for discovering knowledge from two-dimensional structured data using layout formal graph system. Proc. ALT-00, Springer-Verlag, LNAI 1968, pages 141–155, 2000.
T. Uchida, T. Shoudai, and S. Miyano. Parallel algorithm for refutation tree problem on formal graph systems. IEICE Trans. Inf. Syst., E78-D(2):99–112, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Itokawa, Y., Uchida, T., Shoudai, T., Miyahara, T., Nakamura, Y. (2003). Finding Frequent Subgraphs from Graph Structured Data with Geometric Information and Its Application to Lossless Compression. In: Whang, KY., Jeon, J., Shim, K., Srivastava, J. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2003. Lecture Notes in Computer Science(), vol 2637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36175-8_58
Download citation
DOI: https://doi.org/10.1007/3-540-36175-8_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04760-5
Online ISBN: 978-3-540-36175-6
eBook Packages: Springer Book Archive