Warehouse Stock Clearance Sale

Grab a bargain today!


Computational Methods for Counterterrorism
By

Rating

Product Description
Product Details

Table of Contents

I Information Access.- On Searching in the #x201C;Real World#x201D;.- Signature-Based Retrieval of Scanned Documents Using Conditional Random Fields.- What Makes a Good Summary?.- A Prototype Search Toolkit.- II Text Analysis.- Unapparent Information Revelation: Text Mining for Counterterrorism.- Identification of Information.- Rich Language Analysis for Counterterrorism.- III Graphical Models.- Dicliques: Finding Needles in Haystacks.- Information Superiority via Formal Concept Analysis.- Reflexive Analysis of Groups.- Evaluating Self-Reflexion Analysis Using Repertory Grids.- IV Conflict Analysis.- Anticipating Terrorist Safe Havens from Instability Induced Conflict.- Applied Counterfactual Reasoning.- Adversarial Planning in Networks.- Gaming and Simulating Ethno-Political Conflicts.

About the Author

Shlomo Argamon is Associate Professor of Computer Science at the Illinois Institute of Technology, Chicago, IL, USA, since 2002. Prior to that, he had held academic positions at Bar-Ilan University, where he held a Fulbright Postdoctoral Fellowship (1994-96), and at the Jerusalem College of Technology. Dr. Argamon received his B.S. (1988) in Applied Mathematics from Carnegie-Mellon University, and his M.Phil. (1991) and Ph.D. (1994) in Computer Science from Yale University, where he was a Hertz Foundation Fellow. His current research interests lie mainly in the use of machine learning methods to aid in functional analysis of natural language, with particular focus on questions of style. During his career, Dr. Argamon has worked on a variety of problems in experimental machine learning, including robotic map-learning, theory revision, and natural language processing, and has published numerous research papers in these areas.

Ask a Question About this Product More...
 
This title is unavailable for purchase as none of our regular suppliers have stock available. If you are the publisher, author or distributor for this item, please visit this link.

Back to top