Schulz, Till Hendrik and Horváth, Tamás and Welke, Pascal and Wrobel, Stefan (2018) Mining Tree Patterns with Partially Injective Homomorphisms. In: Mining Tree Patterns with Partially Injective Homomorphisms. :. Lecture Notes in Computer Science, 11052 . Springer, Cham, IRL, pp. 585-601. ISBN 9783030109271
Full text not available from this repository.Abstract
One of the main differences between inductive logic programming (ILP) and graph mining lies in the pattern matching operator applied: While it is mainly defined by relational homomorphism (i.e., subsumption) in ILP, subgraph isomorphism is the most common pattern matching operator in graph mining. Using the fact that subgraph isomorphisms are injective homomorphisms, we bridge the gap between ILP and graph mining by considering a natural transition from homomorphisms to subgraph isomorphisms that is defined by partially injective homomorphisms, i.e., which require injectivity only for subsets of the vertex pairs in the pattern. Utilizing positive complexity results on deciding homomorphisms from bounded tree-width graphs, we present an algorithm mining frequent trees from arbitrary graphs w.r.t. partially injective homomorphisms. Our experimental results show that the predictive performance of the patterns obtained is comparable to that of ordinary frequent subgraphs. Thus, by preserving much from the advantageous properties of homomorphisms and subgraph isomorphisms, our approach provides a trade-off between efficiency and predictive power.