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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Barabási, A.L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A 272, 173–187 (1999)
Hastie, T., Tibshirani, R., Friedman, J.: The elements of statistical learning: Data mining, inference, and prediction. Springer series in statistics. Springer, Heidelberg (2001)
Keila, P.S., Skillicorn, D.B.: Structure in the Enron email dataset. J. Computational & Mathematical Organization Theory 11, 183–199 (2006)
Maeno, Y., Ohsawa, Y.: Human-computer interactive annealing for discovering invisible dark events. To appear, IEEE Trans. Industrial Electronics (2007)
Maeno, Y., Ohsawa, Y.: Stable deterministic crystallization for discovering hidden hubs. In: IEEE Int’l. Conf. Systems, Man & Cybernetics, Taipei (2006)
Maeno, Y., Ito, K., Horie, K., Ohsawa, Y.: Human-interactive annealing for turning threat to opportunity in technology development. In: Proc. IEEE Int’l. Conf. Data Mining, Workshops, Hong Kong, pp. 714–717 (2006)
Ohsawa, Y. (ed.): Chance discovery in real world decision making. Springer, Heidelberg (2006)
Ohsawa, Y.: Data crystallization: chance discovery extended for dealing with unobservable events. New Mathematics and Natural Computation 1, 373–392 (2005)
Popp, R.L., Yen, J.: Emergent information technologies and enabling policies for counter-terrorism. IEEE Computer Society Press, Los Alamitos (2006)
Singh, S., Allanach, J., Haiying, T., Pattipati, K., Willett, P.: Stochastic modeling of a terrorist event via the ASAM system. In: Proc. IEEE Int’l. Conf. Systems, Man & Cybernetics, Hague, vol. 6, pp. 5673–5678 (2004)
Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 398, 440–442 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Maeno, Y., Ito, K., Ohsawa, Y. (2007). Detecting Invisible Relevant Persons in a Homogeneous Social Network. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72590-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-72590-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72589-3
Online ISBN: 978-3-540-72590-9
eBook Packages: Computer ScienceComputer Science (R0)