pith. sign in

arxiv: 0710.4975 · v2 · pith:2TVPYQPFnew · submitted 2007-10-26 · 💻 cs.AI

Node discovery problem for a social network

classification 💻 cs.AI
keywords nodescovertnetworksocialactivitiesappearcollaborativediscovery
0
0 comments X
read the original abstract

Methods to solve a node discovery problem for a social network are presented. Covert nodes refer to the nodes which are not observable directly. They transmit the influence and affect the resulting collaborative activities among the persons in a social network, but do not appear in the surveillance logs which record the participants of the collaborative activities. Discovering the covert nodes is identifying the suspicious logs where the covert nodes would appear if the covert nodes became overt. The performance of the methods is demonstrated with a test dataset generated from computationally synthesized networks and a real organization.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.