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

DOI10.1007/s10994-010-5208-5zbMath1237.68151MaRDI 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 programming; propositionalization; relational machine learning

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68N17: Logic programming

Related Items

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

Uses Software

• LIBLINEAR
• kFOIL

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item