Nothing Special   »   [go: up one dir, main page]

Skip to main content

Mining at Most Top-K% Spatio-temporal Outlier Based Context: A Summary of Results

  • Conference paper
Artificial Intelligence and Computational Intelligence (AICI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7003))

  • 2170 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Han, J.W., Kamber, M.: Data mining concepts and techniques. Morgan Kaufmann Publishers, San Francisco (2001)

    MATH  Google Scholar 

  2. Shekhar, S., Chawla, S.: Spatial databases: a tour. Prentice Hall, Englewood Cliffs (2003)

    Google Scholar 

  3. Breunig, M.M., Kriegel, H.-P., Ng, R.T., Sander, J.: Lof: Identifying density-based local outliers. In: SIGMOD Conference (2000)

    Google Scholar 

  4. Moonesinghe, H.D.K., Tan, P.N.: Outlier detection using random walks. In: ICTAI (2006)

    Google Scholar 

  5. Kou, Y., Lu, C.T., Chen, D.: Spatial weighted outlier detection. In: SDM (2006)

    Google Scholar 

  6. Wang, X., Davidson, I.: Discovering contexts and contextual outliers using random walks in graphs. In: ICDM 2009 (2009)

    Google Scholar 

  7. Chandola, V., Banerjee, A., Kumar, V.: Anomaly detection: a survey. ACM Comput. Surv. 41(3) (2009)

    Google Scholar 

  8. Skillicorn, D.B.: Detecting anomalies in graphs. In: ISI (2007)

    Google Scholar 

  9. Liu, F.T., Ting, K.M., Zhou, Z.H.: Isolation forest. In: ICDM, pp. 413–422 (2008)

    Google Scholar 

  10. Barnet, V., Lewis, T.: Outlier in statistical data. John Wiley&Sons, New York (1994)

    Google Scholar 

  11. Chung, F.: Spectral graph theory. American Mathematical Society, Providence (1997)

    Google Scholar 

  12. Song, X., Wu, M., Jermaine, C.M., Ranka, S.: Conditional anomaly detection. IEEE Trans. Knowl. Data Eng. 19(5) (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Z., Gu, C., Ruan, T., Duan, C. (2011). Mining at Most Top-K% Spatio-temporal Outlier Based Context: A Summary of Results. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23887-1_87

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23887-1_87

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23886-4

  • Online ISBN: 978-3-642-23887-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics