Abstract
Community detection in directed networks appears as one of dominant research works in network analysis. Most existing models for community detection are symmetric, in which incom-ming and outgoing links are treated equally. In this paper, we propose a method based on Formal Concepts that takes into account both symmetric and non-symmetric properties of links. To validate our approach, experiments on known networks with symmetric property of links in directed graphs show that outputs detect the same communities as some of state-of-art methods; while, with non-symmetric property of links, only this approach uncovers expected communities. Its Experimental results on benchmark are also better than those of many existing algorithms.