Выявление черных дыр в Интернете

Сообщение послал(а): Владимир (77.108.83.138)
Дата: Вторник, 1 Апреля 2008, at 10:06 a.m.

Опубликована еще одна статья по выявлению/связи скрытых узлов в Интернете. Применяется ряд стандартных статистических алгоритмов. Но в этой области можно ожидать гораздо более интересных результатов, см. например DARPA- математика.

Discovering covert node in networked organization. Yoshiharu Maeno, Yukio Ohsawa
http://aps.arxiv.org/pdf/0803.3363

Природа статьи внутренне противоречива: делать такой анализ сохраняя политкорректность абсурд. Например поставить в центр узла подрывную деятельность Киссинджера.

Так как авторы японцы - референтом может быть Томас Берден, аналитик занимающийся новой энергетикой (Tom Bearden - http://www.cheniere.org/books/index.html)

COVERT nodes in an networked organization are the persons who exist in a social network including many individuals and sub-organizations, but do not appear in the records which are observed on the communication or collaborative activities among the nodes.

Research interests have been extending from describing characteristic nature and behaviors to modeling and predicting unknown phenomena.

The node discovery predicts the existence of an unknown node around the known nodes from the information on the collective behavior of the network.

The Markov random network is used to learn the dependency between the links which shares a node.

The expert investigatorfs prior understanding, insight on the terrorists▓ social network nature, and computational data processing are
integrated.

Learning techniques of latent variables may be employed once the presence of a node is known.

The influence transmission governs the possible communication patterns which may result in the observation data.

A simple incremental optimization technique (hill climbing method) is employed to solve eq.. Advanced metaheuristic algorithms such as simulated annealing, or genetic algorithm, may be employed to avoid sub-optimal solutions.

Barab╢asi-Albert model with a group structure is used as a generalization of hubs and group structure in the model.

In the investigation of clandestine organizations, the method aids the investigators to identify the suspicious records in which the covert leader or critical conspirator would appear, or suspicious persons who would be their neighbors, if they became overt.

A fake node is the person who does not exist in the organization, but appears in the observation. A spoofing node is the person who exists in the organization, but appears as a different node in the observation.

The discovered covert nodes may provide with a clue to approach the hidden intention of the author, an emerging opinion which is about to crystallize, or a sign of trends.

Предыдущая статья на эту тему:

Collecting the Dots. Problem Formulation and Solution Elements. Martin C. Libicki, Shari Lawrence Pfleeger (RAND)
www.rand.org/pubs/o