Borkar, V. and Meyn, S.P. (2010) Oja's algorithm for graph clustering and Markov spectral decomposition. In: 3rd International ICST Conference on Performance Evaluation Methodologies and Tools.
![[thumbnail of 10014.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "10014.pdf")
PDF
10014.pdf
Download (346kB)
Abstract
Given a positive definite matrix M and an integer Nm ≥ 1, Oja's subspace algorithm will provide convergent estimates of the first Nm eigenvalues of M along with the corresponding eigenvectors. It is a common approach to principal component analysis. This paper introduces a normalized stochastic-appr
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 08:52 |
| Last Modified: | 18 Apr 2026 03:32 |
| URI: | http://eprints.eai.eu/id/eprint/1928 |
Actions (login required)
- View Item