Independent component analysis based on genetic algorithms

Gaojin Wen, Chunxiao Zhang, Zhaorong Lin, Zhiming Shang, Hongming Wang, Qian Zhang
{"title":"Independent component analysis based on genetic algorithms","authors":"Gaojin Wen, Chunxiao Zhang, Zhaorong Lin, Zhiming Shang, Hongming Wang, Qian Zhang","doi":"10.1109/ICNC.2014.6975837","DOIUrl":null,"url":null,"abstract":"FastICA and Infomax are the most popular algorithms for calculating independent components. These two optimization process usually lead to unstable results. To overcome this drawback, a genetic algorithm for independent component analysis has been developed with enhancement of the independence of the resulting components. By modifying the FastICA to start from given initial point and adopting a new feasible fitness function, the original target of obtaining the maximum mutual independence is achieved. The proposed method is evaluated and tested on a numerical simulative data set from the measures of the normalized mutual information, negentropy and kurtosis, together with the accuracy of the estimated components and mixing vectors. Experimental results on simulated data demonstrate that compared to FastICA and Infomax, the proposed algorithm can give more accurate results together with stronger independence.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 10th International Conference on Natural Computation (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2014.6975837","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

FastICA and Infomax are the most popular algorithms for calculating independent components. These two optimization process usually lead to unstable results. To overcome this drawback, a genetic algorithm for independent component analysis has been developed with enhancement of the independence of the resulting components. By modifying the FastICA to start from given initial point and adopting a new feasible fitness function, the original target of obtaining the maximum mutual independence is achieved. The proposed method is evaluated and tested on a numerical simulative data set from the measures of the normalized mutual information, negentropy and kurtosis, together with the accuracy of the estimated components and mixing vectors. Experimental results on simulated data demonstrate that compared to FastICA and Infomax, the proposed algorithm can give more accurate results together with stronger independence.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于遗传算法的独立分量分析
FastICA和Infomax是最流行的计算独立组件的算法。这两种优化过程通常会导致不稳定的结果。为了克服这一缺点,开发了一种用于独立分量分析的遗传算法,增强了结果分量的独立性。通过对FastICA进行修改,使其从给定的初始点出发,并采用新的可行适应度函数,实现了获得最大相互独立性的原目标。从归一化互信息、负熵和峰度的度量,以及估计分量和混合向量的精度,在数值模拟数据集上对该方法进行了评估和测试。在模拟数据上的实验结果表明,与FastICA和Infomax相比,该算法可以给出更准确的结果,并且具有更强的独立性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Graph based K-nearest neighbor minutiae clustering for fingerprint recognition Applications of artificial intelligence technologies in credit scoring: A survey of literature Construction of linear dynamic gene regulatory network based on feedforward neural network A new dynamic clustering method based on nuclear field A multi-objective ant colony optimization algorithm based on the Physarum-inspired mathematical model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1