Skip to main content

Finding Unusual Correlation Using Matrix Decompositions

  • Conference paper
Intelligence and Security Informatics (ISI 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3073))

Included in the following conference series:

  • 1644 Accesses

Abstract

One important aspect of terrorism detection is the ability to detect small-scale, local correlations against a background of large-scale, diffuse correlations. Several matrix decompositions transform correlation into other properties: for example, Singular Value Decomposition (SVD) transforms correlation into proximity, and SemiDiscrete Decomposition (SDD) transforms correlation into regions of increased density. Both matrix decompositions are effective at detecting local correlation in this setting, but they are much more effective when combined.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. Achlioptas, D., McSherry, F.: Fast computation of low rank matrix approximations. In: STOC: ACM Symposium on Theory of Computing, STOC (2001)

    Google Scholar 

  2. Baker, W.E., Faulkner, R.B.: The social organization of conspiracy: Illegal networks in the heavy electrical equipment industry. American Sociological Review 58, 837–860 (1993)

    Article  Google Scholar 

  3. Berry, M.W., Dumais, S.T., O’Brien, G.W.: Using linear algebra for intelligent information retrieval. SIAM Review 37(4), 573–595 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Coffman, T., Greenblatt, S., Marcus, S.: Graph-based technologies for intelligence analysis. CACM 47(3), 45–47 (2004)

    Google Scholar 

  5. Garton, L., Haythornthwaite, C., Wellman, B.: Studying online social networks. Journal of Computer-Mediated Communication 3(1) (1997)

    Google Scholar 

  6. Golub, G.H., van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  7. Hyvärinen, A., Oja, E.: Independent component analysis: Algorithms and applications. Neural Networks 13(4-5), 411–430 (2000)

    Article  Google Scholar 

  8. Jensen, D., Neville, J.: Data mining in social networks. Invited presentation to the National Academy of Sciences Workshop on Dynamic Social Network Modeling and Analysis (November 2003)

    Google Scholar 

  9. Jensen, D., Rattigan, M., Blau, H.: Information awareness: A prospective technical assessment. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003)

    Google Scholar 

  10. Kolda, G., O’Leary, D.P.: A semi-discrete matrix decomposition for latent semantic indexing in information retrieval. ACM Transactions on Information Systems 16, 322–346 (1998)

    Article  Google Scholar 

  11. Kolda, T.G., O’Leary, D.P.: Computation and uses of the semidiscrete matrix decomposition. ACM Transactions on Information Processing (1999)

    Google Scholar 

  12. Krebs, V.E.: Mapping networks of terrorist cells. Connections 24(3), 43–52 (2002)

    Google Scholar 

  13. McConnell, S., Skillicorn, D.B.: Semidiscrete decomposition: A bump hunting technique. In: Australasian Data Mining Workshop, December 2002, pp. 75–82 (2002)

    Google Scholar 

  14. Mooney, R.J., Melville, P., Tang, L.R., Shavlik, J., de Castro Dutra, I., Page, D., Costa, V.S.: Relational data mining with Inductive Logic Programming for link discovery. In: Proceedings of the National Science Foundation Workshop on Next Generation Data Mining (November 2002)

    Google Scholar 

  15. Newman, M., Watts, D.: Renormalization group analysis of the small-world network model. Physics Letters A 263, 341–346 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  16. O’Leary, D.P., Peleg, S.: Digital image compression by outer product expansion. IEEE Transactions on Communications 31, 441–444 (1983)

    Article  Google Scholar 

  17. Schölkopf, B., Platt, J.C., Shawe-Taylor, J., Smola, A.J., Williamson, R.C.: Estimating the support of a high-dimensional distribution. Technical Report MSRTR- 99-87, Microsoft Research (1999)

    Google Scholar 

  18. Taipale, K.A.: Data mining and domestic security: Connecting the dots to make sense of data. Columbia Science and Technology Law Review, 2 (December 2003)

    Google Scholar 

  19. Tax, D.M.J.: One Class Classification. PhD thesis, Technical University Delft (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skillicorn, D.B. (2004). Finding Unusual Correlation Using Matrix Decompositions. In: Chen, H., Moore, R., Zeng, D.D., Leavitt, J. (eds) Intelligence and Security Informatics. ISI 2004. Lecture Notes in Computer Science, vol 3073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25952-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25952-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22125-8

  • Online ISBN: 978-3-540-25952-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics