The SubClu Algorithm for Subspace Clustering
The SubClu Algorithm follows a bottom-up framework, in which one-dimensional clusters are generated with DBSCAN and then each cluster is expanded one dimension at a time into a dimension that is known to have a cluster that only differs in one dimension from this cluster. This expansion is done using DBSCAN with the same parameters that were used for the original DBSCAN that produced the clusters.
A Matrix of input data.
size of environment parameter for DBSCAN
minimum number of points parameter for DBSCAN
Karin Kailing, Hans-Peter Kriegel and Peer Kröger Density-Connected Subspace Clustering for High-Dimensional Data
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.