paper-with-me

홈 › Papers

Demystifying Relational Latent Representations

2017-05-16 · Sebastijan Dumančić, Hendrik Blockeel

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 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.

📄 PDF Abstract BibTeX arXiv:1705.05785

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringRelational Reasoning

Similar Papers 제목 키워드 기반

Scalable Deep Generative Relational Models with High-Order Node Dependence

2019-11-04 · Xuhui Fan, Bin Li, Scott Anthony Sisson, Caoyuan Li 외

We propose a probabilistic framework for modelling and exploring the latent structure of relational data. Given feature information for the nodes in a network, the scalable deep generative relational model (SDREM) builds…

Data AugmentationLink PredictionVocal Bursts Intensity Prediction

KBLRN : End-to-End Learning of Knowledge Base Representations with Latent, Relational, and Numerical Features

2017-09-14 · Alberto Garcia-Duran, Mathias Niepert

We present KBLRN, a framework for end-to-end learning of knowledge base representations from latent, relational, and numerical features. KBLRN integrates feature types with a novel combination of neural representation le…

Knowledge Base CompletionRepresentation Learning

Multi-Relational Classification via Bayesian Ranked Non-Linear Embeddings

2019-08-06 · The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD ’19) 2019 8 · Ahmed Rashed; Josif Grabocka; Lars Schmidt-Thieme

The task of classifying multi-relational data spans a wide range of domains such as document classification in citation networks, classification of emails, and protein labeling in proteins interaction graphs. Current sta…

ClassificationDocument ClassificationGeneral ClassificationHeterogeneous Node Classification+2

Learning Relational Representations with Auto-encoding Logic Programs

2019-03-29 · Sebastijan Dumancic, Tias Guns, Wannes Meert, Hendrik Blockeel

Deep learning methods capable of handling relational data have proliferated over the last years. In contrast to traditional relational learning methods that leverage first-order logic for representing such data, these de…

Deep LearningRelational ReasoningRepresentation Learning

Scalable Deep Generative Relational Model with High-Order Node Dependence

2019-12-01 · NeurIPS 2019 12 · Xuhui Fan, Bin Li, Caoyuan Li, Scott Sisson 외

In this work, we propose a probabilistic framework for relational data modelling and latent structure exploring. Given the possible feature information for the nodes in a network, our model builds up a deep architecture …

Data AugmentationLink PredictionVocal Bursts Intensity Prediction