dbscan 1.2.2

dbscan 1.2.2 (2025-01-24)

Changes

• Removed dependence on the /bits/stdc++.h header.

dbscan 1.2.1 (2025-01-23)

Changes

• Various refactoring by m-muecke

New Features

• HDBSCAN gained parameter cluster_selection_epsilon to implement
  clusters selected from Malzer and Baum (2020).
• Functions ncluster() and nnoise() were added.
• hullplot now() marks noise as x.
• Added clplot().
• pointdensity now also accepts a dist object as input and has the new type
  "gaussian" to calculate a Gaussian kernel estimate.
• Added the DBCV index.

Bugfixes

• extractFOCS: Fixed total_score.
• Rewrote minimal spanning tree code.

dbscan_1.2.0

New Features

• dbscan has now tidymodels tidiers (glance, tidy, augment).
• kNNdistplot can now plot a range of k/minPts values.
• added stats::nobs methods for the clusterings.
• kNN and frNN now contains the used distance metric.

Changes

• dbscan component dist was renamed to metric.
• Removed redundant sort in kNNdistplot (reported by Natasza Szczypien).
• Refactoring use more performant anyNA(x) instead of any(is.na(x))
  and many more (by m-muecke).
• Reorganized the C++ source code.
• README now uses bibtex.
• Tests use now testthat edition 3 (m-muecke).

dbscan_1.1.10

New Features

• is.corepoint() for DBSCAN.
• coredist() and mrdist() for HDBSCAN.
• find connected components with comps().

Changes

• reachability plot now shows all undefined distances as a dashed line.

Bugfix

• memory leak in mrd calculation fixed.

dbscan_1.1.9

dbscan 1.1-9 (2022-01-10)

Changes

• We use now roxygen2.

New Features

• Added predict for hdbscan (as suggested by moredatapls)

dbscan_1.1-8

dbscan 1.1-8 (2021-04-26)

Bugfixes

• LOF: fixed numerical issues with k-nearest neighbor distance on Solaris.

dbscan 1.1-7 (2021-04-21)

Bugfixes

• Fixed description of k in knndistplot and added minPts argument.
• Fixed bug for tied distances in lof (reported by sverchkov).

Changes

• lof: the density parameter was changes to minPts to be consistent with the original paper and dbscan. Note that minPts = k + 1.

dbscan_1.1-6

Improvements

• Improved speed of LOF for large ks (following suggestions by eduardokapp).
• kNN: results is now not sorted again for kd-tree queries which is much faster (by a factor of 10).
• ANN library: annclose() is now only called once when the package is unloaded. This is in preparation to support persistent kd-trees using external pointers.
• hdbscan lost parameter xdist.

Bugfixes

• removed dependence on methods.
• fixed problem in hullplot for singleton clusters (reported by Fernando Archuby).
• GLOSH now also accepts data.frames.
• GLOSH returns now 0 instead of NaN if we have k duplicate points in the data.

dbscan_1.1-5

New Features

• kNN and frNN gained parameter query to query neighbors for points not in the data.
• sNN gained parameter jp to decide if the shared NN should be counted using the definition by Jarvis and Patrick.

dbscan_1.1-4

Bugfixes

• kNNdist now correctly returns the distances to the kth neighbor
  (reported by zschuster).
• dbscan: check eps and minPts parameters to avoid undefined results (reported by ArthurPERE).

New Features

• kNNdist gained parameter all to indicate if a matrix with the distance to all
  nearest neighbors up to k should be returned.

dbscan_1.1-3

Bugfix

• pointdensity was double counting the query point (reported by Marius Hofert).

dbscan_1.1-2

New Features

• OPTICS now calculates eps if it is omitted.

Bugfix

• Example now only uses igraph conditionally since it is unavailable
  on Solaris (reported by B. Ripley).