Description: The Molgedey and Schuster decorrelation algorithm, having square mixing matrix and no noise . Truncation is used for the time shifted matrix, and it is forced to be symmetric . The delay Tau is estimated .
The number of independent components are calculated using Bayes Information Criterion (BIC), with PCA for dimension reduction.-The Molgedey and Schuster decorrelation algorithm, having square mixing matrix and no noise . Truncation is used for the time shifted matrix, and it is forced to be symmetric . The delay Tau is estimated . The number of independent components are calculated using Bayes Information Criterion (BIC), with PCA for dimension reduction. Platform: |
Size: 12169 |
Author:海心 |
Hits:
Description: he algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization.
The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.
Platform: |
Size: 7730 |
Author:薛耀斌 |
Hits:
Description: ICA算法The algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization. The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.-ICA algorithm:The algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization. The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction. Platform: |
Size: 563873 |
Author:陈互 |
Hits:
Description: ICA算法The algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization. The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.-ICA algorithm:The algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization. The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction. Platform: |
Size: 563200 |
Author:陈互 |
Hits:
Description: The Molgedey and Schuster decorrelation algorithm, having square mixing matrix and no noise . Truncation is used for the time shifted matrix, and it is forced to be symmetric . The delay Tau is estimated .
The number of independent components are calculated using Bayes Information Criterion (BIC), with PCA for dimension reduction.-The Molgedey and Schuster decorrelation algorithm, having square mixing matrix and no noise . Truncation is used for the time shifted matrix, and it is forced to be symmetric . The delay Tau is estimated . The number of independent components are calculated using Bayes Information Criterion (BIC), with PCA for dimension reduction. Platform: |
Size: 12288 |
Author:海心 |
Hits:
Description: he algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization.
The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.
Platform: |
Size: 7168 |
Author:薛耀斌 |
Hits:
Search - Bayes Information Criterion