Unusual pattern detection in high dimensions

  • Authors:
  • Minh Quoc Nguyen;Leo Mark;Edward Omiecinski

  • Affiliations:
  • School of Computer Science, College of Computing, Georgia Institute of Technology, Atlanta, GA;School of Computer Science, College of Computing, Georgia Institute of Technology, Atlanta, GA;School of Computer Science, College of Computing, Georgia Institute of Technology, Atlanta, GA

  • Venue:
  • PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present an alternative approach to discover interesting unusual observations that can not be discovered by outlier detection techniques. The unusual pattern is determined according to the deviation of a group of observations from other observations and the number of observations in the group. To measure the degree of deviation, we introduce the concept of adaptive nearest neighbors that captures the natural similarity between two observations. The boundary points determined by the adaptive nearest neighbor algorithm are used to adjust the level of granularity. The adaptive nearest neighbors are then used to cluster the data set. Finally, we ran experiments on a real life data set to evaluate the result. According to the experiments, we discovered interesting unusual patterns that are overlooked by using outlier detection and clustering algorithms.