Abstract
Relational representation of objects using graphs reveals much information that cannot be obtained by attribute value representations alone. There are already many databases that incorporate graph expressions. We focus on syntactic trees in language sentences, and we attempt to mine characteristic subgraph patterns. The mining process employs two methods: relative indexing of graph vertices and the cascade model. The former extracts many linear subgraphs from the database. An instance is then represented by a set of items, each of which indicates whether a specific linear subgraph is contained within the graph of the instance. The cascade model is a rule induction method that uses levelwise expansion of a lattice. The basic assumption of this mining process is that characteristic subgraphs may be well represented by the concurrent appearance of linear subgraphs. The resulting rules are shown to be a good guide for obtaining valuable knowledge in linguistics.
Chapter PDF
Similar content being viewed by others
References
Yoshida, K., Motoda, H.: CLIP: Concept Learning from Inference Patterns, Artificial Intelligence, 75, pp.63–92 (1995).
Muggleton, S., Raedt, L.D.: Inductive Logic Programming:Theory and Methods. J. Logic Programming, 19, pp.629–679 (1994).
Dehaspe, L., Toivonen, H., King, R.D.: Finding Frequent Substructures in Chemical Compounds, Proc. KDD-98, pp.30–36, AAAI (1998).
Inokuchi, A., Washio, T., Motoda, H.: Derivation of the Topology Structure from Massive Graph Data, Discovery Science, pp.330–332, LNAI 1721, Springer-Verlag (1999).
King, R.D., Muggleton, S.H., Srinivasan, A., Sternberg, M.J.: Structure-Activity Relationships Derived by Machine Learning. Proc. Natl. Acad. Sci. USA, 93, pp.438–442 (1996).
Okada, T.: SAR Discovery on the Mutagenicity of Aromatic Nitro Compounds Studied by the Cascade Model, Proc. Int. Workshop KDD Challenge on Real-world Data at PAKDD-2000, pp.47–53, (2000).
Okada, T.: Finding Discrimination Rules Using the Cascade Model, J. Jpn. Soc. Artificial Intelligence, 15, pp.321–330 (2000).
Okada, T.: Rule Induction in Cascade Model based on Sum of Squares Decomposition, Principles of Data Mining and Knowledge Discovery (Proc. PKDD’99), pp.468–475, LNAI 1704, Springer-Verlag (1999).
Okada, T.: Efficient Detection of Local Interactions in the Cascade Model, Knowledge Discovery and Data Mining (PAKDD 2000), pp.193–203, LNAI 1805, Springer-Verlag (2000).
Japan Electronic Dictionary Research Institute: EDR Electronic Dictionary, http://www.iijnet.or.jp/edr/index.html.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okada, T., Oyama, M. (2000). Discovery of Characteristic Subgraph Patterns Using Relative Indexing and the Cascade Model. In: Zighed, D.A., Komorowski, J., Żytkow, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 2000. Lecture Notes in Computer Science(), vol 1910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45372-5_65
Download citation
DOI: https://doi.org/10.1007/3-540-45372-5_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41066-9
Online ISBN: 978-3-540-45372-7
eBook Packages: Springer Book Archive