论文信息 - Extracting distributed representations of concepts and relations from positive and negative propositions

Extracting distributed representations of concepts and relations from positive and negative propositions

Linear relational embedding (LRE) was introduced previously by the authors (1999) as a means of extracting a distributed representation of concepts from relational data. The original formulation cannot use negative information and cannot properly handle data in which there are multiple correct answers. In this paper we propose an extended formulation of LRE that solves both these problems. We present results in two simple domains, which show that learning leads to good generalization.

Geoffrey E. Hinton | Alberto Paccanaro | A. Paccanaro

[1] J. Kruskal. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis , 1964 .

[2] Geoffrey E. Hinton,et al. Learning internal representations by error propagation , 1986 .

[3] Forrest W. Young. Multidimensional Scaling: History, Theory, and Applications , 1987 .

[4] Geoffrey E. Hinton. Learning distributed representations of concepts. , 1989 .

[5] T. Landauer,et al. Indexing by Latent Semantic Analysis , 1990 .

[6] Peter W. Foltz,et al. Learning Human-like Knowledge by Singular Value Decomposition: A Progress Report , 1997, NIPS.

[7] T. Landauer,et al. A Solution to Plato's Problem: The Latent Semantic Analysis Theory of Acquisition, Induction, and Representation of Knowledge. , 1997 .