Cart (Loading....) | Create Account
Close category search window
 

Feature extraction from data structures with unsupervised recursive neural networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Goller, C. ; Inst. fur Inf., Tech. Univ. Munchen, Germany ; Gori, M. ; Maggini, M.

In the case of static data of high dimension it is often useful to reduce the dimensionality before performing pattern recognition and learning tasks. One of the main reasons for this is that models for lower-dimensional data usually have fewer parameters to be determined. The problem of finding fixed-length vector representations for labelled directed ordered acyclic graphs (DOAGs) can be regarded as a feature extraction problem in which the dimensionality of the input space is infinite. We address the fundamental problem of finding fixed-length vector representations for DOAGs in an unsupervised way using a maximum entropy approach. Some preliminary experiments on image retrieval are reported

Published in:

Neural Networks, 1999. IJCNN '99. International Joint Conference on  (Volume:2 )

Date of Conference:

Jul 1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.