A fast fixed-point algorithm for complexity pursuit
文献类型：期刊论文
| 作者 | Shi, ZW; Tang, HW; Tang, YY |
| 刊名 | NEUROCOMPUTING
 |
| 出版日期 | 2005-03-01 |
| 卷号 | 64页码:529-536 |
| 关键词 | independent component analysis blind source separation complexity pursuit projection pursuit time series |
| ISSN号 | 0925-2312 |
| 英文摘要 | Complexity pursuit is a recently developed algorithm using the gradient descent for separating interesting components from time series. It is an extension of projection pursuit to time series data and the method is closely related to blind separation of time-dependent source signals and independent component analysis (ICA). In this paper, a fixed-point algorithm for complexity pursuit is introduced. The fixed-point algorithm inherits the advantages of the well-known FastICA algorithm in ICA, which is very simple, converges fast, and does not need choose any learning step sizes. (c) 2005 Elsevier B.V. All rights reserved. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000227922700031 |
| 源URL | [http://ir.psych.ac.cn/handle/311026/14070]  |
| 专题 | 心理研究所_中国科学院心理研究所回溯数据库(1956-2010) |
| 作者单位 | 1.Dalian Univ Technol, Inst Computat Biol & Bioinformat, Dalian 116023, Peoples R China 2.Dalian Univ Technol, Inst Neuroinformat, Dalian 116023, Peoples R China 3.Chinese Acad Sci, Lab Visual Informat Proc, Beijing 100101, Peoples R China 4.Chinese Acad Sci, Key Lab Mental Hlth, Beijing 100101, Peoples R China |
| 推荐引用方式 GB/T 7714 | Shi, ZW,Tang, HW,Tang, YY. A fast fixed-point algorithm for complexity pursuit[J]. NEUROCOMPUTING,2005,64:529-536. |
| APA | Shi, ZW,Tang, HW,&Tang, YY.(2005).A fast fixed-point algorithm for complexity pursuit.NEUROCOMPUTING,64,529-536. |
| MLA | Shi, ZW,et al."A fast fixed-point algorithm for complexity pursuit".NEUROCOMPUTING 64(2005):529-536. |
入库方式： OAI收割
来源：心理研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。