Fast Inference in Infinite Hidden Relational Models
Description
Relational learning is an area of growing interest in machine learning (Dzeroski & Lavrac, 2001; Friedman et al.,
1999; Raedt & Kersting, 2003). Xu et al. (2006) introduced the infinite hidden relational model (IHRM)
which views relational learning in context of the entity-relationship database model with entities, attributes and
relations (compare also (Kemp et al., 2006)). In the IHRM, for each entity a latent variable is introduced. The
latent variable is the only parent of the other entity attributes and is a parent of relationship attributes. The
number of states in each latent variable is entity class specific. Therefore it is sensible to work with Dirichlet
process (DP) mixture models in which each entity class can optimize its own representational complexity in a
self-organized way. For our discussion it is sufficient to say that we integrate a DP mixture model into the IHRM
by simply letting the number of hidden states for each entity class approach infinity. Thus, a natural outcome
of the IHRM is a clustering of the entities providing interesting insight into the structure of the domain.
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !






