Learning with concept hierarchies in probabilistic relational data mining

DOI10.1007/3-540-45703-8_10MaRDI QIDQ4708627zbMATH OpenFDO

Authors Jianzhong Chen, Mary Shapcott, Sally McClean, Kenny Adamson

Publication date 18 June 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/2419/24190104.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Qualitative probabilistic relational models
• An approach to learning PRM from incomplete relational data
• 10.1162/jmlr.2003.3.4-5.679
• Relational concept analysis: mining concept lattices from multi-relational data
• scientific article; zbMATH DE number 2019599

Cited in

(8)

• Generating concept hierarchies/networks: mining additional semantics in relational data
• Unsupervised learning of probabilistic concept hierarchies
• An approach to learning PRM from incomplete relational data
• Learning Ontologies with Deep Class Hierarchies by Mining the Content of Relational Databases
• Learning concepts and their unions from positive data with refinement operators
• Advances in Artificial Intelligence – SBIA 2004
• Relational instance-based learning with lists and terms
• Qualitative probabilistic relational models

This page was built for publication: Learning with concept hierarchies in probabilistic relational data mining

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