Adaptive Neighborhood Graph Construction for Inference in Multi-Relational Networks release_j6qez4542va7fcyqw3qf34qhsu

by Shobeir Fakhraei, Dhanya Sridhar, Jay Pujara, Lise Getoor

Released as a article .

2016  

Abstract

A neighborhood graph, which represents the instances as vertices and their relations as weighted edges, is the basis of many semi-supervised and relational models for node labeling and link prediction. Most methods employ a sequential process to construct the neighborhood graph. This process often consists of generating a candidate graph, pruning the candidate graph to make a neighborhood graph, and then performing inference on the variables (i.e., nodes) in the neighborhood graph. In this paper, we propose a framework that can dynamically adapt the neighborhood graph based on the states of variables from intermediate inference results, as well as structural properties of the relations connecting them. A key strength of our framework is its ability to handle multi-relational data and employ varying amounts of relations for each instance based on the intermediate inference results. We formulate the link prediction task as inference on neighborhood graphs, and include preliminary results illustrating the effects of different strategies in our proposed framework.
In text/plain format

Archived Files and Locations

application/pdf  959.1 kB
file_ld3l7csb5nakvij7f7lzcqzriu
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-07-02
Version   v1
Language   en ?
arXiv  1607.00474v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 396b4d58-c423-4c27-ba08-fc53f0205682
API URL: JSON