Efficient relational learning from sparse data

DOI10.1007/3-540-46148-5_2MaRDI QIDQ4409854zbMATH OpenFDO

Authors Luboš Popelínský

Publication date 1 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2443/24430011.htm

zbMATH Keywords

database schema redesignmining in spatial datarelational learning

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Fast learning of relational kernels
• Fast learning of relational dependency networks
• A dynamic approach to dimensionality reduction in relational learning

Cited in

(14)

• Resource-bounded relational reasoning: Induction and deduction through stochastic matching
• Sparse logical terms
• A semantic matching energy function for learning with multi-relational data
• An approach to learning PRM from incomplete relational data
• Speeding Up Inference in Statistical Relational Learning by Clustering Similar Query Literals
• Relational information gain
• Learning with feature description logics
• scientific article; zbMATH DE number 2099202 (Why is no real title available?)
• Learning relational event models from video
• scientific article; zbMATH DE number 6026985 (Why is no real title available?)
• scientific article; zbMATH DE number 2227381 (Why is no real title available?)
• Relational instance-based learning with lists and terms
• Learning Distributional Programs for Relational Autocompletion
• Non-parametric learning of embeddings for relational data using Gaifman locality theorem

This page was built for publication: Efficient relational learning from sparse data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409854)