• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Learning Distributed Representations of Concepts from Relational Data (2000)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.demo.cs.brandeis.edu]
  • [www.gatsby.ucl.ac.uk]
  • [www.gatsby.ucl.ac.uk]
  • [www.cs.toronto.edu]
  • [www.cs.utoronto.ca]
  • [www.cs.toronto.edu]
  • [learning.cs.toronto.edu]
  • [learning.cs.toronto.edu]
  • [www.cs.utoronto.ca]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Alberto Paccanaro
Venue:IEEE Transactions on Knowledge and Data Engineering
Citations:6 - 2 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Paccanaro00learningdistributed,
    author = {Alberto Paccanaro},
    title = {Learning Distributed Representations of Concepts from Relational Data},
    journal = {IEEE Transactions on Knowledge and Data Engineering},
    year = {2000},
    volume = {13},
    pages = {200--0}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

In this paper we discuss methods for generalizing over relational data. Our approach is to learn distributed representations for the concepts that coincide with their semantic features and then to use these representations to make inferences. We present Linear Relational Embedding (LRE), a method that learns a mapping from the concepts into a feature-space by imposing the constraint that relations in this feature-space are modeled by linear operations. We then show that this linearity constrains the type of relations that LRE can represent. Finally, we introduce Non-Linear Relational Embedding (NLRE), and show that it can represent any relation.

Citations

2304 Learning Internal Representations by Error Propagation - Rumelhart, Hinton, et al. - 1986
2168 R.A.: Indexing by latent semantic analysis - Deerwester, Dumais, et al. - 1990
1313 Finding structure in time - Elman - 1990
764 S.: A solution to plato’s problem: The latent semantic analysis theory of acquisition, induction and representation of knowledge. Psychological Review 104 - Landauer, Dumais - 1997
299 Recursive distributed representations - Pollack - 1990
194 Probalistic interpretation of feedforward classification network outputs, with relationships to statistical pattern recognition - Bridle - 1990
154 Learning distributed representations of concepts - Hinton - 1986
132 Finite state automata and simple recurrent networks - Cleeremans, Servan-Schreiber, et al.
44 A scaled conjugate gradient algorithm for fast supervised learning - Mller - 1993
42 Separating style and content - Tenenbaum, Freeman - 1997
38 Learning humanlike knowledge by singular value decomposition: A progress report - Landauer, Laham - 1998
25 The LEABRA model of neural interactions and learning in the neocortex - O’Reilly
15 Multidimensional scaling by optimizing goodness of t to a nonmetric hypothesis - Kruskal - 1964
11 Learning and extracting state automata with second-order recurrent neural networks - Giles, Miller, et al. - 1992
1 Labeling RAAM. Connection Sci - Sperduti - 1994
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University