Kuželka, Ondřej and Železný, Filip

Kuželka, O., & Železný, F. (2011). Block-wise construction of tree-like relational features with monotone reducibility and redundancy. Machine Learning, 83(2), 163–192.

Abstract

We describe an algorithm for constructing a set of tree-like conjunctive relational features by combining smaller conjunctive blocks. Unlike traditional level-wise approaches which preserve the monotonicity of frequency, our block-wise approach preserves monotonicity of feature reducibility and redundancy, which are important in propositionalization employed in the context of classification learning. With pruning based on these properties, our block-wise approach efficiently scales to features including tens of first-order atoms, far beyond the reach of state-of-the art propositionalization or inductive logic programming systems.

Citation

@article{treelike2011,
  author = {Kuželka, Ondřej and Železný, Filip},
  title = {Block-wise construction of tree-like relational features with monotone reducibility and redundancy},
  journal = {Machine Learning},
  year = {2011},
  volume = {83},
  number = {2},
  pages = {163-192},
  issn = {1573-0565},
  doi = {10.1007/s10994-010-5208-5},
  url = {https://doi.org/10.1007/s10994-010-5208-5}
}