MinMaxNormalize 规一化算法

public class MinMaxNormalize {

	/**
	 * 线性归一化 公式:X(norm) = (X - min) / (max - min)
	 *
	 * @param points     原始数据
	 * @param conversion 是否行转列
	 * @return 归一化后的数据
	 */
	public static double[] normalize(double[][] points, boolean conversion) {
		if (points == null || points.length < 1) {
			return new double[0];
		}
		//新数组
		double[][] newPoints = new double[points[0].length][points.length];
		if (conversion) {
			for (int i = 0; i < points.length; i++) {
				for (int j = 0; j < points[i].length; j++) {
					newPoints[j][i] = points[i][j];
				}
			}
		} else {
			newPoints = points;
		}

		Arrays.stream(newPoints).forEach(val -> {
			log.info("newPoints val:{}", val);
		});

		double[][] p = new double[newPoints.length][newPoints[0].length];
		for (int j = 0; j < newPoints[0].length; j++) {
			for (int i = 0; i < newPoints.length; i++) {
				p[i] = minMax(newPoints[i]);
			}
		}

		Arrays.stream(p).forEach(val -> {
			log.info("p val:{}", val);
		});
		double[] sumArry = Arrays.stream(p).mapToDouble(val -> Arrays.stream(val).sum()).toArray();
		double[] norArry = proportion(sumArry);
		log.info("norArry:{}", norArry);
		return norArry;
	}

	private static double[] minMax(double[] points) {
		double[] p = new double[points.length];
		double maxV = maxV(points);
		double minV = minV(points);
		for (int i = 0; i < points.length; i++) {
			p[i] = maxV == minV ? minV : (points[i] - minV) / (maxV - minV);
		}
		return p;
	}

	private static double[] proportion(double[] points) {
		double[] p = new double[points.length];
		double sumNum = Arrays.stream(points).sum();
		log.info("sumNum:{}", sumNum);
		for (int i = 0; i < points.length; i++) {
			p[i] = NumberUtil.round(points[i] / sumNum, 3).doubleValue();
		}
		return p;
	}


	/**
	 * 获取矩阵的某一列
	 *
	 * @param points points
	 * @param column column
	 * @return double[]
	 */
	public static double[] getMatrixCol(double[][] points, int column) {
		double[] matrixJ = new double[points.length];
		for (int i = 0; i < points.length; i++) {
			matrixJ[i] = points[i][column];
		}
		return matrixJ;
	}

	/**
	 * 获取数组中的最小值
	 *
	 * @param matrixJ matrixJ
	 * @return v
	 */
	public static double minV(double[] matrixJ) {
		return Arrays.stream(matrixJ).min().getAsDouble();
	}

	/**
	 * 获取数组中的最大值
	 *
	 * @param matrixJ matrixJ
	 * @return v
	 */
	public static double maxV(double[] matrixJ) {
		return Arrays.stream(matrixJ).max().getAsDouble();
	}

}

  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值