Collaborative mining in multiple social networks data for criminal group discovery

Proceedings - 12th IEEE International Conference on Computational Science and Engineering, CSE 2009

Volumn 4, Issue , 2009, Pages 582-587

  Fard, Amin Milani ^a   Ester, Martin ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Associacion rule mining; Criminal network discovery; Multi agent system; Social network analysis

Indexed keywords

ASSOCIATION MINING; CRIMINAL INVESTIGATION; CRIMINAL NETWORKS; DATA SETS; HIDDEN KNOWLEDGE; INTELLIGENCE AGENCIES; KNOWLEDGE DISCOVERY; MANUAL PROCESS; MULTI-AGENT MODEL; NETWORK DATA; NETWORK-BASED ANALYSIS; P2P APPLICATIONS; POLICE STATION; RULE MINING; SOCIAL NETWORK ANALYSIS; SOCIAL NETWORKS;

BEHAVIORAL RESEARCH; COMPUTER SCIENCE; ELECTRIC NETWORK ANALYSIS; FLUORINE CONTAINING POLYMERS; GAME THEORY; MINING; MULTI AGENT SYSTEMS;

LAW ENFORCEMENT;

EID: 70849134056     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSE.2009.435     Document Type: Conference Paper

References (27)

1. S. H. Strogatz, "Exploring complex networks", Nature 410, 2001, pp. 268-276.
2. P. Holme, "Network dynamics of ongoing social relationships", Europhysics Letters 64 (3), 2003, pp. 427-433.
3. P.Holme, S.M. Park, B.J. Kim, and C.R. Edling, "Korean university life in a network perspective", Dynamics of a large affiliation network, Physica A 307, 2007, pp. 821-830.
4. A.-L., Barabasi, R. Albert, "Emerg ence of scaling in random networks", Science 286, 1999, pp. 509-512.
5. A. Milani Fard, "Competitive-Cooperative Automated Reasoning from Distributed and Multiple Source of Data", in: Data Mining and Multiagent Integration, Ed: Longbing Cao, LNCS 5680, Springer, 2009.
6. K. Borgwardt, X. Yan: "Graph Mining and Graph Kernels", KDD, 2008.
7. J. Kleinberg, et al.: "The web as a graph: Measurements, models and methods", COCOON, 1998.
8. J. Leskovec and C. Faloutsos, "Mining Large Graphs", Tutorial ECML/PKDD, 2007.
9. M. E. J. Newman: "Fast algorithm for detecting community structure in networks", Phys. Rev. E 69, 2004.
10. H. Chen, W. Chung, J. J. Xu, G. Wang, Y. Qin, M. Chau, "Crime Data Mining: A General Framework and Some Examples", Computer, vol. 37, no. 4, 2004, pp. 50-56.
11. J. J. Xu, H. Chen, "CrimeNet explorer: a framework for criminal network knowledge discovery" ACM Trans. Inf. Syst., Vol. 23, No. 2., 2005, pp. 201-226.
12. J. S. de Bruin, T. K. Cocx, W. A. Kosters, J. F. J. Laros, and J. N. Kok, "Data Mining Approaches to Criminal Career Analysis", Sixth IEEE International Conference on Data Mining ICDM'06, 2006, pp. 171-177.
13. J. Pei, D. Jiang, and A. Zhang. "On Mining Cross-Graph Quasi- Cliques". In Proceedings of the 11th ACM SIGKDD (KDD'05), Chicago, IL, USA, August 21-24, 2005.
14. E. Adar, L. Zhang, L.A. Adamic, R.M. Lukose, Implicit structure and the dynamics of blogspace, in: Workshop on the Weblogging Ecosystem, 2004.
15. J. Leskovec, M. McGlohon, C. Faloutsos, N. Glance, M. Hurst, Cascading behavior in large blog graphs, in: Proc. SIAM International Conference on Data Mining, 2007.
16. E. Cheng, J.W. Grossman and M.J. Lipman, Time-stamped graphs and their associated influence digraphs, Discrete Applied Mathematics 128 2003, pp. 317-335.
17. D. Kempe, J. Kleinberg, A. Kumar, Connectivity and inference problems for temporal networks, in Proc. 32nd ACM Symp. on Theory of Computing, 2000, pp. 504-513.
18. P. Holme, Network reachability of real-world contact sequences, Physical Review E 71, 2005, p. 046119.
19. J.-P. Onnela, J. Saramäki, J. Hyvönen, G. Szabó, D. Lazer, K. Kaski, J. Kertesz and A.-L. Barabási, Structure and tie strengths in mobile communication networks, Proceedings of the National Academy of Sciences 104, 2007, pp. 7332-7336. Full Text via CrossRef | View Record in Scopus | Cited By in Scopus (26).
20. M.C. Gonzalez, C.A. Hidalgo, A.-L. Barabási, Understanding individual humanmobility patterns, Nature 453, 2008, pp. 479-482.
21. M. Balazinska and P. Castro, Characterizing mobility and network usage in a corporate wireless local-area network, MobiSys '03 Proceedings First International Conference on Mobile Systems, Applications and Services, ACM Press, New York, 2003, pp. 303-316.
22. A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass and J. Scott, Impact of human mobility on the design of opportunistic forwarding algorithms, Proceedings 25th IEEE Conference on Computer Communications (INFOCOM), IEEE CS Press, New York, 2006.
23. E. Yoneki, P. Hui and J. Crowcroft, Wireless epidemic spread in dynamic human networks, Bio-Inspired Computing and Communication, LNCS vol. 5151, Springer, 2008, pp. 116-132.
24. Agrawal R, T. Imielinski, A.N. Swami, "Mining Association Rules between Sets of Items in Large Databases." SIGMOD, 22(2): June 1993.
25. A.; Neyman, "Bounded complexity justifies cooperation in finitely repeated prisoner's dilemma". Economic Letters, 1985, pages 227-229.
26. Dempster, A., A generalization ofba yesian inference. Journal of the Royal Statistical Society, 1968, 30:205-247.
27. Schafer, G., A mathematical theory of evidence, volume 2702. Princetown University Press, 1976.