Block-wise construction of tree-like relational features with monotone reducibility and redundancy

DOI10.1007/s10994-010-5208-5zbMath1237.68151OpenAlexW2003019560MaRDI QIDQ413862

Ondřej Kuželka, Filip Železný

Publication date: 8 May 2012

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-010-5208-5

zbMATH Keywords

inductive logic programmingpropositionalizationrelational machine learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17)

Related Items (3)

Relational and Semantic Data Mining ⋮ Block-wise construction of tree-like relational features with monotone reducibility and redundancy ⋮ Propositionalization and embeddings: two sides of the same coin

Uses Software

• LIBLINEAR
• kFOIL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Block-wise construction of tree-like relational features with monotone reducibility and redundancy
• Foundations of inductive logic programming
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Propositionalization-based relational subgroup discovery with RSD
• Degrees of acyclicity for hypergraphs and relational database schemes
• A study of relevance for learning in deductive databases
• An extended transformation approach to inductive logic programming

This page was built for publication: Block-wise construction of tree-like relational features with monotone reducibility and redundancy