|
| 1 | +package zhao.algorithmMagic.algorithm.differenceAlgorithm; |
| 2 | + |
| 3 | +import org.apache.log4j.Logger; |
| 4 | +import zhao.algorithmMagic.algorithm.OperationAlgorithm; |
| 5 | +import zhao.algorithmMagic.algorithm.OperationAlgorithmManager; |
| 6 | +import zhao.algorithmMagic.exception.OperatorOperationException; |
| 7 | +import zhao.algorithmMagic.exception.TargetNotRealizedException; |
| 8 | +import zhao.algorithmMagic.operands.coordinate.Coordinate; |
| 9 | +import zhao.algorithmMagic.operands.coordinate.FloatingPointCoordinates; |
| 10 | +import zhao.algorithmMagic.operands.coordinate.IntegerCoordinates; |
| 11 | +import zhao.algorithmMagic.utils.ASClass; |
| 12 | +import zhao.algorithmMagic.utils.ASMath; |
| 13 | + |
| 14 | +/** |
| 15 | + * Java类于 2022/10/19 11:38:33 创建 |
| 16 | + * 布雷柯蒂斯距离（Bray Curtis Distance）主要用于生态学和环境科学，计算坐标之间的距离。该距离取值在[ 0 , 1 ] [0,1][0,1]之间，也可以用来计算样本之间的差异。 |
| 17 | + * <p> |
| 18 | + * Bray Curtis Distance is mainly used in ecology and environmental science to calculate the distance between coordinates. The distance is between [ 0 , 1 ] [0,1][0,1] and can also be used to calculate the difference between samples. |
| 19 | + * |
| 20 | + * @author zhao |
| 21 | + */ |
| 22 | +public class BrayCurtisDistance<I extends IntegerCoordinates<I> & Coordinate<I>, D extends FloatingPointCoordinates<?>> implements DifferenceAlgorithm<D> { |
| 23 | + |
| 24 | + protected final Logger logger; |
| 25 | + protected final String AlgorithmName; |
| 26 | + |
| 27 | + protected BrayCurtisDistance() { |
| 28 | + this.AlgorithmName = "BrayCurtisDistance"; |
| 29 | + this.logger = Logger.getLogger("BrayCurtisDistance"); |
| 30 | + } |
| 31 | + |
| 32 | + protected BrayCurtisDistance(String AlgorithmName) { |
| 33 | + this.logger = Logger.getLogger(AlgorithmName); |
| 34 | + this.AlgorithmName = AlgorithmName; |
| 35 | + } |
| 36 | + |
| 37 | + /** |
| 38 | + * 获取到该算法的类对象。 |
| 39 | + * <p> |
| 40 | + * Get the class object of the algorithm. |
| 41 | + * |
| 42 | + * @param Name 该算法的名称 |
| 43 | + * @return 算法类对象 |
| 44 | + * @throws TargetNotRealizedException 当您传入的算法名称对应的组件不能被成功提取的时候会抛出异常 |
| 45 | + * <p> |
| 46 | + * An exception will be thrown when the component corresponding to the algorithm name you passed in cannot be successfully extracted |
| 47 | + */ |
| 48 | + public static <II extends IntegerCoordinates<II> & Coordinate<II>, DD extends FloatingPointCoordinates<?>> BrayCurtisDistance<II, DD> getInstance(String Name) { |
| 49 | + if (OperationAlgorithmManager.containsAlgorithmName(Name)) { |
| 50 | + OperationAlgorithm operationAlgorithm = OperationAlgorithmManager.getInstance().get(Name); |
| 51 | + if (operationAlgorithm instanceof BrayCurtisDistance<?, ?>) { |
| 52 | + return ASClass.transform(operationAlgorithm); |
| 53 | + } else { |
| 54 | + throw new TargetNotRealizedException("您提取的[" + Name + "]算法被找到了，但是它不属于ChebyshevDistance类型，请您为这个算法重新定义一个名称。\n" + |
| 55 | + "The [" + Name + "] algorithm you ParameterCombination has been found, but it does not belong to the ChebyshevDistance type. Please redefine a name for this algorithm."); |
| 56 | + } |
| 57 | + } else { |
| 58 | + BrayCurtisDistance<II, DD> brayCurtisDistance = new BrayCurtisDistance<>(Name); |
| 59 | + OperationAlgorithmManager.getInstance().register(brayCurtisDistance); |
| 60 | + return brayCurtisDistance; |
| 61 | + } |
| 62 | + } |
| 63 | + |
| 64 | + /** |
| 65 | + * @return 该算法组件的名称，也是一个识别码，在获取算法的时候您可以通过该名称获取到算法对象 |
| 66 | + * <p> |
| 67 | + * The name of the algorithm component is also an identification code. You can obtain the algorithm object through this name when obtaining the algorithm. |
| 68 | + */ |
| 69 | + @Override |
| 70 | + public String getAlgorithmName() { |
| 71 | + return this.AlgorithmName; |
| 72 | + } |
| 73 | + |
| 74 | + /** |
| 75 | + * 算法模块的初始化方法，在这里您可以进行组件的初始化方法，当初始化成功之后，该算法就可以处于就绪的状态，一般这里就是将自己添加到算法管理类中 |
| 76 | + * <p> |
| 77 | + * The initialization method of the algorithm module, here you can perform the initialization method of the component, when the initialization is successful, the algorithm can be in a ready state, generally here is to add yourself to the algorithm management class |
| 78 | + * |
| 79 | + * @return 初始化成功或失败。 |
| 80 | + * <p> |
| 81 | + * Initialization succeeded or failed. |
| 82 | + */ |
| 83 | + @Override |
| 84 | + public boolean init() { |
| 85 | + if (!OperationAlgorithmManager.containsAlgorithmName(this.getAlgorithmName())) { |
| 86 | + OperationAlgorithmManager.getInstance().register(this); |
| 87 | + return true; |
| 88 | + } else { |
| 89 | + return false; |
| 90 | + } |
| 91 | + } |
| 92 | + |
| 93 | + /** |
| 94 | + * 计算两个事物之间从差异系数百分比 |
| 95 | + * <p> |
| 96 | + * Calculate the percentage difference from the coefficient of difference between two things |
| 97 | + * |
| 98 | + * @param value1 差异参数1 |
| 99 | + * <p> |
| 100 | + * Difference parameter 1 |
| 101 | + * @param value2 差异参数2 |
| 102 | + * <p> |
| 103 | + * Difference parameter 2 |
| 104 | + * @return 差异系数 |
| 105 | + * <p> |
| 106 | + * Coefficient of Difference |
| 107 | + */ |
| 108 | + @Override |
| 109 | + public double getDifferenceRatio(D value1, D value2) { |
| 110 | + int numberOfDimensions1 = value1.getNumberOfDimensions(); |
| 111 | + int numberOfDimensions2 = value2.getNumberOfDimensions(); |
| 112 | + if (numberOfDimensions1 == numberOfDimensions2) { |
| 113 | + logger.info("ⁿ∑₁ |(DV1(n) - DV2(n))| / ⁿ∑₁ DV1(n) + ⁿ∑₁ DV2(n)"); |
| 114 | + return getDifferenceRatio(value1.toArray(), value2.toArray()); |
| 115 | + } else { |
| 116 | + throw new OperatorOperationException("BrayCurtisDistance算法运算出现错误，在进行两个坐标之间差异系数运算的时候，发现坐标的维度不同。\n" + |
| 117 | + "There is an error in the Bray Curtis Distance algorithm operation. When the difference coefficient between the two coordinates is calculated, it is found that the dimensions of the coordinates are different.\n" + |
| 118 | + "Number Of Dimensions => value1[" + numberOfDimensions1 + "] value2[" + numberOfDimensions2 + "]"); |
| 119 | + } |
| 120 | + } |
| 121 | + |
| 122 | + /** |
| 123 | + * 计算两个事物之间从差异系数百分比 |
| 124 | + * <p> |
| 125 | + * Calculate the percentage difference from the coefficient of difference between two things |
| 126 | + * |
| 127 | + * @param value1 差异参数1 |
| 128 | + * <p> |
| 129 | + * Difference parameter 1 |
| 130 | + * @param value2 差异参数2 |
| 131 | + * <p> |
| 132 | + * Difference parameter 2 |
| 133 | + * @return 差异系数 |
| 134 | + * <p> |
| 135 | + * Coefficient of Difference |
| 136 | + */ |
| 137 | + public double getDifferenceRatio(I value1, I value2) { |
| 138 | + int numberOfDimensions1 = value1.getNumberOfDimensions(); |
| 139 | + int numberOfDimensions2 = value2.getNumberOfDimensions(); |
| 140 | + if (numberOfDimensions1 == numberOfDimensions2) { |
| 141 | + logger.info("ⁿ∑₁ |(IV1(n) - IV2(n))| / ⁿ∑₁ IV1(n) + ⁿ∑₁ IV2(n)"); |
| 142 | + return getDifferenceRatio(value1.toArray(), value2.toArray()); |
| 143 | + } else { |
| 144 | + throw new OperatorOperationException("BrayCurtisDistance算法运算出现错误，在进行两个坐标之间差异系数运算的时候，发现坐标的维度不同。\n" + |
| 145 | + "There is an error in the Bray Curtis Distance algorithm operation. When the difference coefficient between the two coordinates is calculated, it is found that the dimensions of the coordinates are different.\n" + |
| 146 | + "Number Of Dimensions => value1[" + numberOfDimensions1 + "] value2[" + numberOfDimensions2 + "]"); |
| 147 | + } |
| 148 | + } |
| 149 | + |
| 150 | + /** |
| 151 | + * 计算两个数组之间的布雷柯蒂斯距离 |
| 152 | + * <p> |
| 153 | + * Calculate the BrayCurtisDistance between two arrays |
| 154 | + * |
| 155 | + * @param doubles1 计算差异数组1 |
| 156 | + * <p> |
| 157 | + * Calculate difference array 1 |
| 158 | + * @param doubles2 计算差异数组2 |
| 159 | + * <p> |
| 160 | + * Calculate difference array 2 |
| 161 | + * @return Coefficient of Difference |
| 162 | + */ |
| 163 | + public double getDifferenceRatio(double[] doubles1, double[] doubles2) { |
| 164 | + double molecule = 0; |
| 165 | + double denominator = 0; |
| 166 | + for (int i = 0; i < doubles1.length; i++) { |
| 167 | + double v1 = doubles1[i]; |
| 168 | + double v2 = doubles2[i]; |
| 169 | + molecule += ASMath.absoluteValue(v1 - v2); |
| 170 | + denominator += v1 + v2; |
| 171 | + } |
| 172 | + logger.info("(ⁿ∑₁ |(V1(n) - V2(n))| / ⁿ∑₁ V1(n) + ⁿ∑₁ V2(n)) = (" + molecule + " / " + denominator + ")"); |
| 173 | + return molecule >= denominator ? 1 : molecule / denominator; |
| 174 | + } |
| 175 | + |
| 176 | + /** |
| 177 | + * 计算两个数组之间的布雷柯蒂斯距离 |
| 178 | + * <p> |
| 179 | + * Calculate the BrayCurtisDistance between two arrays |
| 180 | + * |
| 181 | + * @param ints1 Calculate difference array 1 |
| 182 | + * @param ints2 Calculate difference array 2 |
| 183 | + * @return Coefficient of Difference |
| 184 | + */ |
| 185 | + public int getDifferenceRatio(int[] ints1, int[] ints2) { |
| 186 | + int molecule = 0; |
| 187 | + int denominator = 0; |
| 188 | + for (int i = 0; i < ints1.length; i++) { |
| 189 | + int v1 = ints1[i]; |
| 190 | + int v2 = ints2[i]; |
| 191 | + molecule += ASMath.absoluteValue(v1 - v2); |
| 192 | + denominator += v1 + v2; |
| 193 | + } |
| 194 | + logger.info("(ⁿ∑₁ |(V1(n) - V2(n))| / ⁿ∑₁ V1(n) + ⁿ∑₁ V2(n)) = (" + molecule + " / " + denominator + ")"); |
| 195 | + return molecule >= denominator ? 1 : molecule / denominator; |
| 196 | + } |
| 197 | +} |
0 commit comments