Logical–Mathematical Foundations of a Graph Query Framework for Relational Learning
-
Published:2023-11-16
Issue:22
Volume:11
Page:4672
-
ISSN:2227-7390
-
Container-title:Mathematics
-
language:en
-
Short-container-title:Mathematics
Author:
Almagro-Blanco Pedro1, Sancho-Caparrini Fernando1, Borrego-Díaz Joaquín1ORCID
Affiliation:
1. Departamento Ciencias de la Computación e Inteligencia Artificial, E. T. S. Ingeniería Informática, Universidad de Sevilla, 41012 Sevilla, Spain
Abstract
Relational learning has attracted much attention from the machine learning community in recent years, and many real-world applications have been successfully formulated as relational learning problems. In recent years, several relational learning algorithms have been introduced that follow a pattern-based approach. However, this type of learning model suffers from two fundamental problems: the computational complexity arising from relational queries and the lack of a robust and general framework to serve as the basis for relational learning methods. In this paper, we propose an efficient graph query framework that allows for cyclic queries in polynomial time and is ready to be used in pattern-based learning methods. This solution uses logical predicates instead of graph isomorphisms for query evaluation, reducing complexity and allowing for query refinement through atomic operations. The main differences between our method and other previous pattern-based graph query approaches are the ability to evaluate arbitrary subgraphs instead of nodes or complete graphs, the fact that it is based on mathematical formalization that allows the study of refinements and their complementarity, and the ability to detect cyclic patterns in polynomial time. Application examples show that the proposed framework allows learning relational classifiers to be efficient in generating data with high expressiveness capacities. Specifically, relational decision trees are learned from sets of tagged subnetworks that provide both classifiers and characteristic patterns for the identified classes.
Funder
Agencia Estatal de Investigación
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference36 articles.
1. Dong, X., Gabrilovich, E., Heitz, G., Horn, W., Lao, N., Murphy, K., Strohmann, T., Sun, S., and Zhang, W. (2014, January 24–27). Knowledge vault: A web-scale approach to probabilistic knowledge fusion. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD ’14, New York, NY, USA. 2. Predicting protein relationships to human pathways through a relational learning approach based on simple sequence features;Pons;IEEE/ACM Trans. Comput. Biol. Bioinform.,2014 3. Jacob, Y., Denoyer, L., and Gallinari, P. (2014, January 24–28). Learning latent representations of nodes for classifying in heterogeneous social networks. Proceedings of the 7th ACM International Conference on Web Search and Data Mining WSDM ’14, New York, NY, USA. 4. Lee, N., Hyun, D., Na, G.S., Kim, S., Lee, J., and Park, C. (2023). Conditional Graph Information Bottleneck for Molecular Relational Learning. arXiv. 5. Fan, W. (2012, January 26–29). Graph Pattern Matching Revised for Social Network Analysis. Proceedings of the 15th International Conference on Database Theory (ICDT ’12), Berlin, Germany.
|
|