An Efficient Adaptive Minor Subspace Extraction Using Exact Nested Orthogonal Complement Structure
-
- MISONO Masaki
- Dept. of Communications & Integrated Systems, Tokyo Institute of Technology
-
- YAMADA Isao
- Dept. of Communications & Integrated Systems, Tokyo Institute of Technology The Institute of Electronics, Information and Communication Engineers
この論文をさがす
抄録
This paper presents a new adaptive minor subspace extraction algorithm based on an idea of Peng and Yi ('07) for approximating the single minor eigenvector of a covariance matrix. By utilizing the idea inductively in the nested orthogonal complement subspaces, the proposed algorithm succeeds to relax the numerical sensitivity which has been annoying conventional adaptive minor subspace extraction algorithms for example, Oja algorithm ('82) and its stabilized version: O-Oja algorithm ('02). Simulation results demonstrate that the proposed algorithm realizes more stable convergence than O-Oja algorithm.
収録刊行物
-
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
-
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E91-A (8), 1867-1874, 2008
一般社団法人 電子情報通信学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390282681288253312
-
- NII論文ID
- 10026850400
-
- NII書誌ID
- AA10826239
-
- ISSN
- 17451337
- 09168508
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可