r-grams: Relational Grams
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 907-911.
Abstract
We introduce relational grams (r-grams). They upgrade n-grams for modeling relational sequences of atoms. As n-grams, r-grams are based on smoothed n-th order Markov chains. Smoothed distributions can be obtained by decreasing the order of the Markov chain as well as by relational generalization of the r-gram. To avoid sampling object identifiers in sequences, r-grams are generative models at the level of variablized sequences with local object identity constraints. These sequences define equivalence classes of ground sequences, in which elements are identical up to local identifier renaming. The proposed technique is evaluated in several domains, including mobile phone communication logs, Unix shell user modeling, and protein fold prediction based on secondary protein structure.
@inproceedings{ijcai2007p146,
title = {r-grams: Relational Grams},
author = {Landwehr, Niels and de Raedt, Luc},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {907--911},
year = {2007},
url = {https://ijcai.org/proceedings/2007/146},
}
TY - CPAPER TI - r-grams: Relational Grams AU - Landwehr, Niels AU - de Raedt, Luc T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 907 EP - 911 UR - https://ijcai.org/proceedings/2007/146 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
