Skip to content
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
74 changes: 74 additions & 0 deletions src/main/java/com/thealgorithms/machinelearning/KNN.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,74 @@
package com.thealgorithms.machinelearning;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class KNN {

Check failure on line 8 in src/main/java/com/thealgorithms/machinelearning/KNN.java

View workflow job for this annotation

GitHub Actions / build

(design) HideUtilityClassConstructor: Utility classes should not have a public or default constructor.
public static class DataPoint {
double[] features;
String label;

public DataPoint(double[] features, String label) {
this.features = features;
this.label = label;
}
}

private static class DistancePair {
double distance;
String label;

public DistancePair(double distance, String label) {

Check failure on line 23 in src/main/java/com/thealgorithms/machinelearning/KNN.java

View workflow job for this annotation

GitHub Actions / build

(modifier) RedundantModifier: Redundant 'public' modifier.
this.distance = distance;
this.label = label;
}
}

public static double calculateEuclideanDistance(double[] point1, double[] point2) {
double sum = 0.0;
for (int i = 0; i < point1.length; i++) {
sum += Math.pow(point1[i] - point2[i], 2);
}
return Math.sqrt(sum);
}

public static String classify(List<DataPoint> dataset, double[] queryPoint, int k) {
List<DistancePair> distances = new ArrayList<>();

for (DataPoint p : dataset) {
double dist = calculateEuclideanDistance(p.features, queryPoint);
distances.add(new DistancePair(dist, p.label));
}

distances.sort(Comparator.comparingDouble(d -> d.distance));

List<String> topKLabels = new ArrayList<>();
for (int i = 0; i < Math.min(k, distances.size()); i++) {
topKLabels.add(distances.get(i).label);
}

String bestLabel = null;
int maxCount = -1;
for (String label : topKLabels) {
int count = Collections.frequency(topKLabels, label);
if (count > maxCount) {
maxCount = count;
bestLabel = label;
}
}
return bestLabel;
}

public static void main(String[] args) {
List<DataPoint> trainData = new ArrayList<>();
trainData.add(new DataPoint(new double[] {1.0, 2.0}, "ClassA"));
trainData.add(new DataPoint(new double[] {2.0, 3.0}, "ClassA"));
trainData.add(new DataPoint(new double[] {7.0, 8.0}, "ClassB"));

double[] target = new double[] {1.5, 2.5};
String prediction = classify(trainData, target, 3);
System.out.println("Predicted Category: " + prediction);
}
}
20 changes: 20 additions & 0 deletions src/test/java/com/thealgorithms/machinelearning/KNNTest.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
package com.thealgorithms.machinelearning;

import java.util.ArrayList;
import java.util.List;
import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;

public class KNNTest {
@Test
public void testClassifyStandard() {
List<KNN.DataPoint> dataset = new ArrayList<>();
dataset.add(new KNN.DataPoint(new double[] {1.0, 1.0}, "GroupA"));
dataset.add(new KNN.DataPoint(new double[] {1.5, 2.0}, "GroupA"));
dataset.add(new KNN.DataPoint(new double[] {8.0, 9.0}, "GroupB"));

double[] target = new double[] {1.2, 1.3};
String result = KNN.classify(dataset, target, 2);
Assertions.assertEquals("GroupA", result);
}
}
Loading