{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:10:38Z","timestamp":1774797038855,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540259992","type":"print"},{"value":"9783540320630","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427995_5","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T23:27:06Z","timestamp":1279063626000},"page":"49-59","source":"Crossref","is-referenced-by-count":12,"title":["Link Analysis Tools for Intelligence and Counterterrorism"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Badia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmed","family":"Kantardzic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Finding Out About","author":"R. Belew","year":"2000","unstructured":"Belew, R.: Finding Out About. Cambridge University Press, Cambridge (2000)"},{"key":"5_CR2","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)"},{"key":"5_CR3","volume-title":"Proceedings of the 16th International Conference on Data Engineering, ICDE 2000, San Diego, California, USA","author":"E. Cohen","year":"2000","unstructured":"Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J.D., Yang, C.: Finding Interesting Associations without Support Pruning. In: Proceedings of the 16th International Conference on Data Engineering, ICDE 2000, San Diego, California, USA. IEEE Computer Society, Los Alamitos (2000)"},{"key":"5_CR4","unstructured":"Enron data set, available at \n                      \n                        http:\/\/www-2.cs.cmu.edu\/7Eenron\/"},{"key":"5_CR5","first-page":"31","volume-title":"Proceedings of the KDD 2004 Workshop on Multi-Relational Data Mining, Seattle, CA","author":"P. Domingos","year":"2004","unstructured":"Domingos, P.: Multi-Relational Record Linkage. In: Proceedings of the KDD 2004 Workshop on Multi-Relational Data Mining, Seattle, CA, pp. 31\u201348. ACM Press, New York (2004)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45571-X_11","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"F. Hussain","year":"2000","unstructured":"Hussain, F., Liu, H., Suzuki, E., Lu, H.: Exception Rule Mining and with Relative Interestingness Measure. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805. Springer, Heidelberg (2000)"},{"key":"5_CR7","unstructured":"Hue, G., et al.: Implicit Link Analysis for Small Web Search. In: SIGIR 2003, Toronto, Canada (2003)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Imberman, S.P., Domanski, B., Thompson, H.W.: Using Dependency\/Association Rules to Find Indications of Computarized Tomography in a Head Trauma Dataset. Artificial Intelligence in Medicine\u00a026(1-2) (2002)","DOI":"10.1016\/S0933-3657(02)00052-0"},{"key":"5_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04138-3","volume-title":"Fundamentals of Data Warehousing","author":"M. Jarke","year":"2000","unstructured":"Jarke, M., Lenzerini, M., Vassiliou, Y., Vassiliadis, P.: Fundamentals of Data Warehousing. Springer, Heidelberg (2000)"},{"key":"5_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-44794-6_21","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"S. Jaroszewicz","year":"2001","unstructured":"Jaroszewicz, S., Simovici, D.A.: A General Measure of Rule Interestingness. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol.\u00a02168, p. 253. Springer, Heidelberg (2001)"},{"key":"5_CR11","volume-title":"Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA","author":"S. Jaroszewicz","year":"2004","unstructured":"Jaroszewicz, S., Simovici, D.A.: Interestingness of frequent itemsets using Bayesian networks as background knowledge. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA. ACM Press, New York (2004)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: An Efficient Algorithm for Discovering Frequent Subgraphs, Technical report, Department of Computer Science, University of Minnesota (2002), \n                      \n                        http:\/\/www.cs.umn.edu\/kuram\/papers\/fsg-long.pdf\n                      \n                      \n                    , \n                      \n                        http:\/\/citeseer.ist.psu.edu\/kuramochi02efficient.html","DOI":"10.21236\/ADA439497"},{"key":"5_CR13","unstructured":"Lin, S., Chalupsky, H.: Unsupervised Link Discovery in Multi-Relational Data via Rarity Analysis. In: Proceedings of the Third IEEE International Conference on Data Mining, ICDM 2003 (2003)"},{"key":"5_CR14","unstructured":"Skillicorn, D.B.: Detecting Related Message Traffic. In: Workshop on Link Analysis, Counterterrorism, and Privacy, SIAM International Conference on Data Mining 2004, Seattle, WA, USA (August 2004)"},{"key":"5_CR15","volume-title":"Proceedings of the Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (SIGKDD 2002) 2002, Edmonton, Alberta, Canada","author":"P. Tan","year":"2002","unstructured":"Tan, P., Kumar, V., Srivastava, J.: Selecting the Right Interestingness Measure for Association Patterns. In: Proceedings of the Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD 2002) 2002, Edmonton, Alberta, Canada. ACM Press, New York (2002)"},{"key":"5_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0167-9236(03)00117-9","volume":"38","author":"J.J. Xu","year":"2004","unstructured":"Xu, J.J., Chen, H.: Using Shortest Path Algorithms to Identify Criminal Associations. Decision Support Systems\u00a038, 473\u2013487 (2004)","journal-title":"Decision Support Systems"}],"container-title":["Lecture Notes in Computer Science","Intelligence and Security Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427995_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:00Z","timestamp":1619507400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427995_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259992","9783540320630"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11427995_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}