Affiliations: [a] Merchant Marine College, Shanghai Maritime University, Shanghai, China | [b] College of Foreign Languages, Shanghai Maritime University, Shanghai, China | [c] Department of Mathematical Science, Schaefer School of Engineering and Science, Stevens Institute of Technology, Hoboken, NJ, USA | [d] College of Information Engineering, Shanghai Maritime University, Shanghai, China | [e] Merchant Marine College, Shanghai Maritime University, Shanghai, China
Abstract: Most density-based clustering algorithms have the problems of difficult parameter setting, high time complexity, poor noise recognition, and weak clustering for datasets with uneven density. To solve these problems, this paper proposes FOP-OPTICS algorithm (Finding of the Ordering Peaks Based on OPTICS), which is a substantial improvement of OPTICS (Ordering Points To Identify the Clustering Structure). The proposed algorithm finds the demarcation point (DP) from the Augmented Cluster-Ordering generated by OPTICS and uses the reachability-distance of DP as the radius of neighborhood eps of its corresponding cluster. It overcomes the weakness of most algorithms in clustering datasets with uneven densities. By computing the distance of the k-nearest neighbor of each point, it reduces the time complexity of OPTICS; by calculating density-mutation points within the clusters, it can efficiently recognize noise. The experimental results show that FOP-OPTICS has the lowest time complexity, and outperforms other algorithms in parameter setting and noise recognition.
