Mining at most top-K% spatio-temporal outlier based context: a summary of results

Authors:
Zhanquan Wang;Chunhua Gu;Tong Ruan;Chao Duan
Affiliations:
Department of Computer Science and Engineering, East China University of Science and Technology, Shanghai, China;Department of Computer Science and Engineering, East China University of Science and Technology, Shanghai, China;Department of Computer Science and Engineering, East China University of Science and Technology, Shanghai, China;Department of Computer Science and Engineering, East China University of Science and Technology, Shanghai, China
Venue:
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
Year:
2011

Citing 7
Cited 0

LOF: identifying density-based local outliers

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Data mining: concepts and techniques

Data mining: concepts and techniques
Outlier Detection Using Random Walks

ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
Conditional Anomaly Detection

IEEE Transactions on Knowledge and Data Engineering
Isolation Forest

ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Anomaly detection: A survey

ACM Computing Surveys (CSUR)
Discovering Contexts and Contextual Outliers Using Random Walks in Graphs

ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Discovering STCOD is an important problem with many applications such as geological disaster monitoring, geophysical exploration, public safety and health etc. However, determining suitable interest measure thresholds is a difficult task. In the paper, we define the problem of mining at most top-K% STCOD patterns without using user-defined thresholds and propose a novel at most top-K% STCOD mining algorithm by using a graph based random walk model. Analytical and experimental results show that the proposed algorithm is correct and complete. Results show the proposed method is computationally more efficient than naive algorithms. The effectiveness of our methods is justified by empirical results on real data sets. It shows that the algorithms are effective and validate.