Unsupervised learning neural network with convex constraint: Structure and algorithm

Authors:
Hengqing Tong;Tianzhen Liu;Qiaoling Tong
Affiliations:
Department of Mathematics,Wuhan University of Technology, Wuhan, Hubei 430070, PR China;Department of Mathematics,Wuhan University of Technology, Wuhan, Hubei 430070, PR China;Department of Electronic Science and Technology, Huazhong University of Science and Technology, Wuhan, Hubei 430074, PR China
Venue:
Neurocomputing
Year:
2008

Citing 2
Cited 1

Supervised versus unsupervised binary-learning by feedforward neural networks

Machine Learning
Evaluation model and its iterative algorithm by alternating projection

Mathematical and Computer Modelling: An International Journal

A self-organized neural comparator

Neural Computation

Quantified Score

Hi-index	0.01

Visualization

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.