Unsupervised learning neural network with convex constraint: Structure and algorithm

  • Tong H
  • Liu T
  • Tong Q
  • 4


    Mendeley users who have this article in their library.
  • 2


    Citations of this article.


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.

Author-supplied keywords

  • Convex constraint
  • Iterative algorithm by alternating projection
  • Neural network
  • Unsupervised learning

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Hengqing Tong

  • Tianzhen Liu

  • Qiaoling Tong

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free