Unsupervised learning of probabilistic concept hierarchies

DOI10.1007/3-540-44673-7_3MaRDI QIDQ2771837zbMATH OpenFDO

Authors Wayne Iba, Pat Langley

Publication date 18 February 2002

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/2049/20490039

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Learning by discovering concept hierarchies
• Unsupervised learning by probabilistic latent semantic analysis
• Unsupervised concept learning using rough concept analysis
• Structured features from concept lattices for unsupervised learning and classification
• Learning hierarchically-structured concepts
• Efficient distribution-free learning of probabilistic concepts
• Learning with concept hierarchies in probabilistic relational data mining

Cited in

(3)

• Learning by discovering concept hierarchies
• Extending adaptive world modeling by identifying and handling insufficient knowledge models
• Knowledge-oriented and distributed unsupervised learning for concept elicitation

This page was built for publication: Unsupervised learning of probabilistic concept hierarchies

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