Demystifying Relational Latent Representations

• Published in: Inductive Logic Programming Vol. 10759; pp. 63 - 77
• Main Authors: Dumančić, Sebastijan, Blockeel, Hendrik
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 01.01.2018; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Clustering; Deep learning; Relational learning; Unsupervised representation learning
• DOI: 10.1007/978-3-319-78090-0_5
• ISBN: 9783319780894; 3319780891
• ISSN: 0302-9743

Latent features learned by deep learning approaches have proven to be a powerful tool for machine learning. They serve as a data abstraction that makes learning easier by capturing regularities in data explicitly. Their benefits motivated their adaptation to the relational learning context. In our previous work, we introduce an approach that learns relational latent features by means of clustering instances and their relations. The major drawback of latent representations is that they are often black-box and difficult to interpret. This work addresses these issues and shows that (1) latent features created by clustering are interpretable and capture interesting properties of data; (2) they identify local regions of instances that match well with the label, which partially explains their benefit; and (3) although the number of latent features generated by this approach is large, often many of them are highly redundant and can be removed without hurting performance much.