SubClu: The SubClu Algorithm for Subspace Clustering
Description
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.
Usage
SubClu(data, epsilon = 4, minSupport = 4)
Arguments
data
A Matrix of input data.
epsilon
size of environment parameter for DBSCAN
minSupport
minimum number of points parameter for DBSCAN
References
Karin Kailing, Hans-Peter Kriegel and Peer Kröger
Density-Connected Subspace Clustering for High-Dimensional Data