基于DBSCAN算法的欧几里得度量数据聚类matlab仿真+代码仿真操作视频

function [ labels, NeighborPts ] = growCluster( D, labels, P, NeighborPts, C, eps, MinPts ) % labels(P) = C; i = 1; while i <= length(NeighborPts) % Get the next point from the queue. Pn = NeighborPts(i); if labels(Pn) == -1 labels(Pn) = C; % Otherwise, if Pn isn't already assigned, assign it as part of C. elseif labels(Pn) == 0 % Add Pn to cluster C (Assign cluster label C). labels(Pn) = C; % Find all the neighbors of Pn PnNeighborPts = regionQuery(D, Pn, eps); if length(PnNeighborPts) >= MinPts for j = 1 : length(PnNeighborPts) flag = false; for k = 1 : length(NeighborPts) if PnNeighborPts(j) == NeighborPts(k) flag = true; break end end if flag == false NeighborPts = [NeighborPts; PnNeighborPts(j)]; break; end end % If Pn *doesn't* have enough neighbors, then it's an outlier end end % Advance to the next point in the FIFO queue. i = i + 1; % We've finished growing cluster C! end end