Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

please do it in java the data set are in a .txt file also if you want too you co

ID: 3696737 • Letter: P

Question

please do it in java

the data set are in a .txt file

also if you want too you could apply the k means clustering on the gpa only

Course Recommender System Recommender Systems are systems that offer a set of predictions, suggestions or opinions to help users in assessing and choosing items. These systems have become very common in the last few years and applied in several applications, such as in suggesting and predicting the most important books, movies, social tags, products, news and articles for various types of users. Registering the right course for a student is a critical issue, the student should consider the prerequisite of the course as well as his GPA and his academic year. Thus, building a recommender system that would help in decision making in the course registration process and predicting the expected grade. This can be performed using various techniques and methodologies, where the most important one is data mining. Data mining is a process of looking for specific patterns and knowledge from large databases and carrying out predictions for outputs. K-means clustering is a simple data mining technique, which used for cluster analysis to divide observations into k clusters, where each observation belongs to that cluster with the closest mean Therefore, this project aims to build a recommender system based on clustering technique or rdcing appropriate course to a student and the expected grade depend on his (GPA, academic year, and passed courses) for Computer Department INPUT: Student GPA, Student Academic Year, Current Semester Courses The number of credits (Courses) to be registered (recommend) OUTPUT List of courses and the expected grade for each course Sample Record Student ID Year GPA CurrentCourse-Grade 256 RegisteredCourse-Grade 0612207-B 0612363-A 0612221-C 2 2.76 ,0612201-B 0612262-C 0612203-A

Explanation / Answer

import static java.lang.Math.abs; import java.util.ArrayList; import java.util.Collections; import java.util.Scanner; public class KMean { int k; int noOfItems; ArrayList dataItems; ArrayList cz; ArrayList oldCz; ArrayList row; ArrayList groups; Scanner input; public KMean(int k, int noOfItems) { this.k = k; this.noOfItems = noOfItems; dataItems = new ArrayList(); cz = new ArrayList(); oldCz = new ArrayList(); row = new ArrayList(); groups = new ArrayList(); input = new Scanner(System.in); for (int i = 0; i