K-nearest neighbor (k-NN) java exercise 1

Breakable Boar answered on September 1, 2023 Popularity 1/10 Helpfulness 1/10

answer K-nearest neighbor (k-NN) java exercise 1

related K-nearest neighbor (k-NN) java

K-nearest neighbor (k-NN) java exercise 1

Comment

package com.company;

import java.util.ArrayList;

public class KNN {
    double[][] x;
    ArrayList<String> y;

    public KNN(double[][] x, ArrayList<String> y) {
        this.x = x;
        this.y = y;
    }
}

// 

package com.company;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.time.LocalDate;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;
import java.time.Duration;
import java.time.LocalDateTime;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        ArrayList<Driver> drivers = new ArrayList<>();
        drivers.add(new Driver(350, 650, 9, "+"));
        drivers.add(new Driver(3500, 880, 15.7, "+"));
        drivers.add(new Driver(2340, 550, 13.5, "*"));
        drivers.add(new Driver(235, 120, 9.25, "-"));
        drivers.add(new Driver(1200, 650, 6.4, "-"));
        drivers.add(new Driver(2700, 1350, 20.5, "+"));
        drivers.add(new Driver(3020, 1100, 7.4, "*"));
        drivers.add(new Driver(700, 640, 2.8, "+"));

        double[][] xArray = new double[drivers.toArray().length][3];
        ArrayList<String> yArray = new ArrayList<String>(drivers.toArray().length-1);

        for (int i = 0; i < drivers.size(); i++) {
            Driver driver = drivers.get(i);
            double[] driverData = new double[]{driver.getRent(), driver.getSize(), driver.getDistance()};
            xArray[i] = driverData;
            yArray.add(driver.getSentiment());
        }
        handleCommandLine(new KNN(xArray, yArray));

    }

    private static void handleCommandLine(KNN knn) {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        while (true) {
            System.out.println("Enter Apartment");
            Scanner scanner = new Scanner(System.in);
            String[] inputValues = scanner.nextLine().split(",");
            if (inputValues.length < 3) {
                System.out.println("Invalid input. Please enter at least 3 attributes.");
                continue;
            }
            System.out.print("Enter K: ");
            int k = scanner.nextInt();
            scanner.nextLine();
        }
    }
}

//

package com.company;

import java.util.ArrayList;

public class Driver {
    private double rent;
    private double size;
    private double distance;
    private String sentiment;

    public Driver(double rent, double size, double distance, String sentiment) {
        this.rent = rent;
        this.size = size;
        this.distance = distance;
        this.sentiment = sentiment;
    }

    @Override
    public String toString() {
        return "Rent =" + rent + ", Size =" + size + ", Distance=" + distance + ", Sentiment='" + sentiment;
    }

    public double getRent() {
        return rent;
    }

    public double getSize() {
        return size;
    }

    public double getDistance() {
        return distance;
    }

    public String getSentiment() {
        return sentiment;
    }
}

Popularity 1/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Sep 01 2023

Breakable Boar

0 Answers Avg Quality 2/10

Closely Related Answers

K-nearest neighbor (k-NN) java

Comment

import java.util.ArrayList;

public class Classify {

    public static void main(String[] args) {
        ArrayList<Point> point = new ArrayList<>();
        point.add(new Point(2,1,true));
        point.add(new Point(3,1,true));
        point.add(new Point(5,1,true));
        point.add(new Point(4,2,true));
        point.add(new Point(6,3,true));

        point.add(new Point(1,3,false));
        point.add(new Point(1,5,false));
        point.add(new Point(2,5,false));
        point.add(new Point(3,4,false));
        point.add(new Point(4,6,false));

        Point p = new Point(5,6);
        System.out.println(classify(point,p, 3));
    }

    public static Boolean classify(ArrayList<Point> pnt, Point p, int k) {
        int redCount = 0;
        int whiteCount = 0;

        for (int i = 0; i < pnt.size(); i++) {
            double distance = Math.sqrt(Math.pow(p.getX() - pnt.get(i).getX(), 2) + Math.pow(p.getY() - pnt.get(i).getY(), 2));
            if (distance < k) {
                if (pnt.get(i).getColor()) {
                    redCount++;
                } else {
                    whiteCount++;
                }
            }
        }
            return redCount > whiteCount;
        }
    }
    
    //
    
    public class Point {
    private int x;
    private int y;
    private Boolean color;


    public Point(int x, int y, boolean color) {
        this.x = x;
        this.y = y;
        this.color = color;
    }

    public Point(int x, int y) {
        this.x = x;
        this.y = y;
        this.color = null;
    }

    public int getX() {
        return x;
    }

    public int getY() {
        return y;
    }

    public Boolean getColor() {
        return color;
    }
}

Popularity 3/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Sep 01 2023

Breakable Boar

0 Answers Avg Quality 2/10

K-nearest neighbor (k-NN) java exercise 1

Contents

More Related Answers

K-nearest neighbor (k-NN) java exercise 1

Closely Related Answers

K-nearest neighbor (k-NN) java

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.