達成するK最近傍アルゴリズムjava

K Nearest Neighbor Algorithm Java Achieve

package knn import java.util.HashMap import java.util.Map import java.util.PriorityQueue public class KNN { public String getKnnValue(double[][] value, String[] tags, int k, double[] verifyValue) { String tag = null if (value == null || tags == null || verifyValue == null || k <1) { // para error } else { if (value.length == tags.length && value[0].length == verifyValue.length) { PriorityQueue queue = new PriorityQueue(k + 1) for (int i = 0 i k) { queue.poll() } } Map map = new HashMap() for (Item item : queue) { Item countItem = null if (!map.containsKey(item.strValue)) { map.put(item.strValue, new Item(0, item.strValue)) } countItem = map.get(item.strValue) countItem.numValue = countItem.numValue + 1.0 } queue.clear() queue.addAll(map.values()) tag = queue.poll().strValue } } return tag } private double getOuDistance(double[] fs, double[] validateValue) { double value = 0 for (int i = 0 i < fs.length i++) { value += Math.pow((fs[i] - validateValue[i]), 2.0) } return Math.sqrt(value) } private class Item implements Comparable { public Item(double num, String str) { this.numValue = num this.strValue = str } public double numValue = 0 public String strValue @Override public int compareTo(Item o) { if (numValue> o.numValue) { return -1 } else if (numValue