c++实现DBSCAN(抄来的),看了很多只有这个靠谱

DBSCAN.h

#if !defined(_DBSCAN_H_INCLUDED_)
#define _DBSCAN_H_INCLUDED_

#include <iostream>
#include <sstream>
#include <fstream>
#include <vector>
#include <ctime>
#include <cstdlib>
#include <limits>
#include <cmath>
#include <stack>
#include <map>

using namespace std;

enum
{
	pointType_UNDO,
	pointType_NOISE,
	pointType_BORDER,
	pointType_CORE

};

class point{
public:
	float x;
	float y;
	int cluster;
	int pointType;  //1 noise 2 border 3 core
	int pts;        //points in MinPts 
	int corePointID;
	vector<int> corepts;
	int  visited;
	void init( );
	point () ;
	point (float a,float b,int c){
		x = a;
		y = b;
		cluster = c;
	};
};


float stringToFloat(string i);
vector<point> openFile(const char* dataset);
float squareDistance(point a,point b);
void DBSCAN(vector<point> &dataset,float Eps,int MinPts);
#endif 

DBSCAN.cpp

#include "DBSCAN.h"

int clusterID=0;

void point::init( )
{
	cluster=0;
	pointType= pointType_UNDO ;//pointType_NOISE pointType_UNDO
	pts= 0 ;
	visited = 0;
	corePointID=-1;
}


float stringToFloat(string i){
	stringstream sf;
	float score=0;
	sf<<i;
	sf>>score;
	return score;
}

vector<point> openFile(const char* dataset){
	fstream file;
	file.open(dataset,ios::in);
	if(!file) 
	{
		//cout <<"Open File Failed!" <<endl;
		vector<point> a;
		return a;
	} 
	vector<point> data;
	int i=1;
	while(!file.eof()){
		string temp;
		file>>temp;
		int split = temp.find(',',0);
		point p(stringToFloat(temp.substr(0,split)),stringToFloat(temp.substr(split+1,temp.length()-1)),i++);
		data.push_back(p);
	}
	file.close();
	//cout<<"successful!"<<endl;
	return data;
}

float squareDistance(point a,point b){
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

void DBSCAN(vector<point> &dataset,float Eps,int MinPts){
	int len = dataset.size();//数据长度
	for(int i=0;i<len;i++)//参数初始化
	{
		dataset[i].init();
	}

	vector<vector <float>> distP2P(len);

	//calculate pts
	//cout<<"calculate pts"<<endl;
	for(int i=0;i<len;i++){
		for(int j=0;j<len;j++){//i+1
			float distance= squareDistance(dataset[i],dataset[j]);
			distP2P[i].push_back(distance);//disp for debug
			if(distance<=Eps){
				dataset[i].pts++;
			}
		}
	}
	//core point 
	//cout<<"core point "<<endl;
	vector<point> corePoint;
	for(int i=0;i<len;i++){
		int tempPts=dataset[i].pts;
		if(tempPts>=MinPts) {
			dataset[i].pointType = pointType_CORE;
			dataset[i].corePointID=i;
			corePoint.push_back(dataset[i]);
		}
	}
	//cout<<"joint core point"<<endl;

	//joint core point
	int numCorePoint=corePoint.size(); //core point number

	for(int i=0;i<numCorePoint;i++){
		for(int j=0;j<numCorePoint;j++){
			float distTemp=distP2P[corePoint[i].corePointID][corePoint[j].corePointID];//display for debug
			if(distTemp<=Eps){//squareDistance(corePoint[i],corePoint[j])
				corePoint[i].corepts.push_back(j);//other point orderID link to core point
			}
		}
	}
	for(int i=0;i<numCorePoint;i++){
		stack<point*> ps;
		if(corePoint[i].visited == 1) continue;
		clusterID++;
		corePoint[i].cluster=clusterID; //create a new cluster
		ps.push(&corePoint[i]);
		point *v;
		while(!ps.empty()){
			v = ps.top();
			v->visited = 1;
			ps.pop();
			for(int j=0;j<v->corepts.size();j++){
				if(corePoint[v->corepts[j]].visited==1) continue;
				corePoint[v->corepts[j]].cluster = corePoint[i].cluster;
				corePoint[v->corepts[j]].visited = 1;
				ps.push(&corePoint[v->corepts[j]]);	
			}
		}	

	}

	//cout<<"border point,joint border point to core point"<<endl;
	//border point,joint border point to core point
	for(int i=0;i<len;i++){
		for(int j=0;j<numCorePoint;j++){
			float distTemp=distP2P[i][corePoint[j].corePointID];
			if(distTemp<=Eps) {
				dataset[i].pointType = pointType_BORDER;
				dataset[i].cluster = corePoint[j].cluster;
				break;
			}
		}
	}
	//return dataset;
	//cout << "output" << endl;
	//output
	//display  
	//for(int i=0;i<len;i++){
	//	cout<<"第"<<i+1<<"个数据: "<<dataset[i].x<<","<<dataset[i].y<<","<<dataset[i].cluster<<"\n";
	//}
	//save in .txt format named clustering.txt
	//fstream clustering;
	//clustering.open("clustering.txt",ios::out);
	//for(int i=0;i<len;i++){
//		clustering<<dataset[i].x<<","<<dataset[i].y<<","<<dataset[i].cluster<<"\n";
//	}
//	clustering.close();
}

使用：

#include "DBSCAN.h"
int main(int argc, char** argv) {
	vector<point> dataset;
	//dataset[0].x = 1;
	//dataset[0].y = 2;
	//dataset[1].x = 2;
	//dataset[1].y = 2;
	//dataset[2].x = 2;
	//dataset[2].y = 3;
	//dataset[3].x = 8;
	//dataset[3].y = 7;
	//dataset[4].x = 8;
	//dataset[4].y = 8;
	//dataset[5].x = 25;
	//dataset[5].y = 80;
	point p1(1,2,0);
	dataset.push_back(p1);
	point p2(2, 2, 1);
	dataset.push_back(p2);
	point p3(2, 3, 2);
	dataset.push_back(p3);
	point p4(8,7, 3);
	dataset.push_back(p4);
	point p5(8, 8, 4);
	dataset.push_back(p5);
	point p6(25, 80, 5);
	dataset.push_back(p6);
	DBSCAN(dataset, 3, 2);
	
	for (int i = 0; i < 6; i++) {
		cout << "第" << i + 1 << "个数据: " << dataset[i].x << "," << dataset[i].y << "," << dataset[i].cluster << "\n";//cluster为聚类结果的标签，从0开始，eg:0,1,2,3,4,5
	}
	return 0;
}