Substructure clustering on sequential 3d object datasets

Abstract

In this paper, we will look at substructure clustering of sequential 3d objects. A sequential 3d object is a set of points located in a three dimensional space that are linked up to form a sequence. Given a set of sequential 3d objects, our aim is to find significantly large substructures which are present in many of the sequential 3d objects. Unlike traditional subspace clustering methods in which objects are compared based on values in the same dimension, the matching dimensions between two 3d sequential objects are affected by both the translation and rotation of the objects and are thus not well defined. Instead, similarity between the objects are judge by computing a structural distance measurement call rmsd(Root Mean Square Distance) which require proper alignment (including translation and rotation) of the objects. As the computation of rmsd is expensive, we proposed a new measure call ald(Angel Length Distance) which is shown experiemntally to approximate rmsd. Based on aid, we define a new clustering model called sCluster and devise an algorithm for discovering all maximum sCluster in a 3d sequential dataset. Experiments are conducted to illustrate the efficiency and effectiveness of our algorithm.