![](bg4.png)
Figure 4: A clustered network with one collapsed cluster.
ily compared. We remark that centrality indices make
sense only for nodes representing the actors of the net-
work, like persons, companies, and banks. Hence, in
order to compute the centrality of these actors, we run
the algorithm on a different suitable network consist-
ing only of actors. Namely, we add an edge between
two actors if the length of the shortest path between
them is at most d (for a pre-set constant d), and then
we remove all nodes that are not actors.
3 DEMO PROPOSAL
The database of the system will be loaded with an
anonymized anti-money laundering archive. In the
demonstration, the user will be given an evidence of a
possible suspicious person or company. An evidence
can be for example a set of suspicious transactions
made by a person or by a company. Starting from this
seed entity, the task will be that of exploring and ana-
lyzing the related network using the tools provided in
the system. User’s impressions and comments will be
recorded by means of an interview.
Figure 5: A user interacting with VIS4AUI by a touch-
screen.
REFERENCES
Batagelj, V., Mrvar, A., and Zaver
ˇ
snik, M. (1999). Par-
titioning approach to visualization of large networks.
In GD 1999, volume 1731 of LNCS, pages 90–97.
Chang et al., R. (2008). Scalable and interactive visual anal-
ysis of financal wire transactions for fraud detection.
Information Visualization, 7(1):63–76.
Chen, H., Atabakhsh, H., Tseng, C., Marshall, B., Kaza,
S., Eggers, S., Gowda, H., Shah, A., Petersen, T., and
Violette, C. (2005). Visualization in law enforcement.
In CHI, pages 1268–1271. ACM.
Didimo, W. and Liotta, G. (2007). Mining Graph Data,
chapter Graph Visualization and Data Mining, pages
35–64. Wiley.
Didimo, W., Liotta, G., Montecchiani, F., and Palladino, P.
(2011). An advanced network visualization system for
financial crime detection. In PacificVis, pages 203–
210. IEEE.
Dorogovtsev, S. N., Goltsev, A. V., and Mendes, J. F. F.
(2005). k-core organization of complex networks.
CoRR, abs/cond-mat/0509102.
Eades, P. (1984). A heuristic for graph drawing. In Con-
gressus Numerantium, volume 42, pages 149–160.
Fruchterman, T. M. J. and Reingold, E. M. (1991). Graph
drawing by force-directed placement. Softw., Pract.
Exper., 21(11):1129–1164.
Goldberg, H. G. and Senator, T. E. (1995). Restructuring
databases for knowledge discovery by consolidation
and link formation. In Proceedings of the First In-
ternational Conference on Knowledge Discovery and
Data Mining, pages 136–141. AAAI Press.
Goltsev, A. V., Dorogovtsev, S. N., and Mendes, J. F. F.
(2006). k-core (bootstrap) percolation on complex
networks: Critical phenomena and nonlocal effects.
CoRR, abs/cond-mat/0602611.
Klerks, P. and Smeets, E. (2001). The network paradigm ap-
plied to criminal organizations: Theoretical nitpicking
or a relevant doctrine for investigators? Recent devel-
opments in the netherlands. Connections, 24:53–65.
Seidman, S. B. (1983). Network structure and minimum
degree. Social Networks, 5:269–287.
Stasko, J., G
¨
org, C., and Liu, Z. (2008). Jigsaw: support-
ing investigative analysis through interactive visual-
ization. Information Visualization, 7:118–132.
Tang, L., Barbier, G., Liu, H., and Zhang, J. (2010). A so-
cial network analysis approach to detecting suspicious
online financial activities. In Advances in Social Com-
puting, LNCS, pages 390–397.
Westphal, C. (2009). Data Mining for Intelligence, Fraud,
& Criminal Detection. CRC Press.
Xu, J. and Chen, H. (2005). Criminal network analysis and
visualization. Comm. of the ACM, 48(6):101–107.
IVAPP 2012 - International Conference on Information Visualization Theory and Applications
802