A collection of clustering algorithms. Currently this crate provides DBSCAN, HDBSCAN and OPTICS.
The following example shows how to cluster points using DBSCAN.
use ndarray::array;
use petal_clustering::{Dbscan, Fit};
let points = array![[1., 2.], [2., 2.], [2., 2.3], [8., 7.], [8., 8.], [25., 80.]];
let clustering = Dbscan::new(3.0, 2).fit(&points);
assert_eq!(clustering.0.len(), 2); // two clusters found
assert_eq!(clustering.0[&0], [0, 1, 2]); // the first three points in Cluster 0
assert_eq!(clustering.0[&1], [3, 4]); // [8., 7.] and [8., 8.] in Cluster 1
assert_eq!(clustering.1, [5]); // [25., 80.] doesn't belong to any clusterCopyright 2019-2024 Petabi, Inc.
Licensed under Apache License, Version 2.0 (the "License"); you may not use this crate except in compliance with the License.
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See LICENSE for the specific language governing permissions and limitations under the License.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be licensed as above, without any additional terms or conditions.