Skip to content

Commit e68f611

Browse files
committed
Fix typos
1 parent e0f501c commit e68f611

2 files changed

Lines changed: 5 additions & 5 deletions

File tree

demo/dbscan-clustering-demo-v5.nlogo

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -225,9 +225,9 @@ This model demonstrates the use of the DBSCAN extension (https://github.com/chrf
225225

226226
The DBSCAN algorithm clusters items based on value proximity (based on the maximum permissible distance and a minimum number of items to form a cluster). Unlike K-means it operates without specifying the number of expected clusters in advance, which makes it useful for exploration of unknown data (more details in the link at the bottom).
227227

228-
For variable-based clustering of agents, individuals are clustered based on the value difference of their wealth levels and the minimum number of members required to form cluster.
228+
For variable-based clustering of agents, individuals are clustered based on the value difference of their wealth levels and the minimum number of members required to form a cluster.
229229

230-
For location-based clustering, individuals are clustered based on their proximity and the minimum number of members required to form cluster.
230+
For location-based clustering, individuals are clustered based on their proximity and the minimum number of members required to form a cluster.
231231

232232
Variable-based clustering of patches (as opposed to individuals) is only available for NetLogo 6. Check the corresponding demo model.
233233

demo/dbscan-clustering-demo-v6.nlogo

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -292,11 +292,11 @@ This model demonstrates the use of the DBSCAN extension (https://github.com/chrf
292292

293293
The DBSCAN algorithm clusters items based on value proximity (based on the maximum permissible distance and a minimum number of items to form a cluster). Unlike K-means it operates without specifying the number of expected clusters in advance, which makes it useful for exploration of unknown data (more details in the link at the bottom).
294294

295-
For variable-based clustering of agents, individuals are clustered based on the value difference of their wealth levels and the minimum number of members required to form cluster.
295+
For variable-based clustering of agents, individuals are clustered based on the value difference of their wealth levels and the minimum number of members required to form a cluster.
296296

297-
For location-based clustering, individuals are clustered based on their proximity and the minimum number of members required to form cluster.
297+
For location-based clustering, individuals are clustered based on their proximity and the minimum number of members required to form a cluster.
298298

299-
For variable-based clustering of patches (as opposed to individuals), patches are clustered based on resource level and the minimum number of members required to form cluster.
299+
For variable-based clustering of patches (as opposed to individuals), patches are clustered based on resource level and the minimum number of members required to form a cluster.
300300

301301
## HOW TO USE IT
302302

0 commit comments

Comments
 (0)