Skip to content

Latest commit

 

History

History
13 lines (10 loc) · 893 Bytes

README.md

File metadata and controls

13 lines (10 loc) · 893 Bytes
Raw

This is an implementation of the OPTICS (Ordering points to identify the clustering structure) algorithm which was done as part of an assignment in the Data Mining course at IIT Delhi (COL 870)

Usage:

  1. Compile using : sh 2014CS10220_compile.sh
  2. Run file using : sh 2014CS10220_optics.sh (reads input from file "data.tsv" and generates a file "2014CS10220_reachabilityDist.txt" which contains the reachability distances of the points in the order in which they were processed)
  3. Plot the bar graph(reachability distance) using : sh 2014CS10220_plot.sh (uses the file "2014CS10220_reachabilityDist.txt" generated in previous step)

KD-Tree has been used for finding the nearest neighbours and the core-distances of the points. KD-Tree library source : https://github.com/jlblancoc/nanoflann Functions used(from the KD-Tree library): findNeighbors() and radiusSearch()