Clustering ellipses for anomaly detection
Clustering ellipses for anomaly detection
复制标题
DOI：
10.1016/j.patcog.2010.07.024
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Masud Moshtaghi;T. Havens;J. Bezdek;L. Park;C. Leckie;Sutharshan Rajasegarar;J. Keller;M. Palaniswami-M.-Palan
中科院分区：
文献类型：
--
作者：
Masud Moshtaghi;T. Havens;J. Bezdek;L. Park;C. Leckie;Sutharshan Rajasegarar;J. Keller;M. Palaniswami-M.-Palan
Comparing, clustering and merging ellipsoids are problems that arise in various applications, e.g., anomaly detection in wireless sensor networks and motif-based patterned fabrics. We develop a theory underlying three measures of similarity that can be used to find groups of similar ellipsoids in p-space. Clusters of ellipsoids are suggested by dark blocks along the diagonal of a reordered dissimilarity image (RDI). The RDI is built with the recursive iVAT algorithm using any of the three (dis) similarity measures as input and performs two functions: (i) it is used to visually assess and estimate the number of possible clusters in the data; and (ii) it offers a means for comparing the three similarity measures. Finally, we apply the single linkage and CLODD clustering algorithms to three two-dimensional data sets using each of the three dissimilarity matrices as input. Two data sets are synthetic, and the third is a set of real WSN data that has one known second order node anomaly. We conclude that focal distance is the best measure of elliptical similarity, iVAT images are a reliable basis for estimating cluster structures in sets of ellipsoids, and single linkage can successfully extract the indicated clusters.
