Node discovery in a networked organization

  title={Node discovery in a networked organization},
  author={Yoshiharu Maeno},
  journal={2009 IEEE International Conference on Systems, Man and Cybernetics},
  • Y. Maeno
  • Published 23 March 2008
  • Computer Science
  • 2009 IEEE International Conference on Systems, Man and Cybernetics
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… Expand
Hidden network reconstruction from information diffusion
  • F. Crawford
  • Computer Science
  • 2015 18th International Conference on Information Fusion (Fusion)
  • 2015
The approach is a generalization of tools developed to reconstruct drug-user networks from respondent-driven sampling studies in epidemiology, and the likelihood of the diffusion process can be interpreted as an exponential random graph model. Expand
Covert nodes mining in social networks based on games theory
This paper proposes the model which analyzes game in the influence transmission, and obtains each nodes contribution by calculating the nodes earning in game. Expand
Analyzing and modeling real-world phenomena with complex networks: a survey of applications
A diversity of phenomena are surveyed, which may be classified into no less than 11 areas, providing a clear indication of the impact of the field of complex networks. Expand
Towards Mining of Stakeholders in Criminal Organizations from Telecommunication Metadata: Analytic Approach to Latent Feature Extraction
The approach arrived at a new feature for the description and identification of a CS that is dynamic and it is not self-sufficient like vulnerability and influence that is general to the covert nodes, or network leader (NL), which depends on NL’s position in the structure. Expand
User reputation in a comment rating environment
A novel bias-smoothed tensor model is proposed and empirically show that the model significantly outperforms a number of alternatives based on Yahoo! News, Yahoo! Buzz and Epinions datasets. Expand


Network Inference From Co-Occurrences
A polynomial-time Monte Carlo EM algorithm based on importance sampling and derive conditions that ensure convergence of the algorithm with high probability is proposed, which would significantly simplify inferring network structure from "co-occurrence" data. Expand
The link-prediction problem for social networks
Experiments on large coauthorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures. Expand
Friends and neighbors on the Web
It is shown that some factors are better indicators of social connections than others, and that these indicators vary between user populations. Expand
Mixture models and exploratory analysis in networks
  • M. Newman, E. Leicht
  • Computer Science, Physics
  • Proceedings of the National Academy of Sciences
  • 2007
A general technique for detecting structural features in large-scale network data that works by dividing the nodes of a network into classes such that the members of each class have similar patterns of connection to other nodes is described. Expand
Analyzing covert social network foundation behind terrorism disaster
The method aims at integrating the expert investigator's prior understanding, insight on the terrorists' social network nature derived from the complex graph theory and computational data processing. Expand
Link mining: a survey
While network analysis has been studied in depth in particular areas such as social network analysis, hypertext mining, and web analysis, only recently has there been a cross-fertilization of ideas among these different communities. Expand
Link Prediction in Relational Data
It is shown that the collective classification approach of RMNs, and the introduction of subgraph patterns over link labels, provide significant improvements in accuracy over flat classification, which attempts to predict each link in isolation. Expand
Uncovering the overlapping community structure of complex networks in nature and society
After defining a set of new characteristic quantities for the statistics of communities, this work applies an efficient technique for exploring overlapping communities on a large scale and finds that overlaps are significant, and the distributions introduced reveal universal features of networks. Expand
Network models for social influence processes
This paper generalizes thep* class of models for social network data to predict individual-level attributes from network ties. Thep* model for social networks permits the modeling of socialExpand
9. Neighborhood-Based Models for Social Networks
We argue that social networks can be modeled as the outcome of processes that occur in overlapping local regions of the network, termed local social neighborhoods. Each neighborhood is conceived as aExpand