Grid-ODF: Detecting Outliers Effectively and Efficiently in Large Multi-dimensional Databases
Author(s) -
Wei Wang,
Ji Zhang,
Hai H. Wang
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-30818-0
DOI - 10.1007/11596448_113
Subject(s) - outlier , computer science , grid , anomaly detection , data mining , local outlier factor , rank (graph theory) , database , algorithm , artificial intelligence , mathematics , geometry , combinatorics
[Abstract]: 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 of Outlying 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-\udODF 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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom