메뉴 건너뛰기




Volumn , Issue , 2012, Pages

Where do I start? Algorithmic strategies to guide intelligence analysts

Author keywords

intelligence analysis; maximum entropy; starting points; text mining

Indexed keywords

ASSOCIATION ANALYSIS; DESIGN RECOMMENDATIONS; DOCUMENT COLLECTION; INTELLIGENCE ANALYSIS; INTELLIGENCE ANALYSTS; ITERATIVE REFINEMENT; MAXIMUM ENTROPY; MULTIPLE DOCUMENTS; PROBABILISTIC MODELING; TEXT MINING; USER FEEDBACK;

EID: 84864982549     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2331791.2331794     Document Type: Conference Paper
Times cited : (7)

References (38)
  • 2
    • 33745797297 scopus 로고    scopus 로고
    • Model-guided Information Discovery for Intelligence Analysis
    • R. Alonso and H. Li. Model-guided Information Discovery for Intelligence Analysis. In CIKM '05, pages 269-270, 2005.
    • (2005) CIKM '05 , pp. 269-270
    • Alonso, R.1    Li, H.2
  • 3
    • 76849088735 scopus 로고    scopus 로고
    • Principles and Tools for Collaborative Entity-Based Intelligence Analysis
    • E. Bier, S. Card, and J. Bodnar. Principles and Tools for Collaborative Entity-Based Intelligence Analysis. TVCG, 16(2):178-191, 2010.
    • (2010) TVCG , vol.16 , Issue.2 , pp. 178-191
    • Bier, E.1    Card, S.2    Bodnar, J.3
  • 4
    • 33745898218 scopus 로고    scopus 로고
    • Entity Workspace: An Evidence File That Aids Memory, Inference, and Reading
    • E. Bier, E. Ishak, and E. Chi. Entity Workspace: An Evidence File That Aids Memory, Inference, and Reading. In ISI '06, pages 466-472, 2006.
    • (2006) ISI '06 , pp. 466-472
    • Bier, E.1    Ishak, E.2    Chi, E.3
  • 5
    • 84864980626 scopus 로고    scopus 로고
    • Fuzzy Association Rule Mining for Community Crime Pattern Discovery
    • A. L. Buczak and C. M. Gifford. Fuzzy Association Rule Mining for Community Crime Pattern Discovery. In ACM ISI-KDD '10, pages 2:1-2:10, 2010.
    • (2010) ACM ISI-KDD '10
    • Buczak, A.L.1    Gifford, C.M.2
  • 6
    • 84937435100 scopus 로고    scopus 로고
    • Greedy Approximation Algorithms for Finding Dense Components in a Graph
    • M. Charikar. Greedy Approximation Algorithms for Finding Dense Components in a Graph. In APPROX '00, pages 84-95, 2000.
    • (2000) APPROX '00 , pp. 84-95
    • Charikar, M.1
  • 8
    • 15744401919 scopus 로고    scopus 로고
    • Graph-based Comparisons of Scenarios in Intelligence Analysis
    • G. Chin, O. A. Kuchar, P. D. Whitney, M. Powers, and K. E. Johnson. Graph-based Comparisons of Scenarios in Intelligence Analysis. In SMC '04, volume 4, pages 3175-3180, 2004.
    • (2004) SMC '04 , vol.4 , pp. 3175-3180
    • Chin, G.1    Kuchar, O.A.2    Whitney, P.D.3    Powers, M.4    Johnson, K.E.5
  • 9
    • 27544447724 scopus 로고    scopus 로고
    • Information Fusion for Intelligence Analysis
    • K. Chopra and C. Haimson. Information Fusion for Intelligence Analysis. In HICSS '05, page 111.1, 2005.
    • (2005) HICSS '05
    • Chopra, K.1    Haimson, C.2
  • 10
    • 4243169182 scopus 로고    scopus 로고
    • Graph-based Technologies for Intelligence Analysis
    • March
    • T. Coffman, S. Greenblatt, and S. Marcus. Graph-based Technologies for Intelligence Analysis. Commun. ACM, 47:45-47, March 2004.
    • (2004) Commun. ACM , vol.47 , pp. 45-47
    • Coffman, T.1    Greenblatt, S.2    Marcus, S.3
  • 13
    • 0000546609 scopus 로고
    • I-Divergence Geometry of Probability Distributions and Minimization Problems
    • Feb.
    • I. Csiszár. I-Divergence Geometry of Probability Distributions and Minimization Problems. The Annals of Probability, 3(1):146-158, Feb. 1975.
    • (1975) The Annals of Probability , vol.3 , Issue.1 , pp. 146-158
    • Csiszár, I.1
  • 14
    • 0001573124 scopus 로고
    • Generalized Iterative Scaling for Log-Linear Models
    • J. Darroch and D. Ratcliff. Generalized Iterative Scaling for Log-Linear Models. Annals of Mathematical Statistics, 43(5):1470-1480, 1972.
    • (1972) Annals of Mathematical Statistics , vol.43 , Issue.5 , pp. 1470-1480
    • Darroch, J.1    Ratcliff, D.2
  • 15
    • 80055028928 scopus 로고    scopus 로고
    • Last accessed: May 26, 2011
    • FMS Advanced Systems Group, FMS Inc. Sentinel Visualizer. Last accessed: May 26, 2011, http://www.fmsasg.com/.
    • Sentinel Visualizer
  • 16
    • 33745189772 scopus 로고    scopus 로고
    • Supporting Insight-based Information Exploration in Intelligence Analysis
    • April
    • J. Gersh, B. Lewis, J. Montemayor, C. Piatko, and R. Turner. Supporting Insight-based Information Exploration in Intelligence Analysis. Commun. ACM, 49, April 2006.
    • (2006) Commun. ACM , vol.49
    • Gersh, J.1    Lewis, B.2    Montemayor, J.3    Piatko, C.4    Turner, R.5
  • 17
    • 0036261416 scopus 로고    scopus 로고
    • ThemeRiver: Visualizing Thematic Changes in Large Document Collections
    • S. Havre, E. Hetzler, P. Whitney, and L. Nowell. ThemeRiver: Visualizing Thematic Changes in Large Document Collections. TVCG, 8(1):9-20, 2002.
    • (2002) TVCG , vol.8 , Issue.1 , pp. 9-20
    • Havre, S.1    Hetzler, E.2    Whitney, P.3    Nowell, L.4
  • 19
    • 84866011184 scopus 로고    scopus 로고
    • Storytelling in Entity Networks to Support Intelligence Analysts
    • To appear
    • M. S. Hossain, P. Butler, A. P. Boedihardjo, and N. Ramakrishnan. Storytelling in Entity Networks to Support Intelligence Analysts. In KDD '12, To appear, 2012.
    • (2012) KDD '12
    • Hossain, M.S.1    Butler, P.2    Boedihardjo, A.P.3    Ramakrishnan, N.4
  • 21
    • 84871583101 scopus 로고    scopus 로고
    • Last accessed: May 26, 2011
    • i2group. The Analyst's Notebook. Last accessed: May 26, 2011, http://www.i2group.com/us.
    • The Analyst's Notebook
  • 23
    • 0020187981 scopus 로고
    • On the Rationale of Maximum-Entropy Methods
    • E. Jaynes. On the Rationale of Maximum-Entropy Methods. PIEEE, 70(9):939-952, 1982.
    • (1982) PIEEE , vol.70 , Issue.9 , pp. 939-952
    • Jaynes, E.1
  • 24
    • 34247101797 scopus 로고    scopus 로고
    • NetLens: Iterative Exploration of Content-actor Network Data
    • H. Kang, C. Plaisant, B. Lee, and B. B. Bederson. NetLens: Iterative Exploration of Content-actor Network Data. Info. Vis., 6(1):18-31, 2007.
    • (2007) Info. Vis. , vol.6 , Issue.1 , pp. 18-31
    • Kang, H.1    Plaisant, C.2    Lee, B.3    Bederson, B.B.4
  • 25
  • 28
    • 12244263046 scopus 로고    scopus 로고
    • A Graph-Theoretic Approach to Extract Storylines from Search Results
    • R. Kumar, U. Mahadevan, and D. Sivakumar. A Graph-Theoretic Approach to Extract Storylines from Search Results. In ACM KDD '04, pages 216-225, 2004.
    • (2004) ACM KDD '04 , pp. 216-225
    • Kumar, R.1    Mahadevan, U.2    Sivakumar, D.3
  • 29
    • 35248837345 scopus 로고    scopus 로고
    • Criminal Incident Data Association Using the OLAP Technology
    • S. Lin and D. E. Brown. Criminal Incident Data Association Using the OLAP Technology. In ISI'03, pages 13-26, 2003.
    • (2003) ISI'03 , pp. 13-26
    • Lin, S.1    Brown, D.E.2
  • 30
    • 84865007391 scopus 로고    scopus 로고
    • A Multi-agent System of Evidential Reasoning for Intelligence Analyses
    • E. Lindahl, S. O'Hara, and Q. Zhu. A Multi-agent System of Evidential Reasoning for Intelligence Analyses. In AAMAS '07, pages 279:1-279:6, 2007.
    • (2007) AAMAS '07
    • Lindahl, E.1    O'Hara, S.2    Zhu, Q.3
  • 31
    • 80052675183 scopus 로고    scopus 로고
    • Tell Me What I Need to Know: Succinctly Summarizing Data with Itemsets
    • M. Mampaey, N. Tatti, and J. Vreeken. Tell Me What I Need to Know: Succinctly Summarizing Data with Itemsets. In ACM KDD '11, pages 573-581, 2011.
    • (2011) ACM KDD '11 , pp. 573-581
    • Mampaey, M.1    Tatti, N.2    Vreeken, J.3
  • 32
    • 80053021266 scopus 로고    scopus 로고
    • On the Relation between Centrality Measures and Consensus Algorithms
    • july
    • A. Noori. On the Relation between Centrality Measures and Consensus Algorithms. In HPCS, 2011, pages 225 -232, july 2011.
    • (2011) HPCS, 2011 , pp. 225-232
    • Noori, A.1
  • 33
    • 33745850694 scopus 로고    scopus 로고
    • The Sensemaking Process and Leverage Points for Analyst Technology as Identified through Cognitive Task Analysis
    • P. Pirolli and S. Card. The Sensemaking Process and Leverage Points for Analyst Technology as Identified through Cognitive Task Analysis. In ICIA '05, 2005.
    • ICIA '05, 2005
    • Pirolli, P.1    Card, S.2
  • 34
    • 47349120440 scopus 로고    scopus 로고
    • Last accessed: May 26, 2011
    • PNNL. Pacific Northwest National Laboratory, INSPIRE Visual Document Analysis. Last accessed: May 26, 2011, http://in-spire.pnl.gov.
    • INSPIRE Visual Document Analysis
  • 35
    • 0000120766 scopus 로고
    • Estimating the Dimension of a Model
    • G. Schwarz. Estimating the Dimension of a Model. Annals of Statistics, 6(2):461-464, 1978.
    • (1978) Annals of Statistics , vol.6 , Issue.2 , pp. 461-464
    • Schwarz, G.1
  • 36
    • 84865003210 scopus 로고    scopus 로고
    • Applying Interestingness Measures to Ansar forum Texts
    • D. B. Skillicorn. Applying Interestingness Measures to Ansar forum Texts. In ACM ISI-KDD '10, pages 7:1-7:9, 2010.
    • (2010) ACM ISI-KDD '10
    • Skillicorn, D.B.1
  • 37
    • 33749331861 scopus 로고    scopus 로고
    • Using Support Vector Machines for Terrorism Information Extraction
    • A. Sun, M.-M. Naing, E.-P. Lim, and W. Lam. Using Support Vector Machines for Terrorism Information Extraction. In ISI'03, pages 1-12, 2003.
    • (2003) ISI'03 , pp. 1-12
    • Sun, A.1    Naing, M.-M.2    Lim, E.-P.3    Lam, W.4
  • 38
    • 0242625291 scopus 로고    scopus 로고
    • Selecting the Right Interestingness Measure for Association Patterns
    • P.-N. Tan, V. Kumar, and J. Srivastava. Selecting the Right Interestingness Measure for Association Patterns. In ACM KDD '02, pages 32-41, 2002.
    • (2002) ACM KDD '02 , pp. 32-41
    • Tan, P.-N.1    Kumar, V.2    Srivastava, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.