Date of Original Version

2013

Type

Conference Proceeding

Rights Management

Copyright © SIAM

Abstract or Description

In this paper, we propose a single low-dimensional representation for entities found in different datasets on the web. Our proposed PIC-D embeddings can represent large D-partite graphs using small number of dimensions enabling fast similarity queries. Our experiments show that this representation can be constructed in small amount of time (linear in number of dimensions). We demonstrate how it can be used for variety of similarity queries like set expansion, automatic set instance acquisition, and column classification. Our approach results in comparable precision with respect to task specific baselines and up to two orders of magnitude improvement in terms of query response time.

DOI

10.1137/1.9781611972832.57

Share

COinS
 

Published In

Proceedings of the 2013 SIAM International Conference on Data Mining, 512-520.