2006
NIPS
NeurIPS 2006
Learning annotated hierarchies from relational data
Abstract
The objects in many real-world domains can be organized into hierarchies, where each internal node picks out a category of objects. Given a collection of fea- tures and relations defined over a set of objects, an annotated hierarchy includes a specification of the categories that are most useful for describing each individual feature and relation. We define a generative model for annotated hierarchies and the features and relations that they describe, and develop a Markov chain Monte Carlo scheme for learning annotated hierarchies. We show that our model discov- ers interpretable structure in several real-world data sets.
🚀
Conference Pioneer
— NIPS 2006
🌉
Interdisciplinary Bridge
— Knowledge & Reasoning and Machine Learning and Mathematics & Optimization
📈
Trend Setter
— Probability
🧭
Keyword Pioneer
— hierarchical learning
🐣
Hot Topic Early Bird
— markov chain monte carlo
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Speech & Audio
Authors
Topics
Machine Learning > Core Methods > Clustering
Machine Learning > Core Methods > Representation Learning
Machine Learning > Learning Types > Unsupervised Learning
Knowledge & Reasoning > Representation > Knowledge Representation
Mathematics & Optimization > Mathematics > Probability
Machine Learning > Bayesian & Probabilistic > Probabilistic Modeling
Machine Learning > Core Methods > Probabilistic Modeling
Machine Learning > Bayesian & Probabilistic > Bayesian Inference
Artificial Intelligence > Core AI > Knowledge Representation