Abstract
An algorithm to detect invisible relevant persons in a homogeneous social network is studied with computer simulation. The network is effective as a model for contemporary inter-working terrorists where large hub persons do not exist. Absense of large hub persons results in that the observed communication flow is also homogeneous. Clues regarding invisible relevant persons are hardly found in communication records. This task is, therefore, generally difficult. We demonstrate that our algorithm identifies the portion of the market baskets representing communication records, where invisible relevant persons are likely to be hidden, with good precision. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Maeno, Y., Ito, K., & Ohsawa, Y. (2007). Detecting invisible relevant persons in a homogeneous social network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4490 LNCS, pp. 74–81). Springer Verlag. https://doi.org/10.1007/978-3-540-72590-9_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
