java dbscan_DBSCAN算法的java实现

DBSCAN (Density-Based Spatial Clustering of Applications with Noise) is a data clustering algorithm proposed by Martin Ester, Hans-Peter Kriegel, Jörg Sander and Xiaowei Xu in 1996. It is a density based clustering algorithm because it finds a number of clusters starting from the estimated density distribution of corresponding nodes. DBSCAN is one of the most common clustering algorithms and also most cited in scientific literature.

DBSCAN是一种基于密度的聚类算法，它的基本原理就是给定两个参数，ξ和minp，其中 ξ可以理解为半径，算法将在这个半径内查找样本，minp是一个以ξ为半径查找到的样本个数n的限制条件，只要n>=minp，查找到的样本点就是核心样本点，算法的具体描述见参考文件1，下边是这个算法的java实现：

首先定义一个Point类，代表样本点：1: package com.sunzhenxing;2:3: public class Point {4: private int x;5: private int y;6: private boolean isKey;7: private boolean isClassed;8:9: public boolean isKey() {10: return isKey;11: }12: public void setKey(boolean isKey) {13: this.isKey =