Skip to main content

A Framework for Analyst Focus from Computed Significance

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Social Networks ((LNSN))

Abstract

Attention is the critical resource for intelligence analysts, so tools that provide focus are useful. One way to determine focus is by computing significance. In the context of a known model, new data can be placed on a spectrum defined by: normal, anomalous, interesting, novel, or random; and significance is greatest towards the middle of this spectrum. However, significance also depends on the mental state of the analyst (and the organization). A framework for understanding significance is defined, and its impact on the knowledge–discovery process is explored.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Notes

  1. 1.

    This is the random walk Laplacian.

References

  1. Abdulsalam, H., Skillicorn, D., Martin, P.: Classification using streaming random forests. In: {IEEE Transactions on Knowledge and Data Engineering}, vol. 22. (2010)

    Google Scholar 

  2. Bourassa, M., Skillicorn, D.: Hardening adversarial prediction with anomaly tracking. In: IEEE Intelligence and Security Informatics 2009, pp. 43–48. (2009)

    Google Scholar 

  3. Breiman, L.: Random forests. Mach. Learn. 45(1), 5–32 (2001)

    Article  MATH  Google Scholar 

  4. Brin, S., Page, L., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Stanford Digital Libraries Working Paper, 1998

    Google Scholar 

  5. Bryan, K., Leise, T.: The $25,000,000,000 eigenvector: The linear algebra behind. Google SIAM Rev. 48(3), 569–581 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Davies, E., Gladwell, G., Leydold, J., Stadler, P.: Discrete nodal domain theorems. Linear Algebr. Appl. 336(51) (2001)

    Google Scholar 

  7. Galloway, J., Simoff, S.: Digging in the details: A case study in network data mining. In: Intelligence and Security Informatics. Lecture Notes in Computer Science 3495, pp. 14–26. Springer, Berlin (2005)

    Google Scholar 

  8. Galloway, J., Simoff, S.: Network data mining: Discovering patterns of interaction between attributes. In: Advances in Knowledge Discovery and Data Mining. Lecture Notes in Computer Science 3918, pp. 410–414. Springer, Berlin (2006)

    Google Scholar 

  9. Jonas, J., Sokol, L.: Data Finds Data, chapter 9. O’Reilly Media, New York (2009)

    Google Scholar 

  10. Laloux, L., Cizeau, P., Potters, M., Bouchaud, J.-P.: Random Matrix Theory and Financial Correlations. World Scientific, Singapore (1999)

    Google Scholar 

  11. Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: Proceedings of the Twelfth International Conference on Information and Knowledge Management, pp.~556–559 (2003)

    Google Scholar 

  12. Schmidhuber, J.: Developmental robotics, optimal artifical curiosity, creativity, music, and the fine arts. Conn. Sci. 18(2), 173–187 (2006)

    Article  Google Scholar 

  13. Schmidhuber, J.: Simple algorithmic principles of discovery, subjective beauty, selective attention, curiosity & creativity. In: Corruble, V., Takeda, M., Suzuki, E. (eds.) Proceedings of the 10th International Conference on Discovery Science (DS 2007), LNAI 4755, pp. 26–38. (2007)

    Google Scholar 

  14. Skillicorn, D.: Detecting anomalies in graphs. In: 2007 IEEE International Conference on Intelligence and Security Informatics, pp. 209–216. (2007)

    Google Scholar 

  15. Skillicorn, D.: Understanding Complex Datasets: Data Mining with Matrix Decompositions. CRC, Boca Raton (2007)

    Book  Google Scholar 

  16. Tax, D.: One Class Classification. Ph.D. thesis, Technical University Delft (2000)

    Google Scholar 

  17. Treverton, G.: Reshaping National Intelligence for an Age of Information. Cambridge University Press, Cambridge (2001)

    Book  Google Scholar 

  18. Treverton, G.: Risks and riddles. Smithsonian Magazine, June 2007

    Google Scholar 

  19. Türker, A., Görgün, I., Conlan, O.: The challenge of content creation to facilitate personalized elearning experiences. Int. J. E-Learning 5(1), 11–17 (2006)

    Google Scholar 

  20. von Luxburg, U.: A tutorial on spectral clustering. Technical Report 149, Max Plank Institute for Biological Cybernetics, Aug 2006

    Google Scholar 

  21. Zhu, X., Goldberg, A.: Introduction to Semi-Supervised Learning. Synthesis Lectures on Artifical Intelligence and Machine Learning 6. Morgan & Claypool, San Rafael, CA (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Skillicorn .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag/Wien

About this chapter

Cite this chapter

Skillicorn, D., Bourassa, M.A.J. (2011). A Framework for Analyst Focus from Computed Significance. In: Wiil, U.K. (eds) Counterterrorism and Open Source Intelligence. Lecture Notes in Social Networks. Springer, Vienna. https://doi.org/10.1007/978-3-7091-0388-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-0388-3_3

  • Published:

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-7091-0387-6

  • Online ISBN: 978-3-7091-0388-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics