Node discovery in a networked organization

Details Node discovery in a networked organization Node discovery in a networked organization

2008-03-24

arxiv.org/abs/0803.3363v2

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, San Antonio, October 2009

Computer Science

Artificial Intelligence

Scientific paper

In this paper, I present a method to solve a node discovery problem in a networked organization. Covert nodes refer to the nodes which are not observable directly. They affect social interactions, but do not appear in the surveillance logs which record the participants of the social interactions. Discovering the covert nodes is defined as identifying the suspicious logs where the covert nodes would appear if the covert nodes became overt. A mathematical model is developed for the maximal likelihood estimation of the network behind the social interactions and for the identification of the suspicious logs. Precision, recall, and F measure characteristics are demonstrated with the dataset generated from a real organization and the computationally synthesized datasets. The performance is close to the theoretical limit for any covert nodes in the networks of any topologies and sizes if the ratio of the number of observation to the number of possible communication patterns is large.

Affiliated with

Also associated with

No associations

Rating

Node discovery in a networked organization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Node discovery in a networked organization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Node discovery in a networked organization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-615295