Yen, Siwen
Non-Parametric Learning of Gaifman Models
Dhami, Devendra Singh, Yen, Siwen, Kunapuli, Gautam, Natarajan, Sriraam
We consider the problem of structure learning for Gaifman models and learn relational features that can be used to derive feature representations from a knowledge base. These relational features are first-order rules that are then partially grounded and counted over local neighborhoods of a Gaifman model to obtain the feature representations. We propose a method for learning these relational features for a Gaifman model by using relational tree distances. Our empirical evaluation on real data sets demonstrates the superiority of our approach over classical rule-learning.