val of_pyobject : Py.Object.t -> tval to_pyobject : t -> Py.Object.tval create :
?eps:float ->
?min_samples:int ->
?metric:[ `String of string | `Callable of Py.Object.t ] ->
?metric_params:Py.Object.t ->
?algorithm:[ `Auto | `Ball_tree | `Kd_tree | `Brute ] ->
?leaf_size:int ->
?p:float ->
?n_jobs:[ `Int of int | `None ] ->
unit ->
tPerform DBSCAN clustering from vector array or distance matrix.
DBSCAN - Density-Based Spatial Clustering of Applications with Noise. Finds core samples of high density and expands clusters from them. Good for data which contains clusters of similar density.
Read more in the :ref:`User Guide <dbscan>`.
Parameters ---------- eps : float, default=0.5 The maximum distance between two samples for one to be considered as in the neighborhood of the other. This is not a maximum bound on the distances of points within a cluster. This is the most important DBSCAN parameter to choose appropriately for your data set and distance function.
min_samples : int, default=5 The number of samples (or total weight) in a neighborhood for a point to be considered as a core point. This includes the point itself.
metric : string, or callable, default='euclidean' The metric to use when calculating distance between instances in a feature array. If metric is a string or callable, it must be one of the options allowed by :func:`sklearn.metrics.pairwise_distances` for its metric parameter. If metric is "precomputed", X is assumed to be a distance matrix and must be square. X may be a :term:`Glossary <sparse graph>`, in which case only "nonzero" elements may be considered neighbors for DBSCAN.
.. versionadded:: 0.17 metric *precomputed* to accept precomputed sparse matrix.
metric_params : dict, default=None Additional keyword arguments for the metric function.
.. versionadded:: 0.19
algorithm : 'auto', 'ball_tree', 'kd_tree', 'brute', default='auto' The algorithm to be used by the NearestNeighbors module to compute pointwise distances and find nearest neighbors. See NearestNeighbors module documentation for details.
leaf_size : int, default=30 Leaf size passed to BallTree or cKDTree. This can affect the speed of the construction and query, as well as the memory required to store the tree. The optimal value depends on the nature of the problem.
p : float, default=None The power of the Minkowski metric to be used to calculate distance between points.
n_jobs : int or None, default=None The number of parallel jobs to run. ``None`` means 1 unless in a :obj:`joblib.parallel_backend` context. ``-1`` means using all processors. See :term:`Glossary <n_jobs>` for more details.
Attributes ---------- core_sample_indices_ : array, shape = n_core_samples Indices of core samples.
components_ : array, shape = n_core_samples, n_features Copy of each core sample found by training.
labels_ : array, shape = n_samples Cluster labels for each point in the dataset given to fit(). Noisy samples are given the label -1.
Examples -------- >>> from sklearn.cluster import DBSCAN >>> import numpy as np >>> X = np.array([1, 2], [2, 2], [2, 3],
... [8, 7], [8, 8], [25, 80]) >>> clustering = DBSCAN(eps=3, min_samples=2).fit(X) >>> clustering.labels_ array( 0, 0, 0, 1, 1, -1) >>> clustering DBSCAN(eps=3, min_samples=2)
See also -------- OPTICS A similar clustering at multiple values of eps. Our implementation is optimized for memory usage.
Notes ----- For an example, see :ref:`examples/cluster/plot_dbscan.py <sphx_glr_auto_examples_cluster_plot_dbscan.py>`.
This implementation bulk-computes all neighborhood queries, which increases the memory complexity to O(n.d) where d is the average number of neighbors, while original DBSCAN had memory complexity O(n). It may attract a higher memory complexity when querying these nearest neighborhoods, depending on the ``algorithm``.
One way to avoid the query complexity is to pre-compute sparse neighborhoods in chunks using :func:`NearestNeighbors.radius_neighbors_graph <sklearn.neighbors.NearestNeighbors.radius_neighbors_graph>` with ``mode='distance'``, then using ``metric='precomputed'`` here.
Another way to reduce memory and computation time is to remove (near-)duplicate points and use ``sample_weight`` instead.
:class:`cluster.OPTICS` provides a similar clustering with lower memory usage.
References ---------- Ester, M., H. P. Kriegel, J. Sander, and X. Xu, "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise". In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, Portland, OR, AAAI Press, pp. 226-231. 1996
Schubert, E., Sander, J., Ester, M., Kriegel, H. P., & Xu, X. (2017). DBSCAN revisited, revisited: why and how you should (still) use DBSCAN. ACM Transactions on Database Systems (TODS), 42(3), 19.
val fit :
?y:Py.Object.t ->
?sample_weight:Ndarray.t ->
x:[ `Ndarray of Ndarray.t | `SparseMatrix of Csr_matrix.t ] ->
t ->
tPerform DBSCAN clustering from features, or distance matrix.
Parameters ---------- X : array-like or sparse matrix, shape (n_samples, n_features), or (n_samples, n_samples) Training instances to cluster, or distances between instances if ``metric='precomputed'``. If a sparse matrix is provided, it will be converted into a sparse ``csr_matrix``.
sample_weight : array, shape (n_samples,), optional Weight of each sample, such that a sample with a weight of at least ``min_samples`` is by itself a core sample; a sample with a negative weight may inhibit its eps-neighbor from being core. Note that weights are absolute, and default to 1.
y : Ignored Not used, present here for API consistency by convention.
Returns ------- self
val fit_predict :
?y:Py.Object.t ->
?sample_weight:Ndarray.t ->
x:[ `Ndarray of Ndarray.t | `SparseMatrix of Csr_matrix.t ] ->
t ->
Ndarray.tPerform DBSCAN clustering from features or distance matrix, and return cluster labels.
Parameters ---------- X : array-like or sparse matrix, shape (n_samples, n_features), or (n_samples, n_samples) Training instances to cluster, or distances between instances if ``metric='precomputed'``. If a sparse matrix is provided, it will be converted into a sparse ``csr_matrix``.
sample_weight : array, shape (n_samples,), optional Weight of each sample, such that a sample with a weight of at least ``min_samples`` is by itself a core sample; a sample with a negative weight may inhibit its eps-neighbor from being core. Note that weights are absolute, and default to 1.
y : Ignored Not used, present here for API consistency by convention.
Returns ------- labels : ndarray, shape (n_samples,) Cluster labels. Noisy samples are given the label -1.
val get_params : ?deep:bool -> t -> Py.Object.tGet parameters for this estimator.
Parameters ---------- deep : bool, default=True If True, will return the parameters for this estimator and contained subobjects that are estimators.
Returns ------- params : mapping of string to any Parameter names mapped to their values.
val set_params : ?params:(string * Py.Object.t) list -> t -> tSet the parameters of this estimator.
The method works on simple estimators as well as on nested objects (such as pipelines). The latter have parameters of the form ``<component>__<parameter>`` so that it's possible to update each component of a nested object.
Parameters ---------- **params : dict Estimator parameters.
Returns ------- self : object Estimator instance.
Attribute core_sample_indices_: see constructor for documentation
val to_string : t -> stringPrint the object to a human-readable representation.
val show : t -> stringPrint the object to a human-readable representation.
val pp : Format.formatter -> t -> unitPretty-print the object to a formatter.