Unsupervised learning neural network with convex constraint: Structure and algorithm

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a kind of unsupervised learning neural network model, which has special structure and can realize an evaluation and classification of many groups by the compression of data and the reduction of dimension. The main characteristics of the samples are learned after being trained. In order to realize unsupervised learning of neural network structure with convex constraint, an iterative computation method is proposed that makes use of alternating projection between two convex sets. The final example proves that this method can detect instructions without a mass of supervised data and it converges fast. © 2007 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Tong, H., Liu, T., & Tong, Q. (2008). Unsupervised learning neural network with convex constraint: Structure and algorithm. Neurocomputing, 71(4–6), 620–625. https://doi.org/10.1016/j.neucom.2007.03.016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free