SubClu: The SubClu Algorithm for Subspace Clustering

Description Usage Arguments References See Also Examples

View source: R/subclu.R

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

1
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<c3><b6>ger Density-Connected Subspace Clustering for High-Dimensional Data

See Also

Other subspace.clustering.algorithms: CLIQUE; FIRES; P3C; ProClus

Examples

1
2
data("subspace_dataset")
SubClu(subspace_dataset,epsilon=1,minSupport=5)

Example output

OpenJDK 64-Bit Server VM warning: Can't detect initial thread stack location - find_vma failed
Subspace clustering generated by the package Subspace, containing 4 clusters.Warning message:
system call failed: Cannot allocate memory 

subspace documentation built on May 30, 2017, 2:39 a.m.

Related to SubClu in subspace...