Abstract
A machine learning technique called Graph-Based Induction (GBI) extracts typical patterns from graph data by stepwise pair expansion (pairwise chunking). Because of its greedy search strategy, it is very efficient but suffers from incompleteness of search. We improved its search capability without imposing much computational complexity by incorporating the idea of beam search. Additional improvement is made to extract patterns that are more discriminative than those simply occurring frequently, and to enumerate identical patterns accurately based on the notion of canonical labeling. This new algorithm was implemented (now called Beam-wise GBI, B-GBI for short) and tested against a DNA data set from UCI repository. Since DNA data is a sequence of symbols, representing each sequence by attribute-value pairs by simply assigning these symbols to the values of ordered attributes does not make sense. By transforming the sequence into a graph structure and running B-GBI it is possible to extract discriminative substructures. These can be new attributes for a classification problem. Effect of beam width on the number of discovered attributes and predictive accuracy was evaluated, together with extracted characteristic subsequences, and the results indicate the effectiveness of B-GBI.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. L. Blake, E. Keogh, and C.J. Merz. Uci repository of machine leaning database, 1998. http://www.ics.uci.edu/~mlearn/MLRepository.html.
L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth & Brooks/Cole Advanced Books & Software, 1984.
L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. The cn2 induction algorithm. Machine Learning, 3:261–283, 1989.
D. J. Cook and L. B. Holder. Graph-based data mining. IEEE Intelligent Systems, 15(2):32–41, 2000.
S. Fortin. The graph isomorphism problem, 1996.
A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, pages 13–23, 2000.
T. Matsuda, T. Horiuchi, H. Motoda, and T. Washio. Extension of graph-based induction for general graph structured data. In Knowledge Discovery and Data Mining: Current Issues and New Applications, Springer Verlag, LNAI 1805, pages 420–431, 2000.
R. S. Michalski. Learning flexible concepts: Fundamental ideas and a method based on two-tiered representaion. In Machine Learning, An Artificial Intelligence Approiach, 3:63–102, 1990.
S. Muggleton and L. de Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19(20):629–679, 1994.
J. R. Quinlan. Induction of decision trees. Machine Learning, 1:81–106, 1986.
J. R. Quinlan. C4.5:Programs For Machine Learning. Morgan Kaufmann Publishers, 1993.
R. C. Read and D. G. Corneil. The graph isomorphism disease. Journal of Graph Theory, 1:339–363, 1977.
K. Yoshida and H. Motoda. Clip: Concept learning from inference pattern. Journal of Artificial Intelligence, 75(1):63–92, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsuda, T., Motoda, H., Yoshida, T., Washio, T. (2002). Knowledge Discovery from Structured Data by Beam-Wise Graph-Based Induction. In: Ishizuka, M., Sattar, A. (eds) PRICAI 2002: Trends in Artificial Intelligence. PRICAI 2002. Lecture Notes in Computer Science(), vol 2417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45683-X_29
Download citation
DOI: https://doi.org/10.1007/3-540-45683-X_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44038-3
Online ISBN: 978-3-540-45683-4
eBook Packages: Springer Book Archive