By Topic

A novel approach to the convergence of unsupervised learning algorithms

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
$33 $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

2 Author(s)
Ruey-Wen Liu ; Dept. of Electr. Eng., Notre Dame Univ., IN ; Xie-Ting Ling

Unlike the conventional stochastic approach, an unsupervised learning algorithm is viewed as a deterministic system. A new concept of time-average invariance is introduced, which is a property of deterministic signals, but plays the role of stochastic signals that are stationary and ergodic. As such, deterministic-based analysis can be used for stochastic-like signals. Consequently, the complexity of convergence analysis is significantly reduced. The simplicity of the main theorem also suggests the possibility for the design of unsupervised learning algorithms. Two examples are given for illustration

Published in:

Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on  (Volume:1 )

Date of Conference:

30 Apr-3 May 1995