{"title":"Rank based Least-squares Independent Component Analysis","authors":"Jafar Rahmanishamsi, A. Dolati","doi":"10.29252/JSRI.14.2.247","DOIUrl":null,"url":null,"abstract":". In this paper, we propose a nonparametric rank-based alternative to the least-squares independent component analysis algorithm developed. The basic idea is to estimate the squared-loss mutual information, which used as the objective function of the algorithm, based on its copula density version. Therefore, no marginal densities have to be estimated. We provide empirical evaluation of the proposed algorithm through simulation and real data analysis. Since the proposed algorithm uses rank values rather than the actual values of the observations, it is extremely robust to the outliers and suffers less from the presence of noise than the other algorithms.","PeriodicalId":422124,"journal":{"name":"Journal of Statistical Research of Iran","volume":"489 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Statistical Research of Iran","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29252/JSRI.14.2.247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
. In this paper, we propose a nonparametric rank-based alternative to the least-squares independent component analysis algorithm developed. The basic idea is to estimate the squared-loss mutual information, which used as the objective function of the algorithm, based on its copula density version. Therefore, no marginal densities have to be estimated. We provide empirical evaluation of the proposed algorithm through simulation and real data analysis. Since the proposed algorithm uses rank values rather than the actual values of the observations, it is extremely robust to the outliers and suffers less from the presence of noise than the other algorithms.