Clustering high dimensional datasets is challenging due to the curse of dimensionality. One approach to address this challenge is to search for subspace clusters, i.e., clusters present in subsets of attributes. Recently the cartification algorithm was proposed to find such subspace clusters. The distinguishing feature of this algorithm is that it operates on a neighborhood database, in which for every object only the identities of the k closest objects are stored. Cartification was shown to produce better results than other state-of-the-art subspace clustering algorithms, however, which clusters it detects was also found to depend heavily on the setting of the parameters. In other words, it is not robust to input parameters. In this paper, we propose a new approach called ranked cartification that produces more robust results than ordinary cartification. We develop a transformation that creates ranked matrices instead of neighborhood databases, we identify clusters in these ranked matrices. We demonstrate that this method is more robust than cartification in terms of cluster detection.
[1]
Bart Goethals,et al.
Efficient Cluster Detection by Ordered Neighborhoods
,
2015,
DaWaK.
[2]
Luc De Raedt,et al.
Ranked Tiling
,
2014,
ECML/PKDD.
[3]
Bart Goethals,et al.
Cartification: A Neighborhood Preserving Transformation for Mining High Dimensional Data
,
2013,
2013 IEEE 13th International Conference on Data Mining.
[4]
Ira Assent,et al.
Evaluating Clustering in Subspace Projections of High Dimensional Data
,
2009,
Proc. VLDB Endow..
[5]
Philip S. Yu,et al.
Fast algorithms for projected clustering
,
1999,
SIGMOD '99.
[6]
Hans-Peter Kriegel,et al.
Density-Connected Subspace Clustering for High-Dimensional Data
,
2004,
SDM.
[7]
Jörg Sander,et al.
Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering
,
2008,
KDD.
[8]
Jonathan Goldstein,et al.
When Is ''Nearest Neighbor'' Meaningful?
,
1999,
ICDT.