Computational Intelligence and Security

Volume 3801 of the series Lecture Notes in Computer Science pp 765-770

Grid-ODF: Detecting Outliers Effectively and Efficiently in Large Multi-dimensional Databases

  • Wei WangAffiliated withCollege of Educational Science, Nanjing Normal University
  • , Ji ZhangAffiliated withFalculty of Computer Science, Dalhousie University
  • , Hai WangAffiliated withSobey School of Business, Saint Mary’s University

* Final gross prices may vary according to local VAT.

Get Access


In this paper, we will propose a novel outlier mining algorithm, called Grid-ODF, that takes into account both the local and global perspectives of outliers for effective detection. The notion ofOutlying Degree Factor(ODF), that reflects the factors of both the density and distance, is introduced to rank outliers. A grid structure partitioning the data space is employed to enable Grid-ODF to be implemented efficiently. Experimental results show that Grid-ODF outperforms existing outlier detection algorithms such as LOF and KNN-distance in terms of effectiveness and efficiency.