File tree Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Original file line number Diff line number Diff line change @@ -20,7 +20,7 @@ first cluster" as a point solidly in the center that is very distant
20
20
from the second cluster. Equally, if the clustering algorithm supports
21
21
noise assignments, then points are simply assigned as "noise". We are
22
22
left with no idea as to which, if any cluster, they might have just
23
- missed the cur on being in.
23
+ missed the cut on being in.
24
24
25
25
The remedy for this is 'soft clustering' or 'fuzzy clustering'. In this
26
26
approach points are not assigned cluster labels, but are instead assigned
@@ -116,7 +116,7 @@ than ideal. The second way of looking at things is to consider how much
116
116
of an outlier the point is relative to each cluster -- using something
117
117
akin to the outlier scores from GLOSH. The advantage of this approach is
118
118
that it handles odd shaped clusters (even toroidal clusters) far better
119
- since it will explciitly follow the manifolds of the clusters. The down
119
+ since it will explicitly follow the manifolds of the clusters. The down
120
120
side of the outlier approach is that many points will all be equally
121
121
"outlying", particularly noise points. Our goal is to fuse these two
122
122
ideas.
You can’t perform that action at this time.
0 commit comments