Implement given algorithm in Scheme programming language for clustering data points given in a dataset D. Assume an ordering of D where ith data point has index i.
- K
- ε (≤ K)
- MinPts (≤ K)
- Sparsify Similarity Matrix
- Construct the shared neighbor graph G
- Identify core points
- Form clusters using core points
- Identify noise points
- Assign border points to clusters
Each input would be given in a file in the following format. First line would contain five space separated parameters as follows.
- N D K ε MinPts
- N = Number of points in the dataset
- D = Dimensions of each point
- K, ε, MinPts are parameters for the algorithm
- This is followed by N lines each representing a data point of D dimensions.