  In existing research, as an example of one-sided preference, a conversation
structure in which a person who is assumed to be an adult mainly sends
one-sided messages to a person who is assumed to be a minor was observed. If
subgraphs composed based on such unilateral preferences could be automatically
extracted from the network structure, it would be possible to automatically
detect communication conducted based on specific motivations from a vast amount
of conversation data. In this study, we construct a bottom-up method to detect
subgraphs composed of unilateral preferences in Greedy, and discuss the subset
of unilateral preferences detected in this simulation.

Physics and Society;Social and Information Networks