Graduation Semester and Year
2005
Language
English
Document Type
Thesis
Degree Name
Master of Science in Computer Science
Department
Computer Science and Engineering
First Advisor
Lawrence B Holder
Abstract
Graph-based relational learning has been the focus of relational learning for quite some time. As most of the real-world data is structured, and hence cannot be represented in a single table, various logic-based and graph-based techniques have been proposed for dealing with structured data. Our goal is to perform an in-depth analysis of two such graph-based learning systems. We have selected Subdue to represent the search-based approach and support vector machine (SVM) with graph kernels to represent the kernel-based approach. We perform a comparison between search-based and kernel-based approaches and evaluate their performance in various domains. A search-based approach to learning typically involves a search through a larger hypotheses space. The main concern of a search-based learning system is to search through the hypothesis space efficiently. Kernel-based approaches on the other hand do not involve generation and search of a hypotheses space. Instead, a kernel-based system maps the given input space to a higher-dimensional space to perform linear classification. Experiments are performed on the mutagenesis dataset which is one of the benchmark datasets for structured, relational learning and artificial domains. Our aim is to evaluate these two systems based on their classification performance on the mutagenesis dataset with and without background knowledge. Besides mutagenesis data, various synthetic data including concepts such as ring, tree, clique problem and simple geometric shapes were used to study the ability of the systems to learn the required concepts. Subdue uses an inexact graph match to compute the cost involved in transforming one graph to another. We have implemented this inexact graph match as a potential graph kernel with Support Vector Machine and study its performance on various data domains.
Disciplines
Computer Sciences | Physical Sciences and Mathematics
License
This work is licensed under a Creative Commons Attribution-NonCommercial-Share Alike 4.0 International License.
Recommended Citation
Gonsalves, Chris Manuel, "Comparison Of Search-based And Kernel-based Methods For Graph-based Relational Learning" (2005). Computer Science and Engineering Theses. 158.
https://mavmatrix.uta.edu/cse_theses/158
Comments
Degree granted by The University of Texas at Arlington