#include #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/io.hpp> #include <omp.h> #include 'mine.h'

using namespace boost::numeric::ublas;

// 计算矩阵列之间的MIC,并将结果存储在单列向量中 std::vector calc_mic(const matrix<double, column_major>& mat, int threads) { // 当样本量小于6个时,终止程序 if(mat.size1() < 6){ std::cerr << 'error: the number of data rows should be greater than 5.' << std::endl; exit(1); } if(mat.size2() < 2){ std::cerr << 'error: the number of data columns should be greater than 1.' << std::endl; exit(1); }

// 预分配结果向量的大小
std::vector<double> result(mat.size2() * (mat.size2() - 1) / 2, 0.0);

// 计算每列两两之间的mic系数
omp_set_num_threads(threads);
#pragma omp parallel for
for (size_t i = 0; i < mat.size2(); ++i) {
    MINE mine(0.5, 15, EST_MIC_APPROX);
    for (size_t j = i + 1; j < mat.size2(); ++j) {
        double x[mat.size1()];
        double y[mat.size1()];
        for (size_t k = 0; k < mat.size1(); ++k) {
            x[k] = mat(k, i);
            y[k] = mat(k, j);
        }
        mine.compute_score(x, y, mat.size1());
        // 将结果存储在向量中
        result[i * (mat.size2() - 1) / 2 + j - i - 1] = mine.mic(); 
    }
}
return result;

}

C++并行计算MIC矩阵并转换为单列向量

原文地址: https://www.cveoy.top/t/topic/fwmr 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录